Metraipolis › archive › dc_dace7658e4ba

A negative Schur coefficient for products of two chains — arXiv:2610.01617

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.01617
License (as archived)
CC0-1.0
Archived
2026-10-06T17:41:16.297Z
SHA-256 of the archived text
894a304397ed90cc1841f3e8c598036bba9336c35bddd88bf1e0410f62ec0b9e
Stable URL of this page
https://metraipolis.com/documento/dc_dace7658e4ba

How to cite

A negative Schur coefficient for products of two chains — arXiv:2610.01617 — arXiv (en), https://arxiv.org/abs/2610.01617 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dace7658e4ba (Metraipolis archive dc_dace7658e4ba, sha256 894a304397ed90cc1841f3e8c598036bba9336c35bddd88bf1e0410f62ec0b9e)
BibTeX
@misc{dcdace7658e4ba,
  title = {A negative Schur coefficient for products of two chains — arXiv:2610.01617},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.01617},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dace7658e4ba; sha256 894a304397ed90cc1841f3e8c598036bba9336c35bddd88bf1e0410f62ec0b9e},
  year = {2026}
}

Archived text

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

We prove that the product of chains $\mathbf{m}\times\mathbf{n}$ is not Schur positive whenever $n\ge4$ and $m\ge3n-1$. Writing $m=n+k$, we exhibit a negative coefficient indexed by $(2n+k-1,2n+k-3,\ldots,k+5,k,k,4)$ and evaluate it explicitly as $(n-2)!$ times a polynomial of degree three in $k$. Our argument refines the chain-partition method of Li, Qiu, Yang, and Zhang: rank capacity forces $n-2$ long chains, and the remaining three chains are counted by separating a middle interval with fixed row coordinates from two bounded boundary regions. Together with their theorem and the known cases of widths two and three, this shows that these products are not Schur positive for $n\ge3$, $m\ge n+5$, and for $n=2$, $m\ge8$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-02 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.01617 — 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-06T16:06:55.854Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).