Related papers: Newton Polytopes and Analytic Spread
Using linear algebra methods we study certain algebraic properties of monomial rings and matroids. Let I be a monomial ideal in a polynomial ring over an arbitrary field. If the Rees cone of I is quasi-ideal, we express the normalization of…
Irreducible decomposition of monomial ideals has an increasing number of applications from biology to pure math. This paper presents the Slice Algorithm for computing irreducible decompositions, Alexander duals and socles of monomial…
We introduce and study monomial ideals with regular quotients, which can be seen as an extension of monomial ideals with linear quotients. Based on these investigations, we are able to calculate the Betti numbers of toric ideals belonging…
An inexact Newton type method for numerical minimization of convex piecewise quadratic functions is considered and its convergence is analyzed. Earlier, a similar method was successfully applied to optimizaton problems arising in numerical…
In design of optical systems based on LED (Light emitting diode) technology, a crucial task is to handle the unstructured data describing properties of optical elements in standard formats. This leads to the problem of data fitting within…
The bifurcation sets of polynomial functions have been studied by many mathematicians from various points of view. In particular, N\'emethi and Zaharia described them in terms of Newton polytopes. In this paper, we will show analogous…
We prove weighted anisotropic analytic estimates for solutions of second order elliptic boundary value problems in polyhedra. The weighted analytic classes which we use are the same as those introduced by Guo in 1993 in view of establishing…
Polytopes from subgraph statistics are important in applications and conjectures and theorems in extremal graph theory can be stated as properties of them. We have studied them with a view towards applications by inscribing large explicit…
Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…
An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…
We consider the problem of determining whether a monomial ideal is dominant. This property is critical for determining for which monomial ideals the Taylor resolution is minimal. We first analyze dominant ideals with a fixed least common…
We introduce a general class of symmetric polynomials that have saturated Newton polytope and their Newton polytope has integer decomposition property. The class covers numerous previously studied symmetric polynomials.
We study blowups of affine n-space with center an arbitrary monomial ideal and call monomial ideals that render smooth blowups tame ideals. We give a combinatorial criterion to decide whether the blowup is smooth and apply this criterion to…
One of the major successes in computational biology has been the unification, using the graphical model formalism, of a multitude of algorithms for annotating and comparing biological sequences. Graphical models that have been applied…
We study the normalization of a monomial ideal, and show how to compute its Hilbert function (using Ehrhart polynomials) if the ideal is zero dimensional. A positive lower bound for the second coefficient of the Hilbert polynomial is shown.
We present a polyhedral algorithm to manipulate positive dimensional solution sets. Using facet normals to Newton polytopes as pretropisms, we focus on the first two terms of a Puiseux series expansion. The leading powers of the series are…
An identity that relates multipolar solutions of the Einstein equations to Newtonian potentials of bars with linear densities proportional to Legendre polynomials is used to construct analytical potential-density pairs of infinitesimally…
We study the distributions of the splitting primes in certain families of number fields. The first and main example is the family Pn,N of integer polynomials monic of degree n with height less or equal then N, and then let N go to infinity.…
Independent sets play a key role into the study of graphs and important problems arising in graph theory reduce to them. We define the monomial ideal of independent sets associated to a finite simple graph and describe its homological and…
The classical volume polynomial in algebraic geometry measures the degrees of ample (and nef) divisors on a smooth projective variety. We introduce an analogous volume polynomial for matroids, and give a complete combinatorial formula. For…