All sites of Mathematics

Distributed.net: Project OGR Distributed.net: Project OGR
Distributed.net: Project OGR- Describes the computerized effort to prove that the known shortest Golomb rulers (up to 25 marks) are really the shortest, or else find the actual shortest ones. ...
Library of D-optimal Designs Library of D-optimal Designs
Library of D-optimal Designs- Compiled by Jennifer Seberry. ...
Design Resources Design Resources
Design Resources- Links to resources for design theory maintained by Peter Cameron. ...
Design Theory Lecture Notes on the Web Design Theory Lecture Notes on the Web
Design Theory Lecture Notes on the Web- Links compiled by Peter Cameron. ...
Tom Leighton Tom Leighton
Tom Leighton- Algorithms for network applications and cryptography. ...
Design Theory Resource Server Design Theory Resource Server
Design Theory Resource Server- A research project founded by the UK Engineering and Physical Sciences Research Council. ...
Handbook of Combinatorial Designs Handbook of Combinatorial Designs
Handbook of Combinatorial Designs- Home page for The CRC Handbook of Combinatorial Designs. ...
La Jolla Covering Repository La Jolla Covering Repository
La Jolla Covering Repository- A database of good covering designs constructed by Dan Gordon. ...
Library of SBIBD Library of SBIBD
Library of SBIBD- Compiled by Jennifer Seberry. ...
Caps in Finite Geometries Caps in Finite Geometries
Caps in Finite Geometries- Tables and examples in PG(k-1,q) by Yves Edel. ...
Some Constant Weight Codes Some Constant Weight Codes
Some Constant Weight Codes- As orbits of AG(2,q), PSL(2,2^f) and PGammaL(2,2^f) by Yves Edel. ...
SOMA Update SOMA Update
SOMA Update- Leonard Soicher reports on new SOMAs, which are generalisations of mutually orthogonal Latin squares. ...
The Hadamard Maximal Determinant Problem The Hadamard Maximal Determinant Problem
The Hadamard Maximal Determinant Problem- List of known {-1,1}-matrices with largest determinant and D-optimal designs. ...
Blocks and Design Applet Blocks and Design Applet
Blocks and Design Applet- Fractional factorial design generator by Marko Boon. ...
Mathworld - Golomb Ruler Mathworld - Golomb Ruler
Mathworld - Golomb Ruler- Description and theory, with references to additional reading. ...
The Search for a Finite Projective Plane of Order 10 The Search for a Finite Projective Plane of Order 10
The Search for a Finite Projective Plane of Order 10- By C.W.H. Lam. ...
Orthogonal Arrays Orthogonal Arrays
Orthogonal Arrays- Lists of orthogonal arrays, difference schemes and experimental design tools maintained by Warren F. Kuhfeld. ...
Golomb Rulers Golomb Rulers
Golomb Rulers- Table of lengths of shortest known Golomb rulers, counts of optimal and near-optimal rulers, and some Fortran programs for dealing with Golomb rulers. ...
Golomb Rulers Golomb Rulers
Golomb Rulers- Specification of the problem, research report, references, a solver program and some results. ...
Orthogonal Arrays and Covering Arrays Orthogonal Arrays and Covering Arrays
Orthogonal Arrays and Covering Arrays- Construction using permutation groups, by George Sherwood. ...
Orthogonal Arrays Orthogonal Arrays
Orthogonal Arrays- A library of over 200 orthogonal arrays maintained by N. J. A. Sloane. ...
Hadamard Matrices Hadamard Matrices
Hadamard Matrices- A library of Hadamard matrices maintained by N. J. A. Sloane. ...
ACCOTA ACCOTA
ACCOTA- International Workshop on Combinatorial and Computational Aspects of Optimization, Topology and Algebra. Held biennially. Most recent edition: Huatulco, Oaxaca, México; 3-7 December 2012. ...
Open University Winter Combinatorics Meeting Open University Winter Combinatorics Meeting
Open University Winter Combinatorics Meeting- Held annually. Programme, travel, contact info. ...
FPSAC/SFCA FPSAC/SFCA
FPSAC/SFCA- Formal Power Series and Algebraic Combinatorics Conference (FPSAC) describes past and future events. ...
A New Proof of the Four Colour Theorem A New Proof of the Four Colour Theorem
A New Proof of the Four Colour Theorem- By Ashay Dharwadker. Includes profile, research papers for other algorithms, lecture notes, and student database. ...
Regular Graphs Page Regular Graphs Page
Regular Graphs Page- Tables of simple connected k-regular graphs on n vertices and girth at least g. ...
The Four Color Theorem The Four Color Theorem
The Four Color Theorem- Computer aided proof of the four color theorem by Neil Robertson, Daniel P. Sanders, Paul Seymour and Robin Thomas. ...
Sandpiles in Graphs Sandpiles in Graphs
Sandpiles in Graphs- An application of cellular automata by Angela R. Kerns. ...
Network Resources for Colouring a Graph Network Resources for Colouring a Graph
Network Resources for Colouring a Graph- Resources for formulating and solving coloring problems. ...
Signed, Gain and Biased Graphs Signed, Gain and Biased Graphs
Signed, Gain and Biased Graphs- List of publications and manuscripts annotated by Thomas Zaslavsky. ...
Graphnet Archives Graphnet Archives
Graphnet Archives- Archives of the Graphnet mailing list from February 1990. ...
Getgrats: General Theory of Graph Transformation Systems Getgrats: General Theory of Graph Transformation Systems
Getgrats: General Theory of Graph Transformation Systems- A research network funded by the European Commission. ...
A Survey of Distance-Transitive Graphs A Survey of Distance-Transitive Graphs
A Survey of Distance-Transitive Graphs- By Arjeh M. Cohen. ...
Knight's Tour Problem Knight's Tour Problem
Knight's Tour Problem- Solution for chess boards with up to 32 squares. ...
Parameters of Directed Strongly Regular Graphs Parameters of Directed Strongly Regular Graphs
Parameters of Directed Strongly Regular Graphs- Parameters, constructions and nonexistence information for directed strongly regular graphs. ...
Capillary Multi-Path Routing in a Network of a Directed Symmetric Graph Capillary Multi-Path Routing in a Network of a Directed Symmetric Graph
Capillary Multi-Path Routing in a Network of a Directed Symmetric Graph- By Emin Gabrielyan. ...
Counting Hamilton Cycles in Product Graphs Counting Hamilton Cycles in Product Graphs
Counting Hamilton Cycles in Product Graphs- By Frans Faase. ...
MERLIN MERLIN
MERLIN- An approach to solve the asymmetric travelling salesman problem using linear optimisation with a polynomial bounded set of constraints. ...
The Travelling Salesman Problem The Travelling Salesman Problem
The Travelling Salesman Problem- Discussion of this problem using simulated annealing. Downloadable program by Peter Meyer demonstrates solutions of the problem for particular cases. ...
Graph Theory and Linear Algebra Graph Theory and Linear Algebra
Graph Theory and Linear Algebra- Unreviewed paper by Stephen M Kauffman. ...
Doron Zeilberger Doron Zeilberger
Doron Zeilberger- Combinatorics and automatic formal identities proving. ...
Matrix Graph Grammars Matrix Graph Grammars
Matrix Graph Grammars- Algebraic approach to graph dynamics and graph grammars, using logics, functional analysis and tensor algebra. ...
Combinatorics, Probability and Computing Combinatorics, Probability and Computing
Combinatorics, Probability and Computing- Now published bimonthly, devoted to the three areas of combinatorics, probability theory and theoretical computer science. Topics covered include classical and algebraic graph th ...
The Electronic Journal of Combinatorics The Electronic Journal of Combinatorics
The Electronic Journal of Combinatorics- A refereed all-electronic journal that welcomes papers in all branches of discrete mathematics, including all kinds of combinatorics, graph theory, discrete algorithms. Full text ...
Discrete Mathematics and Theoretical Computer Science Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics and Theoretical Computer Science- DMTCS is an electronic journal published by the Maison de l'Informatique et des Mathématiques Discrètes ...
Annals of Combinatorics Annals of Combinatorics
Annals of Combinatorics- Contributions to combinatorial mathematics in all its aspects. Editor's page: author, subscription and contact information, tables of contents of all volumes. ...
Séminaire Lotharingien de Combinatoire Séminaire Lotharingien de Combinatoire
Séminaire Lotharingien de Combinatoire- A joint seminar in Combinatorics for the Universities of Bayreuth, Erlangen and Strasbourg, as well as the other Universities along the Lotharingian boundaries. Since 1994 the Semi ...
Journal of Combinatorial Designs Journal of Combinatorial Designs
Journal of Combinatorial Designs- Editors' site. Links to publisher, contents of all volumes. ...
SIAM Journal on Discrete Mathematics SIAM Journal on Discrete Mathematics
SIAM Journal on Discrete Mathematics- The SIAM Journal on Discrete Mathematics publishes research articles on a broad range of topics from pure and applied mathematics including combinatorics and graph theory, discrete o ...

Latest sites from Mathematics