arXiv (All)
open access
Latin Eulerian Numbers
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 th
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Latin Squares with Few Transversals#985959
- Arithmetic exceptionality of Lattès maps#1048609
- Exceptional sets for compositions involving Euler's function,the divisor-sum function and Dedekind's function#973322
- Generalized Zeckendorf expansions of the 2nd order#974883
- Vô Conjecture 12 series 2 (VC12S2)#693426
Record · ID 1051593
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive