Complexity problems in enumerative combinatorics

2018/03/18 by Igor Pak, Pak, Igor · 10 citations
Computer Science · Mathematics · #05A #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Algebraic combinatorics #Benford’s Law and Fraud Detection #Combinatorics #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Computer science #Discrete Mathematics (cs.DM) #Enumerative combinatorics #Extremal combinatorics #FOS: Computer and information sciences #FOS: Mathematics #History and Overview (math.HO) #Mathematics #Probability (math.PR) #cs.CC #cs.DM #math.CO #math.HO #math.PR #msc:05A

paper · pdf · doi:10.48550/arxiv.1803.06636

published in ArXiv.org · 31 pages; an expanded version of the ICM 2018 paper (Section 4 added, refs expanded)

openalex publication_date 2018/03/18 · arxiv created 2018/03/31 · arxiv updated 2018/04/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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

Cited by

• Singular walks in the quarter plane and Bernoulli numbers

Related

• Algebraic and geometric methods in enumerative combinatorics
• A Complexity Theory for Hard Enumeration Problems
• Enumerative Combinatorics
• Enumeration of Enumeration Algorithms
• Enumeration Complexity: Incremental Time, Delay and Space