Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0509219

Polynomial systems supported on circuits and dessins d'enfants

F. Bihan
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study polynomial systems whose equations have as common support a set C of n+2 points in Z^n called a circuit. We find a bound on the number of real solutions to such systems which depends on n, the dimension of the affine span of the minimal affinely dependent subset of C, and the "rank modulo 2" of C. We prove that this bound is sharp by drawing so-called dessins d'enfant on the Riemann sphere. We also obtain that the maximal number of solutions with positive coordinates to systems supported on circuits in Z^n is n+1, which is very small comparatively to the bound given by the Khovanskii fewnomial theorem.

Explore related subjects

math.AG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

F. Bihan. 2005-09-21. Polynomial systems supported on circuits and dessins d'enfants. https://arxiv.org/abs/math/0509219

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

KEEP EXPLORING

Related papers

arXiv2026

G3-Criteria and Applications

The G3-property of a subvariety was introduced by Hironaka-Matsumura, and plays an important role for deducing connectedness and extension results. Unfortunately, it's a rather elusive notion, which is not always easy to establish. Most of the existing work is concentrated on subvarieties of homogeneous varieties. The first goal of this article is to show that mobility assumptions on the subvariety, considered in works of Badescu, Chow, Debarre, Voisin, yield a certain partial positivity property, slightly stronger than G3, previously introduced by the author. Second, we apply the result to prove that, in numerous situations, the splitting of the normal bundle of a smooth two-codimensional subvariety implies that it is a complete intersection.

math.AG↗
arXiv2026

Nodal degeneration of chiral algebras I: Global structure and gluing formula

We define a natural extension of a universal factorization algebra $\mathcal{A}$ to families of stable punctured curves, by integrating over all semistable modifications. We prove that the resulting sheaf of factorization homology satisfies a natural gluing formula, by tensoring over a certain derived associative algebra $\mathfrak{Z}_{\mathcal{A}}^0$, generalizing the Verlinde formula for gluing of conformal blocks.

math.AG↗