arXiv (All)
open access
Cyclic Latin Eulerian Numbers
We introduce the directed cyclic difference inventory $D_n(\mathbf{m})$ to study Latin Eulerian numbers restricted to row-reorderings of the cyclic Latin square, offering an orientation-sensitive refinement of the prescribed-edge-length Hamiltonian path problem. We establish exact enumeration formul
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
- Iterating the Lehmer code on inversion sequences: Catalan fixed points and finite stabilization#998351
- De Bruijn Polyominoes#793385
- De Bruijn Polyominoes#789381
- Distinguishing Power of 4-Legendrian Permutation Racks#1052039
- Involutions avoiding 4321 and another pattern of length four#1145119
Record · ID 1076464
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