Related papers: Toric Intersection Theory for Affine Root Counting

We study the problem of counting the total number of affine solutions of a system of n binomials in n variables over an algebraically closed field of characteristic zero. We show that we may decide in polynomial time if that number is…

We study the stratification of the space of monic polynomials with real coefficients according to the number and multiplicities of real zeros. In the first part, for each of these strata we provide a purely combinatorial chain complex…

Suppose f is a real univariate polynomial of degree D with exactly 4 monomial terms. We present an algorithm, with complexity polynomial in log D on average (relative to the stable log-uniform measure), for counting the number of real roots…

Any rational map between affine spaces, projective spaces or toric varieties can be described in terms of their affine, homogeneous, or Cox coordinates. We show an analogous statement in the setting of Mori Dream Spaces. More precisely (in…

In this book we describe an approach through toric geometry to the following problem: "estimate the number (counted with appropriate multiplicity) of isolated solutions of n polynomial equations in n variables over an algebraically closed…

Let $k$ be an arbitrary field, the purpose of this work is to provide families of positive integers $\mathcal{A} = \{d_1,\ldots,d_n\}$ such that either the toric ideal $I_{\mathcal A}$ of the affine monomial curve $\mathcal C =…

We classify completely the intersections of the Hermitian curve with parabolas in the affine plane. To obtain our results we employ well-known algebraic methods for finite fields and geometric properties of the curve automorphisms. In…

In this paper we find monomial bases for the integer cohomology rings of compact wonderful models of toric arrangements. In the description of the monomials various combinatorial objects come into play: building sets, nested sets, and the…

We report an ongoing work on clustering algorithms for complex roots of a univariate polynomial $p$ of degree $d$ with real or complex coefficients. As in their previous best subdivision algorithms our root-finders are robust even for…

Root systems are sets with remarkable symmetries and therefore they appear in many situations in mathematics. Among others, denominator formulae of root systems are very beautiful and mysterious equations which have several meanings from a…

We compute the cohomology of the complement of toric arrangements associated to root systems as representations of the corresponding Weyl groups. Specifically, we develop an algorithm for computing the cohomology of the complement of toric…

This paper reexamines univariate reduction from a toric geometric point of view. We begin by constructing a binomial variant of the $u$-resultant and then retailor the generalized characteristic polynomial to fully exploit sparsity in the…

To a generic hypersurface in the affine torus $(\mathbb{C}^*)^n$ we associate a hypersurface arrangement in the projective space $\mathbb{P}^n$ consisting of the $n+1$ coordinate hyperplanes and a generic hypersurface, and compute the…

We develop an approach to study the irreducibility of generic complete intersections in the algebraic torus defined by equations with fixed monomials and fixed linear relations on coefficients. Using our approach we generalize the…

That finite-dimensional simple Lie algebras over the complex numbers can be classified by means of purely combinatorial and geometric objects such as Coxeter-Dynkin diagrams and indecomposable irreducible root systems, is arguably one of…

Intersecting codes are linear codes where every two nonzero codewords have non-trivially intersecting support. In this article we expand on the theory of this family of codes, by showing that nondegenerate intersecting codes correspond to…

We give a simplified proof and an improvement of a recent theorem by A. Grigoriev, placing an upper bound for the number of roots of linear combinations of solutions to systems of linear equations with polynomial or rational coefficients.

We present a new algorithm for isolating the real roots of a system of multivariate polynomials, given in the monomial basis. It is inspired by existing subdivision methods in the Bernstein basis; it can be seen as generalization of the…

For certain polynomials we relate the number of roots inside the unit circle with the index of a non-degenerate isolated umbilic point on a real analytic surface in Euclidean 3-space. In particular, for $N>0$ we prove that for a certain…

This paper investigates the expected number of complex roots of nonlinear equations. Those equations are assumed to be analytic, and to belong to certain inner product spaces. Those spaces are then endowed with the Gaussian probability…