Searcharxiv⌕ Search

arXiv · 2610.23989

Planar Disk Filters and Real Chromatic Roots at Beraha Numbers

Abstract

We construct simple plane triangulations whose chromatic polynomials have real roots accumulating at every noninteger Beraha number $B_\ell=4\cos^2(π/\ell)$; the integer values $0,1,2,3$ are roots of $K_4$. The construction rests on the observation that a triangulated disk with four boundary vertices acts, inside a larger triangulation, as a transfer operator lying in a commutative three-parameter algebra. Rotating such disks by a quarter turn and composing them in series moves their eigenvalue triples around this algebra in a controllable way, and for every fixed $q\in(B_{10},4)$ one can manufacture a finite disk whose two competing local eigenvalues are strictly dominated by the third -- a physical filter. Closing a grid of such disks between two poles produces a sphere triangulation, and a fused Temperley-Lieb trace identity accounts for its chromatic polynomial completely, sector by sector, with no appeal to semisimplicity at the root of unity itself -- generic semisimplicity enters only through polynomial identities continued from $δ>2$ -- and no singular higher Jones-Wenzl projectors. In the one-cap sector a Krein-type argument shows that every sweep word has exactly one expanding eigenvalue; Gram-form inertia controls every other sector uniformly in the width. At odd Beraha indices the trace coefficient of the expanding eigenvalue vanishes; at even indices two copies of that eigenvalue cancel between adjacent sectors, and a short real-variable lemma converts either situation into genuine real roots converging to the target. Indices below eleven are treated by elementary families, exact outward-rounded integer certificates, and one explicit disk at $B_{10}$ combined with Tutte's golden identity. All graphs are ordinary, simple, unweighted plane triangulations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Reza Mactabi. 2026-10-14. Planar Disk Filters and Real Chromatic Roots at Beraha Numbers. https://arxiv.org/abs/2610.23989

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

KEEP EXPLORING

Related papers

Two Erdos-Hajnal-type theorems for forbidden order-size pairs

The celebrated Erdős-Hajnal conjecture says that any graph without a fixed induced subgraph $H$ contains a very large homogeneous set. A direct analog of this conjecture is not true for hypergraphs. In this paper we present two natural variants of this problem which do hold for hypergraphs. We show that for every $r \geq 3$, $m \geq m_0(r)$ and $0 \leq f \leq \binom{m}{r}$, if an $r$-graph $G$ does not contain $m$ vertices spanning exactly $f$ edges, then $G$ contains much larger homogeneous sets than what is guaranteed to exist in general $r$-graphs. We also prove that if a $3$-graph $G$ does not contain homogeneous sets of polynomial size, then for every $m \geq 3$ there are $Ω(m^3)$ values of $f$ such that $G$ contains $m$ vertices spanning exactly $f$ edges. This makes progress on a problem of Axenovich, Bradač, Gishboliner, Mubayi and Weber.

math.CO↗

Unexpectedly, a symmetry on unlabeled graphs

We exhibit the joint symmetric distribution of the following two parameters on the set of unlabeled, simple, connected graphs with $n$ vertices. The first parameter is the maximal number of leaves attached to a vertex. The second parameter is the size of the largest set of vertices sharing the same closed neighborhood minus $1$. Apparently, this is the first example of a natural, non-trivial equidistribution of graph parameters on unlabeled connected graphs on a fixed set of vertices. Our proof is enumerative, using the theory of species. Exhibiting an explicit bijection interchanging the two parameters remains an open problem.

math.CO↗

Cycle lengths in the percolated hypercube

Let $Q^d_p$ be the random subgraph of the $d$-dimensional binary hypercube obtained after edge-percolation with probability $p$. It was shown recently by the authors that, for every $\varepsilon > 0$, there is some $c = c(\varepsilon)>0$ such that, if $pd\ge c$, then typically $Q^d_p$ contains a cycle of length at least $(1-\varepsilon)2^d$. We strengthen this result to show that, under the same assumptions, typically $Q^d_p$ contains cycles of all even lengths between $4$ and $(1-\varepsilon)2^d$.

math.CO↗