Metraipolis › archive › dc_e5729dfb8efb

On Packed Passenger Permutations — arXiv:2611.07204

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.07204
License (as archived)
CC0-1.0
Archived
2026-11-06T14:52:40.100Z
SHA-256 of the archived text
e95a7e4498d5c4c680faa04969263eff9b62604e4fdb82d388f6021d5185fd95
Stable URL of this page
https://metraipolis.com/documento/dc_e5729dfb8efb

How to cite

On Packed Passenger Permutations — arXiv:2611.07204 — arXiv (en), https://arxiv.org/abs/2611.07204 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e5729dfb8efb (Metraipolis archive dc_e5729dfb8efb, sha256 e95a7e4498d5c4c680faa04969263eff9b62604e4fdb82d388f6021d5185fd95)
BibTeX
@misc{dce5729dfb8efb,
  title = {On Packed Passenger Permutations — arXiv:2611.07204},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.07204},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e5729dfb8efb; sha256 e95a7e4498d5c4c680faa04969263eff9b62604e4fdb82d388f6021d5185fd95},
  year = {2026}
}

Archived text

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

An occupied seat in a binary row is called packed if both of its immediate neighbors are occupied. We give a self-contained combinatorial account of this statistic, equivalently the number of overlapping occurrences of 111. An occupied-block decomposition yields a coefficient formula at fixed occupancy and a direct proof of the sharp minimum max{0,3m-2n-2} for m passengers in n seats, including arrangements attaining the bound. The same decomposition gives a rational generating function, recurrences, expectations, and avoidance asymptotics. Full rows, in which every empty seat would become packed upon being filled, are related to independent sets of a path. A neighborhood-union expansion also gives exact counts on rectangular grids. The emphasis is a unified elementary presentation and explicit extremal constructions, rather than a new general enumeration method.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.07204 — 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-11-06T14:24:27.838Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).