Complexity problems in enumerative combinatorics
arXiv:1803.06636
Abstract
We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.
arXiv comment31 pages; an expanded version of the ICM 2018 paper (Section 4 added, refs expanded)
References in corpus (13)
- Graph Isomorphism in Quasipolynomial Time
- An introduction to the dimer model
- Arctic curves of the six-vertex model on generic domains: the Tangent Method
- Intervals in the greedy Tamari posets
- Counting quadrant walks via Tutte's invariant method
- Efficient implementation of the Hardy-Ramanujan-Rademacher formula
- A q-rious positivity
- A Combinatorial Interpretation of The Numbers
- Pattern avoidance is not P-recursive
- The Expected Shape of Random Doubly Alternating Baxter Permutations
- On the connectivity of spaces of three-dimensional tilings
- Notes on higher-dimensional partitions
- Division by three