COMPLEXITY PROBLEMS IN ENUMERATIVE COMBINATORICS

DOI10.1142/9789813272880_0176zbMATH Open1448.05006arXiv1803.06636OpenAlexW2972455518MaRDI QIDQ5122151FDOQ5122151

Authors: Igor Pak 

Publication date: 22 September 2020

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

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

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

zbMATH Keywords

D-algebraic generating functionsWilfian formula

Mathematics Subject Classification ID

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

Cited In (10)

• Tiling with Monotone Polyominos
• Asymptotics for the number of standard tableaux of skew shape and for weighted lozenge tilings
• The complexity of combinatorial problems with succinct input representation
• On the intricacy of combinatorial construction problems
• Stieltjes moment sequences for pattern-avoiding permutations
• Combinatorial Problems for Horn Clauses
• Title not available (Why is that?)
• Differential transcendence of Bell numbers and relatives: a Galois theoretic approach
• NP-completeness of a combinator optimization problem
• On the exponential generating function of labelled trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5122151)