Metraipolis › archive › dc_c2e46cca7bce

Circular Rearrangement Inequality and Optimal Cyclic Birth and Death Chains — arXiv:2609.11774

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.11774
License (as archived)
CC0-1.0
Archived
2026-10-16T06:09:53.556Z
SHA-256 of the archived text
5bfd136c854a2a089a48f7b5246004243e35a24ef9580082f15ec6b0546d8d39
Stable URL of this page
https://metraipolis.com/documento/dc_c2e46cca7bce

How to cite

Circular Rearrangement Inequality and Optimal Cyclic Birth and Death Chains — arXiv:2609.11774 — arXiv (en), https://arxiv.org/abs/2609.11774 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c2e46cca7bce (Metraipolis archive dc_c2e46cca7bce, sha256 5bfd136c854a2a089a48f7b5246004243e35a24ef9580082f15ec6b0546d8d39)
BibTeX
@misc{dcc2e46cca7bce,
  title = {Circular Rearrangement Inequality and Optimal Cyclic Birth and Death Chains — arXiv:2609.11774},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.11774},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c2e46cca7bce; sha256 5bfd136c854a2a089a48f7b5246004243e35a24ef9580082f15ec6b0546d8d39},
  year = {2026}
}

Archived text

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

We prove a generalized circular rearrangement inequality: among all circular arrangements of a finite collection of positive numbers, the greedy arrangement simultaneously maximizes the sums of products of $k$ consecutive entries for every $k$. This resolves a 2023 conjecture of Holmes-Holroyd-Ramírez and extends the classical circular rearrangement inequality for products of adjacent entries. As an application, we show that the greedy ordering minimizes the speed of a cyclic birth-and-death chain, resolving another conjecture of the same authors.

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