Searcharxiv⌕ Search

arXiv · 2610.29808

Topological degree of fewnomial maps

Abstract

We study the topological degree on the positive orthant of a map $F:\mathbb{R}^n_{>0}\to\mathbb{R}^n$ whose components are real polynomials, possibly with real exponents, with the same support $\mathcal{A}$ of $N=n+k+1$ monomials. This degree is well defined under a half-space condition on the columns of the coefficient matrix indexed by the faces of the Newton polytope, which holds for generic exponents and coefficients. We give three formulas for it, all in terms of signs of maximal minors. The first one is a Viro formula: the degree is a signed count of the simplices of a regular triangulation of $\mathcal{A}$ which are positively decorated in the sense of Bihan, Santos and Spaenlehauer. The second one is a sum over the facets of the Newton polytope, and the third one a sum over the vertices of the polyhedron of the Gale dual system. As a consequence, the degree only depends on the oriented matroids of the exponent and coefficient matrices restricted to the vertices of the Newton polytope. We also obtain a Descartes rule of signs for the degree and, in the generic case, the upper bound $|°F|<\frac12\min(M(n,N),M(k,N))$, where $M(d,N)$ is the largest number of facets of a $d$-polytope with $N$ vertices. This bound is sharp when $n=2$ or $k=2$. Using the H-duality of Bihan, Dickenstein and Forsgård, we show that the set of possible degrees is symmetric in $n$ and $k$. Since a nonzero degree forces a positive zero, our formulas give sign conditions for the existence of positive solutions, as well as parity statements for their number.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Frédéric Bihan. 2026-10-21. Topological degree of fewnomial maps. https://arxiv.org/abs/2610.29808

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

KEEP EXPLORING

Related papers

Domination polynomial of co-maximal graphs of integer modulo ring

We investigate the domination polynomial of the co-maximal graph $Γ(\mathbb{Z}_n)$ related to the ring of integers modulo $n$. Such a polynomial encodes domination sets of all possible sizes, a NP-hard problem for general graph. We give exact formulas for prime powers, integers with two distinct prime divisors, and products of three distinct primes. A prime-support decomposition gives a finite explicit formula for arbitrary $n$, including repeated prime factors. Further results determine the highest coefficients, the precise threshold beyond which every vertex subset dominates, and the number of non-dominating subsets. We discuss unimodality and log-concavity, and derive justified bounds for nonzero domination roots using the Eneström--Kakeya theorem.

math.CO↗

On gcd-graphs over matrix rings

Graphs defined over finite rings are well studied in the literature. The study of these graphs benefits from rich connections between several areas of mathematics, including number theory, algebra, combinatorics, and graph theory, and these connections often lead to interesting interactions between algebraic and combinatorial structures. In this article, we investigate gcd-graphs defined over matrix rings with coefficients in finite fields. We show that these graphs exhibit several interesting graph-theoretic properties. Along the way, we also prove some results on the structure of matrix rings, which may be of independent interest.

math.CO↗

A solution to a conjecture on the signless Laplacian spectral radius for $t$-color-critical graphs

An induced matching is a matching that forms an induced subgraph. A graph is $t$-color-critical if removing some induced matching of size $t$ lowers its chromatic number, but removing any $t-1$ vertices does not. Let $F$ be a $t$-color-critical graph with $χ(F)=r+1$. For sufficiently large $n$, Simonovits determined the unique edge-extremal $F$-free graph on $n$ vertices. Recently, Zheng, Li and Li [Linear Algebra Appl.\ 730 (2026) 546--565] conjectured that, for $t\ge 2$ and $r\ge 3$, the join $K_{t-1}\vee T_{n-t+1,r}$ uniquely maximizes the signless Laplacian spectral radius among all $n$-vertex $F$-free graphs when $n$ is sufficiently large. In this paper, we prove this conjecture. In contrast to the usual spectral arguments, our proof of this conjecture relies on two techniques of a rather different flavour. Our first technique is an analogue of Zykov symmetrization for the signless Laplacian matrix. Our second technique is an induction on $n$, from which we obtain the lower bound on the smallest entry of the Perron vector of a signless Laplacian spectral extremal graph rather than a structural statement.

math.CO↗