Metraipolis › archive › dc_8913f2ba3d30

Latin Eulerian Numbers — arXiv:2609.25100

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.25100
License (as archived)
CC0-1.0
Archived
2026-10-08T15:55:44.192Z
SHA-256 of the archived text
5bc65ab675e61f6dbca89556dd9526313289c16e14dbe75906d816d812caffc2
Stable URL of this page
https://metraipolis.com/documento/dc_8913f2ba3d30

How to cite

Latin Eulerian Numbers — arXiv:2609.25100 — arXiv (en), https://arxiv.org/abs/2609.25100 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8913f2ba3d30 (Metraipolis archive dc_8913f2ba3d30, sha256 5bc65ab675e61f6dbca89556dd9526313289c16e14dbe75906d816d812caffc2)
BibTeX
@misc{dc8913f2ba3d30,
  title = {Latin Eulerian Numbers — arXiv:2609.25100},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.25100},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8913f2ba3d30; sha256 5bc65ab675e61f6dbca89556dd9526313289c16e14dbe75906d816d812caffc2},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.25100. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We introduce \emph{Latin Eulerian numbers} $\LE{n\atop k_1,\dots,k_n}$, a multivariate refinement of classical Eulerian numbers counting order-$n$ Latin squares by column ascents. We establish their fundamental symmetries, univariate marginals, and an exact multiplicity divisibility property. For the total ascent statistic $\Sigma(L)=\sum_i k_i(L)$, we prove the sharp, isolated bounds $n-1 \le \Sigma(L) \le (n-1)^2$, demonstrating that the adjacent values $n$ and $(n-1)^2-1$ are strictly unattainable. To analyze intermediate values, we show that symbol permutations typically ignored in classical enumeration directly govern $\Sigma$ via an exact formula. This insight yields explicit constructions for the interior range, motivates a unimodality conjecture for the total ascent distribution.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.25100 — 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-08T15:16:21.656Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).