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 ...

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

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 ...

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 ...

Combinatorics and discrete mathematics form a vibrant and expansive branch of modern mathematics, dedicated to the study of finite or countable structures and the methods used to count, classify ...

Several months later, the team coaxed the upper limit down a tiny bit more, getting a new bound of 1/e (log (N))^1/9. Combinatorics researchers are still trying to figure out how low they can go.

The Bristol One-Day Meeting in Combinatorics is an annual conference in Bristol with talks on a wide variety of topics within Combinatorics. Talks will cover recent developments in extremal and ...