Combinatorics is the art of counting. Its main goal is to, given a set, determine how many elements it contains. Relevant areas of research at Michigan Tech are enumerative and algebraic combinatorics ...

Given a group and a normal subgroup, we study the problem of choosing coset representatives with few “carries.” The problem is closely linked to the emerging field of additive combinatorics. We ...

A team of four prominent mathematicians, including two Fields medalists, proved a conjecture described as a “holy grail of additive combinatorics.” Within a month, a loose collaboration verified it ...

The mathematician Ben Green of the University of Oxford has made a major stride toward understanding a nearly 100-year-old combinatorics problem, showing that a well-known recent conjecture is “not ...

How can the behavior of elementary particles and the structure of the entire universe be described using the same mathematical concepts? This question ...

The study of alternating sign matrices (ASMs) occupies a central position in enumerative combinatorics, linking intricate algebraic methods with models from statistical physics. ASMs are square ...

Peter Cameron, Wilfrid Hodges, Some Combinatorics of Imperfect Information, The Journal of Symbolic Logic, Vol. 66, No. 2 (Jun., 2001), pp. 673-684 ...

2019 Colloquia in Combinatorics Two consecutive one-day events hosted by QMUL and LSE 2019 sees the thirteenth year of the Colloquia in Combinatorics: each year, we present a dozen talks covering a ...

The beginnings of combinatorics in India date back to Bharata's Natyasastra and the last chapter of the work Chandahsastra (Sanskrit Prosody) by Pingala (c. 300 BCE).

2018 Colloquia in Combinatorics Two consecutive one-day events hosted by QMUL and LSE 2018 sees the twelfth year of the Colloquia in Combinatorics: each year, we present a dozen talks covering a wide ...