Metraipolis › archive › dc_079339fa2782
Combinatorial aspects of the Delannoy Lattice — arXiv:2609.30350
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.30350
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T02:59:10.087Z
- SHA-256 of the archived text
fb71b15c00cb70de38679ffb7c5a6f19ca38514d0aebdc2715175e495cdf6f9b- Stable URL of this page
https://metraipolis.com/documento/dc_079339fa2782
How to cite
Combinatorial aspects of the Delannoy Lattice — arXiv:2609.30350 — arXiv (en), https://arxiv.org/abs/2609.30350 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_079339fa2782 (Metraipolis archive dc_079339fa2782, sha256 fb71b15c00cb70de38679ffb7c5a6f19ca38514d0aebdc2715175e495cdf6f9b)
BibTeX
@misc{dc079339fa2782,
title = {Combinatorial aspects of the Delannoy Lattice — arXiv:2609.30350},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.30350},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_079339fa2782; sha256 fb71b15c00cb70de38679ffb7c5a6f19ca38514d0aebdc2715175e495cdf6f9b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.30350. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The Delannoy numbers $d(n,k)$ count lattice paths from $(0,0)$ to $(n-k,k)$ using steps $(1,0),(0,1)$ and $(1,1)$. This paper introduces a graded poset $\mathcal{D}_n$ on the Delannoy paths ending on the line $x+y=n$, whose rank-generating function is the Delannoy polynomial $d_n(x)=\sum_{k=0}^n d(n,k)x^k$. We prove that $\\mathcal{D}_n$ is a self-dual lattice, which is call the Delannoy lattice. By establishing an explicit symmetric Boolean decomposition, we show that $\mathcal{D}_n$ is a symmetric Boolean order, thereby recovering the $\gamma$-positivity of $d_n(x)$. Such a decomposition is refined to a symmetric chain decomposition with the chain cover property, and is applied to determine all maximum antichains. We also investigate other combinatorial aspects of $\mathcal{D}_n$, including supersolvability, the Möbius number, characteristic polynomials, and zeta polynomials.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-28 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.30350 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T02:28:17.907Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).