Metraipolis › archive › dc_cd73bfab531a

A proof of the Karpelevič theorem via invariant polygons — arXiv:2609.26058

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.26058
License (as archived)
CC0-1.0
Archived
2026-10-08T15:54:36.370Z
SHA-256 of the archived text
26c31a0e8af1aa9f807e1d7158df7eb17ccd512ee1ba08738d4b4da749a57089
Stable URL of this page
https://metraipolis.com/documento/dc_cd73bfab531a

How to cite

A proof of the Karpelevič theorem via invariant polygons — arXiv:2609.26058 — arXiv (en), https://arxiv.org/abs/2609.26058 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cd73bfab531a (Metraipolis archive dc_cd73bfab531a, sha256 26c31a0e8af1aa9f807e1d7158df7eb17ccd512ee1ba08738d4b4da749a57089)
BibTeX
@misc{dccd73bfab531a,
  title = {A proof of the Karpelevič theorem via invariant polygons — arXiv:2609.26058},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.26058},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cd73bfab531a; sha256 26c31a0e8af1aa9f807e1d7158df7eb17ccd512ee1ba08738d4b4da749a57089},
  year = {2026}
}

Archived text

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

The Karpelevič theorem describes the complex numbers that occur as eigenvalues of stochastic matrices of a fixed order. We give a self-contained proof based on invariant polygons. Their geometry yields a product equation for an eigenvalue of maximal modulus at a fixed argument. Convexity determines this modulus, explicit stochastic matrices attain it, and a comparison between Farey intervals completes the boundary description. As the matrix order increases, the resulting equation gives a uniform relative asymptotic for the gap $1-|z|$ between a boundary point $z$ and the unit circle, even arbitrarily close to arc endpoints. We also determine the optimal contraction factor for a planar rotation and dilation when vector size is measured by scaling a polygon with at most $N$ vertices.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.PR).
Categorie arXiv: Rings and Algebras (math.RA) ; Probability (math.PR); Spectral Theory (math.SP).
Pagina del lavoro: https://arxiv.org/abs/2609.26058 — 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:13:13.553Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).