Related papers: The Newton Polytope of the Implicit Equation
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
We study translative integral formulas for certain translation invariant functionals on convex polytopes and discuss local extensions and applications to Poisson processes and Boolean models.
In the last few years there has been a growing interest towards methods for statistical inference and learning based on computational geometry and, notably, tropical geometry, that is, the study of algebraic varieties over the min-plus…
We continue the study of intersection bodies of polytopes, focusing on the behavior of $IP$ under translations of $P$. We introduce an affine hyperplane arrangement and show that the polynomials describing the boundary of $I(P+t)$ can be…
As shown by McMullen in 1983, the coefficients of the Ehrhart polynomial of a lattice polytope can be written as a weighted sum of facial volumes. The weights in such a local formula depend only on the outer normal cones of faces, but are…
We establish a correspondence between one-parameter deformations of an affine Gorenstein toric pair $(X_P, \partial X_P)$, defined by a polytope $P$, and mutations of a Laurent polynomial $f$ with Newton polytope $\newt(f) = P$. For a…
For a projective hypersurface $X \subset \P^n$, the images of the polar maps of degree $k$ are studied. The cohomology class defined by these maps is calculated and classical results on dual varieties are presented as applications.
We establish some geometric constraints on compact Coxeter polytopes in hyperbolic spaces and show that these constraints can be a very useful tool for the classification problem of reflective anisotropic Lorentzian lattices and cocompact…
In this paper, we study the Newton polygons for the $L$-functions of $n$-variable generalized Kloosterman sums. Generally, the Newton polygon has a topological lower bound, called the Hodge polygon. In order to determine the Hodge polygon,…
A shape of a combinatorial polytope is a convex embedding into Euclidean space. We provide necessary and sufficient conditions for a piecewise linear map between two shapes of the same polytope to be a compression (respectively a weak…
Tropical Differential Algebraic Geometry considers difficult or even intractable problems in Differential Equations and tries to extract information on their solutions from a restricted structure of the input. The Fundamental Theorem of…
We compute the $\delta$-invariant of a curve singularity parameterized by generic sparse polynomials. We apply this to describe topological types of generic singularities of sparse resultants and ``algebraic knot diagrams'' (i.e. generic…
We revisit the Universal Approximation Theorem(UAT) through the lens of the tropical geometry of neural networks and introduce a constructive, geometry-aware initialization for sigmoidal multi-layer perceptrons (MLPs). Tropical geometry…
Motivated by strong desire to understand the natural geometry of moduli spaces of hyperbolic monopoles, we introduce and study a new type of geometry: pluricomplex geometry. It is a generalisation of hypercomplex geometry: we still have a…
Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…
We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…
We give an algorithm to compute term by term multivariate Puiseux series expansions of series arising as local parametrizations of zeroes of systems of algebraic equations at singular points. The algorithm is an extension of Newton's method…
We consider arrangements of tropical hyperplanes where the apices of the hyperplanes are taken to infinity in certain directions. Such an arrangement defines a decomposition of Euclidean space where a cell is determined by its `type' data,…
Functional iterations such as Newton's are a popular tool for polynomial root-finding. We consider realistic situation where some (e.g., better-conditioned) roots have already been approximated and where further computations is directed to…
Tropical varieties capture combinatorial information about how coordinates of points in a classical variety approach zero or infinity. We present algorithms for computing the rays of a complex and real tropical curve defined by polynomials…