A conjecture of Herzog and Conca on counting of paths

2002/09/29 by Hsin-Ju Wang, Wang, Hsin-Ju
Mathematics · #Advanced Combinatorial Mathematics #Commutative Algebra (math.AC) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory #math.AC

paper · pdf · doi:10.48550/arxiv.math/0209398

20 pages

arxiv created 2002/09/29 · openalex publication_date 2002/09/29 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A formula concerning counting of paths was conjectured by Herzog and Conca few years ago. Recently, Krattenthaler and Prohaska gave an affirmative answer to this conjecture. In this paper we generalize this formula.

Related

• Counting of paths and the multiplicity of determinantal rings
• Bijective counting of humps and peaks in (k,a)-paths
• Counting Humps in Motzkin paths
• A short conceptual proof of Narayana's path-counting formula
• Koroljuk's formula for counting lattice paths revisited