arXiv (All)
open access
Counterexamples to the Mu--Welker recursive decomposition in every degree
The well-known open problem of Bell and Skandera asks whether a monic real-rooted polynomial $f(t)$ with positive integer coefficients 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 ine
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Breaking the Exponential Barrier: The First Polynomial-Time Algorithm for the Győri-Lovász Theorem#818987
- Breaking the Exponential Barrier: The First Polynomial-Time Algorithm for the Győri-Lovász Theorem#808995
- Boxicity and Cubicity of Divisor Graphs and Power Graphs#635564
- Boxicity and Cubicity of Divisor Graphs and Power Graphs#633215
- Coleman Isomorphisms in Syntomic Cohomology and $\mathrm{THH}$#972190
Record · ID 1049430
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive