Related papers: Newton Polytopes and Analytic Spread

We study closed subschemes $X$ in ${\mathbb P}^n$ of dimension one, locally defined at any point by at most $n$ equations such that the analytic spread of $I_{\mathfrak{m}}$ is at most $n$, where $I \subseteq \Bbbk[x_0, \ldots, x_n] $ is…

We study the algebraic and arithmetic structure of monoids of invertible ideals (more precisely, of $r$-invertible $r$-ideals for certain ideal systems $r$) of Krull and weakly Krull Mori domains. We also investigate monoids of all nonzero…

Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of…

We give explicit formulas for the Bhattacharya function of m-primary complete monomial ideals in two variables in terms of the vertices of the Newton polyhedra or in terms of the decompositions of the ideals as products of simple ideals.

We determine a new technique which allows the computation of the arithmetical rank of certain monomial ideals.

In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…

We introduce a new iterative root-finding method for complex polynomials, dubbed {\it Newton-Ellipsoid} method. It is inspired by the Ellipsoid method, a classical method in optimization, and a property of Newton's Method derived in…

We focus on two central themes in this dissertation. The first one is on decomposing polytopes and polynomials in ways that allow us to perform nonlinear optimization. We start off by explaining important results on decomposing a polytope…

The spread between two lines in rational trigonometry replaces the concept of angle, allowing the complete specification of many geometrical and dynamical situations which have traditionally been viewed approximately. This paper…

A polynomial has saturated Newton polytope (SNP) if every lattice point of the convex hull of its exponent vectors corresponds to a monomial. We compile instances of SNP in algebraic combinatorics (some with proofs, others conjecturally):…

One of the most challenging and frequently arising problems in many areas of science is to find solutions of a system of multivariate nonlinear equations. There are several numerical methods that can find many (or all if the system is small…

Finding roots of equations is at the heart of most computational science. A well-known and widely used iterative algorithm is the Newton's method. However, its convergence depends heavily on the initial guess, with poor choices often…

We studies the Newton polygon for the L-function of toric exponential sums attached to a family of two variable generalized hyperkloosterman sum,$f_{t}(x,y)=x^{n}+y+\frac{t}{xy}$ with $t$ the parameter. The explicit Newton polygon is…

For the class of polynomial quadrature rules we show that conveniently chosen bases allow to compute both the weights and the theoretical error expression of a $n$-point rule via the undetermined coefficients method. As an illustration, the…

We study the Hadamard product of the linear forms defining a hyperplane arrangement with those of its dual, which we view as generating an ideal in a certain polynomial ring. We use this ideal, which we call the ideal of pairs, to study…

Let $f(x)$ be an irreducible polynomial with integer coefficients of degree at least two. Hooley proved that the roots of the congruence equation $f(x)\equiv 0\mod n$ is uniformly distributed. as a parallel of Hooley's theorem under ideal…

We develop a collection of numerical algorithms which connect ideas from polyhedral geometry and algebraic geometry. The first algorithm we develop functions as a numerical oracle for the Newton polytope of a hypersurface and is based on…

Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…

Consider the problem of constructing an experimental design, optimal for estimating parameters of a given statistical model with respect to a chosen criterion. To address this problem, the literature usually provides a single solution.…

The goal of this paper is to study the path-following method for univariate polynomials. We propose to study the complexity and condition properties when the Newton method is applied as a correction operator. Then we study the geodesics and…