This period is reflected in the area 05E, Algebraic combinatorics, of the AMS Mathematics Subject Classification, introduced in 1991.
The proofs by Bowditch and Máthé have been published in Combinatorics, Probability and Computing (edited by Béla Bollobás and Imre Leader).
Ars Conjectandi (Latin for The Art of Conjecturing) is a book on combinatorics and mathematical probability written by Jakob Bernoulli and published in 1713, eight years after his death, by his nephew, Niklaus Bernoulli.
Anders Björner and Francesco Brenti, Combinatorics of Coxeter Groups, Graduate Texts in Mathematics, vol.
It also indicates a connection between the combinatorics of J-holomorphic curves in the blow up of the projective plane and the numbers that appear as indices in embedded contact homology.
Eurocomb, the European Conference on Combinatorics, Graph Theory and Applications, is a highly reputable academic conference in the mathematical field of combinatorics.
Hall's marriage theorem, due to Philip Hall gives necessary and sufficient conditions for a finite family of non-empty sets (repetitions allowed) to have a system of distinct representatives.
In combinatorial mathematics, LCF notation or LCF code is a notation devised by Joshua Lederberg, and extended by Coxeter and Frucht, for the representation of cubic graphs that are Hamiltonian.
At MathPath he has taught such courses as problem solving, combinatorics, and solving the Rubik's Cube.
Larsen is known for his research in arithmetic algebraic geometry, combinatorial group theory, combinatorics, and number theory.
W. D. Wallis, Anne Penfold Street, and Jennifer Seberry Wallis, Combinatorics: Room Squares, Sum-Free Sets, Hadamard Matrices, Springer-Verlag, Berlin 1972.
In ring theory, combinatorics, functional analysis, and theoretical computer science, a semifield is a semiring (MSC 16Y60) (S,+,·) in which all elements have a multiplicative inverse.
1260 — Al-Farisi gave a new proof of Thabit ibn Qurra's theorem, introducing important new ideas concerning factorization and combinatorial methods.
He spends his summers as a visitor at institutions around the globe, for example, at the Center for Combinatorics at Nankai University (China), where he was a faculty member from 2004 to 2007, and at The John Knopfmacher Center for Applicable Analysis and Number Theory at the University of the Witwatersrand (South Africa).
While the trace monoid had been studied by Pierre Cartier and Dominique Foata for its combinatorics in the 1960s, trace theory was first formulated by Antoni Mazurkiewicz in the 1970s, in an attempt to evade some of the problems in the theory of concurrent computation, including the problems of interleaving and non-deterministic choice with regards to refinement in process calculi.
Vojtěch Rödl is a Czech mathematician, currently the Samuel Candler Dobbs Professor at Emory University, Atlanta, known for his work in combinatorics.