SearcharxivSearch

arXiv · 2609.23694

Counterexamples to the Mu--Welker recursive decomposition in every degree

Abstract

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 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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Feihu Liu, Ying Wang, Zihao Zhang. 2026-09-20. Counterexamples to the Mu--Welker recursive decomposition in every degree. https://arxiv.org/abs/2609.23694

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO