相关论文: Toric Intersection Theory for Affine Root Counting

We prove that any pair of bivariate trinomials has at most 5 isolated roots in the positive quadrant. The best previous upper bounds independent of the polynomial degrees were much larger, e.g., 248832 (for just the non-degenerate roots)…

We combine recently developed intersection theory for non-reductive geometric invariant theoretic quotients with equivariant localisation to prove a formula for Thom polynomials of Morin singularities. These formulas use only toric…

We tackle several problems related to a finite irreducible crystallographic root system $\Phi$ in the real vector space $\mathbb E$. In particular, we study the combinatorial structure of the subsets of $\Phi$ cut by affine subspaces of…

We introduce a class of graphs with coloured edges to encode subsystems of the classical root systems, which in particular classify them up to equivalence. We further use the graphs to describe root-kernel intersections, as well as…

We present a new eigenvalue method for solving a system of Laurent polynomial equations defining a zero-dimensional reduced subscheme of a toric compactification $X$ of $(\mathbb{C} \setminus \{0\})^n$. We homogenize the input equations to…

Many combinatorial and topological invariants of a hyperplane arrangement can be computed in terms of its Tutte polynomial. Similarly, many invariants of a hypertoric arrangement can be computed in terms of its arithmetic Tutte polynomial.…

In a previous paper {GN2} an effective solution of the lattice point counting problem in general domains in semisimple S-algebraic groups and affine symmetric varieties was established. The method relies on the mean ergodic theorem for the…

We prove that the roots of a smooth monic polynomial with complex-valued coefficients defined on a bounded Lipschitz domain $\Omega$ in $\mathbb R^m$ admit a parameterization by functions of bounded variation uniformly with respect to the…

A fundamental problem in the theory of linearized and projective polynomials over finite fields is to characterize the number of roots in the coefficient field directly from the coefficients. We prove results of this type, of a recursive…

We study the topology of toric maps. We show that if $f\colon X\to Y$ is a proper toric morphism, with $X$ simplicial, then the cohomology of every fiber of $f$ is pure and of Hodge-Tate type. When the map is a fibration, we give an…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the…

We describe a new incomplete but terminating method for real root finding for large multivariate polynomials. We take an abstract view of the polynomial as the set of exponent vectors associated with sign information on the coefficients.…

We estimate the growth rate of the function which counts the number of torsion points of order at most $T$ on an algebraic subvariety of the algebraic torus $\mathbb G_m^n$ over some algebraically closed field. We prove a general upper…

For affine algebraic plane curves we reduce a calculation of its invariants to calculation of the intersection of kernels of some derivations.

We present a combination of two algorithms that accurately calculate multiple roots of general polynomials. Algorithm I transforms the singular root-finding into a regular nonlinear least squares problem on a pejorative manifold, and…

Global F-theory compactifications whose fibers are realized as complete intersections form a richer set of models than just hypersurfaces. The detailed study of the physics associated with such geometries depends crucially on being able to…

Alon and F\"uredi (European J. Combin. 1993) gave a tight bound for the following hyperplane covering problem: find the minimum number of hyperplanes required to cover all points of the n-dimensional hypercube {0,1}^n except the origin.…

We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…

Toric (or sparse) elimination theory is a framework developped during the last decades to exploit monomial structures in systems of Laurent polynomials. Roughly speaking, this amounts to computing in a \emph{semigroup algebra}, \emph{i.e.}…