English
Related papers

Related papers: Toric Intersection Theory for Affine Root Counting

200 papers

Using the discriminant modular form and the Noether formula it is possible to write the admissible self-intersection of the relative dualising sheaf of a semistable hyperelliptic curve over a number field or function field as a sum, over…

Algebraic Geometry · Mathematics 2012-03-29 Robin de Jong

We use techniques from Gromov-Witten theory to construct new invariants of matroids taking value in the Chow groups of spaces of rational curves in the permutohedral toric variety. When the matroid is realizable by a complex hyperplane…

Algebraic Geometry · Mathematics 2022-05-03 Dhruv Ranganathan , Jeremy Usatine

We prove complex contraction for zero-free regions of counting weighted set cover problem in which an element can appear in an unbounded number of sets, thus obtaining fully polynomial-time approximation schemes(FPTAS) via Barvinok's…

Data Structures and Algorithms · Computer Science 2022-01-03 Liang Li , Guangzeng Xie

A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phylogenetics is to combine such trees into larger trees, called…

Artificial Intelligence · Computer Science 2014-01-16 Neil C. A. Moore , Patrick Prosser

The classical Bertini theorem on generic intersection of an algebraic set with hyperplanes states the following: \emph{Let X be a nonsingular closed subvariety of $\mathbb{P}^n_k$, where $k$ is an algebraically closed field. Then there…

Algebraic Geometry · Mathematics 2021-06-22 Tomasz Rodak , Adam Różycki , Stanisław Spodzieja

Toric codes are obtained by evaluating rational functions of a nonsingular toric variety at the algebraic torus. One can extend toric codes to the so called generalized toric codes. This extension consists on evaluating elements of an…

Information Theory · Computer Science 2010-02-25 Diego Ruano

We present a class of linear programming approximations for constrained optimization problems. In the case of mixed-integer polynomial optimization problems, if the intersection graph of the constraints has bounded tree-width our…

Optimization and Control · Mathematics 2016-10-20 Daniel Bienstock , Gonzalo Munoz

The main result of this paper is that every (separated) toric variety which has a semigroup structure compatible with multiplication on the underlying torus is necessarily affine. In the course of proving this statement, we also give a…

Algebraic Geometry · Mathematics 2007-05-23 Dmitriy Boyarchenko

[Inserted by J. Maurice Rojas] We give a formula for the number of complex roots of a generic system of two polynomial equations in two unknowns. The formula is completely combinatorial, ultimately depending just on the convex hull of the…

History and Overview · Mathematics 2007-05-23 Ferdinand Minding

We study the set of algebraic objects known as vanishing polynomials (the set of polynomials that annihilate all elements of a ring) over general commutative rings with identity. These objects are of special interest due to their close…

Commutative Algebra · Mathematics 2023-09-19 Matvey Borodin , Ethan Liu , Justin Zhang

In this work, we introduce a natural notion concerning finite vector spaces. A family of $k$-dimensional subspaces of $\mathbb{F}_q^n$, which forms a partial spread, is called almost affinely disjoint if any $(k+1)$-dimensional subspace…

Combinatorics · Mathematics 2021-06-29 Hedongliang Liu , Nikita Polyanskii , Ilya Vorobyev , Antonia Wachter-Zeh

We prove Fourier restriction estimates by means of the polynomial partitioning method for compact subsets of any sufficiently smooth hyperbolic hypersurface in threedimensional euclidean space. Our approach exploits in a crucial way the…

Classical Analysis and ODEs · Mathematics 2020-10-21 Stefan Buschenhenke , Detlef Müller , Ana Vargas

We bound the location of roots of polynomials that have nonnegative coefficients with respect to a fixed but arbitrary basis of the vector space of polynomials of degree at most $d$. For this, we interpret the basis polynomials as vector…

Combinatorics · Mathematics 2009-11-16 Julian Pfeifle

In this paper we study the affine geometric structure of the graph of a polynomial $f \in \mathbb{R} [x,y]$. We provide certain criteria to determine when the parabolic curve is compact and when the unbounded component of its complement is…

Differential Geometry · Mathematics 2017-05-02 Miguel Angel Guadarrama-García , Adriana Ortiz-Rodríguez

We present our public-domain software for the following tasks in sparse (or toric) elimination theory, given a well-constrained polynomial system. First, C code for computing the mixed volume of the system. Second, Maple code for defining…

Mathematical Software · Computer Science 2014-03-06 Ioannis Z. Emiris

This article is studying the roots of the reliability polynomials of linear consecutive-\textit{k}-out-of-\textit{n}:\textit{F} systems. We are able to prove that these roots are unbounded in the complex plane, for any fixed $k\ge2$. In the…

Discrete Mathematics · Computer Science 2022-08-31 Marilena Jianu , Leonard Daus , Vlad-Florin Dragoi , Valeriu Beiu

The real solutions to a system of sparse polynomial equations may be realized as a fiber of a projection map from a toric variety. When the toric variety is orientable, the degree of this map is a lower bound for the number of real…

Algebraic Geometry · Mathematics 2015-03-19 Evgenia Soprunova , Frank Sottile

We study intersection numbers of invariant divisors in the toric manifold associated with the fan determined by the collection of Weyl chambers for each root system of classical type and of exceptional type $G_2$. We give a combinatorial…

Combinatorics · Mathematics 2015-01-13 Hiraku Abe

We investigate the topological properties of Berkovich analytifications over hybrid fields, that is a field equipped with the maximum of its native norm and the trivial norm. We prove that the analytification of the affine line or of a…

Algebraic Geometry · Mathematics 2019-03-06 Thibaud Lemanissier , Matthew Stevenson

We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…

Algebraic Geometry · Mathematics 2007-05-23 J. Maurice Rojas