Metraipolis › archive › dc_a8d8c246aa22
Antichains among Divisor Sums of Divisors — arXiv:2610.02264
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.02264
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T08:24:21.432Z
- SHA-256 of the archived text
e2744e1112462748d99d1d58732447d471af85cd6504f4092e71028b02ecc107- Stable URL of this page
https://metraipolis.com/documento/dc_a8d8c246aa22
How to cite
Antichains among Divisor Sums of Divisors — arXiv:2610.02264 — arXiv (en), https://arxiv.org/abs/2610.02264 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a8d8c246aa22 (Metraipolis archive dc_a8d8c246aa22, sha256 e2744e1112462748d99d1d58732447d471af85cd6504f4092e71028b02ecc107)
BibTeX
@misc{dca8d8c246aa22,
title = {Antichains among Divisor Sums of Divisors — arXiv:2610.02264},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.02264},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a8d8c246aa22; sha256 e2744e1112462748d99d1d58732447d471af85cd6504f4092e71028b02ecc107},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.02264. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For a positive integer $n$, let $S(n)=\{\sigma(d): d\mid n\}$ be ordered by divisibility, and let $a(n)$ be its width. We study how much of the divisor lattice of $n$ survives under the map $d\mapsto \sigma(d)$. For every fixed prime-exponent pattern, the largest possible value of $a(n)$ is the width of a corresponding product of divisibility posets, and this maximum is attained infinitely often. In the squarefree case with $\omega(n)=r$, every width from $1$ to $\binom{r}{\lfloor r/2\rfloor}$ occurs, again infinitely often. For repeated exponent patterns, Engel's limit theory reduces the asymptotic width problem to optimal representation variance. We show that for the divisibility poset $D_m=(\{1,\ldots,m\},\mid)$, the prime directions $2$ and $3$ already determine the exact variance. The structural reason is the critical dilation $4$, lying strictly between $3$ and the next prime $5$. This yields an exact finite formula, the limit $V(D_m)\to 1.0367934201598\ldots$, and asymptotics for repeated exponent patterns. The complementary minimum-width problem remains largely open.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-05 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.02264 — 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-06T08:18:48.269Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).