arXiv:1803.06636 Abstract | arXiv Analytics

Published 2018-03-18Version 1

We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.

Comments: 30 pages; an expanded version of the ICM 2018 paper (Section 4 added, refs expanded)

Categories: math.CO, cs.CC, cs.DM, math.HO, math.PR

Keywords: enumerative combinatorics, complexity problems, broad survey

Related articles: Most relevant | Search more

arXiv:1409.2562 [math.CO] (Published 2014-09-09)

Algebraic and geometric methods in enumerative combinatorics

Federico Ardila

arXiv:1910.00299 [math.CO] (Published 2019-10-01)

Enumerative combinatorics of intervals in the Dyck pattern poset

arXiv:1902.06234 [math.CO] (Published 2019-02-17)

Enumerative combinatorics on determinants and signed bigrassmannian polynomials

Masato Kobayashi