Related papers: Newton Polytopes and Analytic Spread
In this paper we study the normality of monomial ideals using linear programming and graph theory. We give normality criteria for monomial ideals, for ideals generated by monomials of degree two, and for edge ideals of graphs and clutters…
We use Newton's method to find all roots of several polynomials in one complex variable of degree up to and exceeding one million and show that the method, applied to appropriately chosen starting points, can be turned into an algorithm…
Let $S=K[x_1,\dots,x_n]$ be a polynomial ring in $n$ variables with coefficients over a field $K$. A $t$-spread lexsegment ideal $I$ of $S$ is a monomial ideal generated by a $t$-spread lexsegment set. We determine all $t$-spread lexsegment…
We define a set theoretic "analytic continuation" of a polytope defined by inequalities. For the regular values of the parameter, our construction coincides with the parallel transport of polytopes in a mirage introduced by Varchenko. We…
We apply methods of nonstandard mathematics in order to regard analytic geometry in a very different way. For example, complex spaces are seen to be the "standard part" of certain algebraic nonstandard schemes. We construct a category of…
We introduce the concept of $t$-spread monomials and $t$-spread strongly stable ideals. These concepts are a natural generalization of strongly stable and squarefree strongly stable ideals. For the study of this class of ideals we use the…
If $J\subset I$ are two monomials ideals, we give a practical upper bound for the Stanley depth of $J/I$, which we call it the \emph{quasi-depth} of $J/I$. Also, we compute the quasi-depth of several classes of square free monomial ideals.…
The aims of this work are to study Rees algebras of filtrations of monomial ideals associated to covering polyhedra of rational matrices with non-negative entries and non-zero columns using combinatorial optimization and integer…
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,…
We introduce the class of vector-spread monomial ideals. This notion generalizes that of $t$-spread ideals introduced by Ene, Herzog and Qureshi. In particular, we focus on vector-spread strongly stable ideals, we compute their Koszul…
We express the multigraded Betti numbers of an arbitrary monomial ideal in terms of the multigraded Betti numbers of two basic classes of ideals. This decompo- sition has multiple applications. In some concrete cases, we use it to construct…
Over finite fields, if the image of a polynomial map is not the entire field, then its cardinality can be bounded above by a significantly smaller value. Earlier results bound the cardinality of the value set using the degree of the…
We use the lcm-lattice of a monomial ideal to study its minimal free resolutions. A new concept called a Taylor basis of a minimal free resolution is introduced and then used throughout the paper. We give a method of constructing minimal…
We investigate, using the notion of linear quotients, significative classes of connected graphs whose monomial edge ideals, not necessarily squarefree, have linear resolution, in order to compute standard algebraic invariants of the…
The paper studies modular reduction techniques for abstract regular and chiral polytopes, with two purposes in mind: first, to survey the literature about modular reduction in polytopes; and second, to apply modular reduction, with moduli…
We study a family of polytopes and their duals, that appear in various optimization problems as the unit balls for certain norms. These two families interpolate between the hypercube, the unit ball for the $\infty$-norm, and its dual…
We compute the $F$-pure threshold of some non-principal ideals which satisfy a geometric generic condition about their Newton polyhedron. We also contribute some evidence in favor of the conjectured equality between the $F$-pure threshold…
We study the set of monomial ideals in a polynomial ring as an ordered set, with the ordering given by reverse inclusion. We give a short proof of the fact that every antichain of monomial ideals is finite. Then we investigate ordinal…
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…
We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible…