Metraipolis › archive › dc_482d9a5efccd

Counterexamples to the Mu--Welker recursive decomposition in every degree — arXiv:2609.23694

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.23694
License (as archived)
CC0-1.0
Archived
2026-10-09T21:44:54.228Z
SHA-256 of the archived text
3e7843abbe83a5c0c46ae29b2c19cdf14ecb9d593c11b64fe728b27e516d5188
Stable URL of this page
https://metraipolis.com/documento/dc_482d9a5efccd

How to cite

Counterexamples to the Mu--Welker recursive decomposition in every degree — arXiv:2609.23694 — arXiv (en), https://arxiv.org/abs/2609.23694 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_482d9a5efccd (Metraipolis archive dc_482d9a5efccd, sha256 3e7843abbe83a5c0c46ae29b2c19cdf14ecb9d593c11b64fe728b27e516d5188)
BibTeX
@misc{dc482d9a5efccd,
  title = {Counterexamples to the Mu--Welker recursive decomposition in every degree — arXiv:2609.23694},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.23694},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_482d9a5efccd; sha256 3e7843abbe83a5c0c46ae29b2c19cdf14ecb9d593c11b64fe728b27e516d5188},
  year = {2026}
}

Archived text

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

The well-known open problem of Bell and Skandera asks whether a real-rooted polynomial $f(t)$ with positive integer coefficients and constant term one is the $f$-polynomial of a simplicial complex. Mu and Welker proved that if the recursive decomposition $f(t)=g(t)+th(t)$ satisfies the corresponding coefficient inequality $h_i<g_i$, then this open problem has an affirmative answer. Mu and Welker also conjectured that the real-rootedness of $f(t)$ implies that of $g(t)$ and $h(t)$. We give counterexamples to the conjecture of Mu and Welker for every degree at least three, and prove that the assertion holds in degrees $1$ and $2$. Moreover, each polynomial we construct is the $f$-polynomial of a simplicial complex.

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