COMPLEXITY PROBLEMS IN ENUMERATIVE COMBINATORICS

DOI10.1142/9789813272880_0176zbMath1448.05006arXiv1803.06636OpenAlexW2972455518MaRDI QIDQ5122151

Igor Pak

Publication date: 22 September 2020

Published in: Proceedings of the International Congress of Mathematicians (ICM 2018) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.06636

zbMATH Keywords

D-algebraic generating functionsWilfian formula

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial aspects of partitions of integers (05A17) Combinatorics in computer science (68R05) Enumeration in graph theory (05C30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Asymptotics for the number of standard tableaux of skew shape and for weighted lozenge tilings ⋮ Tiling with Monotone Polyominos ⋮ Stieltjes moment sequences for pattern-avoiding permutations ⋮ On the exponential generating function of labelled trees

This page was built for publication: COMPLEXITY PROBLEMS IN ENUMERATIVE COMBINATORICS