Search arXiv⌕ Search

arXiv · 2503.14285

The $α$-representation for the Tait coloring and for the characteristic polynomial of matroid

Abstract

Consider a finite field $\mathbb F_q$, $q=p^d$, where $p$ is an odd number. Let $M=(E,r)$ be a regular matroid; denote by ${\mathcal B}$ the family of its bases, $\bar s(M;α)=\sum_{B\in {\mathcal B}}\prod_{e\not\in B} α_e$, where ${α_e\in \mathbb F_q}$, $α_e\neq 0$. Let a subset $A\equiv A(α)$ in $E$ have the maximal cardinality and satisfy the condition $\bar s(M|A;α)\neq 0$, while ${r^*}(α)=|A|-r(E)$. Let us represent the value of the characteristic polynomial of the matroid $M$ at the point $q$ as the linear combination of Legendre symbols with respect to $\bar s(M|A;α)$, whose coefficients are modulo equal to $1/q^{r^*(α)/2}$. This representation generalizes the formula for a flow polynomial of a graph which was obtained by us earlier. The latter formula is an analog of the so-called $α$-representation of vacuum Feynman amplitudes in the case of a finite field, which has inspired the Kontsevich conjecture (1997). The $α$-representation technique is also applicable for expressing the number of Tait colorings for a cubic biconnected planar graph in terms of principal minors of the matrix of faces of this graph.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eduard Lerner. 2025-03-24. The $α$-representation for the Tait coloring and for the characteristic polynomial of matroid. https://arxiv.org/abs/2503.14285

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

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗