COMPLEXITY PROBLEMS IN ENUMERATIVE COMBINATORICS

DOI10.1142/9789813272880_0176zbMath1448.05006arXiv1803.06636MaRDI 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 functions; Wilfian formula

Mathematics Subject Classification ID

05A15: Exact enumeration problems, generating functions

05A10: Factorials, binomial coefficients, combinatorial functions

05A17: Combinatorial aspects of partitions of integers

68R05: Combinatorics in computer science

05C30: Enumeration in graph theory

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)