Search arXivSearch

arXiv · 1611.09525

On the real roots of $σ$-Polynomials

Abstract

The $σ$-polynomial is given by $σ(G,x) = \sum_{i=χ(G)}^{n} a_{i}(G)\, x^{i}$, where $a_{i}(G)$ is the number of partitions of the vertices of $G$ into $i$ nonempty independent sets. These polynomials are closely related to chromatic polynomials, as the chromatic polynomial of $G$ is given by $\sum_{i=χ(G)}^{n} a_{i}(G)\, x(x-1) \cdots (x-(i-1))$. It is known that the closure of the real roots of chromatic polynomials is precisely $\{0,~1\} \bigcup [32/27,\infty)$, with $(-\infty,0)$, $(0,1)$ and $(1,32/27)$ being maximal zero-free intervals for roots of chromatic polynomials. We ask here whether such maximal zero-free intervals exist for $σ$-polynomials, and show that the only such interval is $[0,\infty)$ -- that is, the closure of the real roots of $σ$-polynomials is $(-\infty,0]$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jason Brown, Aysel Erey. 2016-11-29. On the real roots of $σ$-Polynomials. https://arxiv.org/abs/1611.09525

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO