Refined lattice path enumeration and combinatorial reciprocity

DOI10.54550/ECA2023V3S1R8MaRDI QIDQ6097076zbMATH OpenOpenAlexFDO

Authors Henri Mühle, Eleni Tzanaki

Publication date 12 June 2023

Published in Enumerative Combinatorics and Applications (Search for Journal in Brave)

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

zbMATH Keywords

Catalan arrangementEhrhart reciprocityLagrange inversionlattice pathsNarayana numbers

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Abstract: It is well known that the set of $m$-Dyck paths with a fixed height and a fixed amount of valleys is counted by the Fu{ss}-Narayana numbers. In this article, we consider the set of $m$-Dyck paths that start with at least $t$ north steps. We give exact formulas for the number of such paths with fixed height, fixed number of returns and (i) fixed number of valleys, (ii) fixed number of valleys with $x$-coordinate divisible by $m$ and (iii) fixed number of valleys with $x$-coordinate not divisible by $m$. The enumeration (ii) combinatorially realizes the $H$-triangle appearing in a recent article of Krattenthaler and the first author (Algebr. Comb. 5, 2022) in the context of certain parabolic noncrossing partitions. Through a transformation formula due to Chapoton, we give an explicit formula for the associated $F$-triangle. We realize this polynomial combinatorially by means of generalized Schr"oder paths as well as flats in certain hyperplane arrangements. Along the way we exhibit two new combinatorial reciprocity results.

Recommendations

• Refinements of (\(n,m\))-Dyck paths
• Refinements of two identities on \((n,m)\)-Dyck paths
• Enumeration of generalized Dyck paths based on the height of down-steps modulo \(k\)
• Counting Dyck paths with strictly increasing peak sequences
• Enumerations of rational non-decreasing Dyck paths with integer slope

Cites work

• \(Y\)-systems and generalized associahedra
• A consecutive Lehmer code for parabolic quotients of the symmetric group
• Ballot-noncrossing partitions
• Chain enumeration and non-crossing partitions
• Combinatorial Reciprocity Theorems
• Combinatorial reciprocity theorems
• Decomposition numbers for finite Coxeter groups and generalised non-crossing partitions
• Enumerative combinatorics. Volume 2.
• Enumerative properties of generalized associahedra
• Faces of Generalized Cluster Complexes and Noncrossing Partitions
• Generalized noncrossing partitions and combinatorics of Coxeter groups
• scientific article; zbMATH DE number 3163858 (Why is no real title available?)
• scientific article; zbMATH DE number 3489473 (Why is no real title available?)
• scientific article; zbMATH DE number 1182849 (Why is no real title available?)
• scientific article; zbMATH DE number 2246193 (Why is no real title available?)
• scientific article; zbMATH DE number 4189736 (Why is no real title available?)
• Lattice path enumeration
• Noncrossing arc diagrams, Tamari lattices, and parabolic quotients of the symmetric group
• On a refinement of the generalized Catalan numbers for Weyl groups
• On some enumerative aspects of generalized associahedra
• On the \(H\)-triangle of generalised nonnesting partitions
• On the enumeration and generation of generalized Dyck words
• On the enumeration of positive cells in generalized cluster complexes and Catalan hyperplane arrangements.
• On the number of full reflections in finite Coxeter groups.
• Polygon dissections and some generalizations of cluster complexes
• Schröder combinatorics and \(\nu\)-associahedra
• Some remarks on Catalan families
• Tamari lattices for parabolic quotients of the symmetric group
• The \(\nu \)-Tamari lattice via \(\nu \)-trees, \( \nu \)-bracket vectors, and subword complexes
• The \(F\)-triangle of the generalised cluster complex
• The \(M\)-triangle of generalised non-crossing partitions for the types \(E_7\) and \(E_8\).
• The rank enumeration of certain parabolic non-crossing partitions
• The steep-bounce zeta map in parabolic Cataland

Cited in

(7)

• Lattice path enumeration by formal schema
• Enumeration of lattice paths with infinite types of steps and the Chung-Feller property
• Refined Chung-Feller theorems for lattice paths
• A combinatorial proof of the recurrence for rook paths
• Riordan Matrices and Lattice Path Enumeration
• Refinements of (\(n,m\))-Dyck paths
• Bounded Dyck paths, bounded alternating sequences, orthogonal polynomials, and reciprocity

This page was built for publication: Refined lattice path enumeration and combinatorial reciprocity

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