English
Related papers

Related papers: Multiplier Ideals of Sufficiently General Polynomi…

200 papers

This article concerns monomial ideals fixed by differential operators of affine semi-group rings over $\mathbb{C}$. We give a complete characterization of when this happens. Perhaps surprisingly, every monomial ideal is fixed by an infinite…

Commutative Algebra · Mathematics 2022-12-09 Lance Edward Miller , William D. Taylor , Janet Vassilev

This article is concerned with the number of generators of perfect ideals J in regular local rings (R,m). If J is sufficiently large modulo $m^n$, a bound is established depending only on n and the projective dimension of J. More ambitious…

Commutative Algebra · Mathematics 2022-12-29 Raymond C Heitmann

We study the multiplier ideals and the corresponding jumping numbers and multiplicities $\{m(c)\}_{c\in \mathbb{R}}$ in the following context: $(X,o)$ is a complex analytic normal surface singularity, ${\mathfrak a}\subset…

Algebraic Geometry · Mathematics 2024-10-21 László Koltai , Tamás László , András Némethi

Strongly stable monomial ideals are important in algebraic geometry, commutative algebra, and combinatorics. Prompted, for example, by combinatorial approaches for studying Hilbert schemes and the existence of maximal total Betti numbers…

Commutative Algebra · Mathematics 2011-12-05 Dennis Moore , Uwe Nagel

Let $f$ be a monic univariate polynomial. We say that $f$ is positive if $f(x)$ is positive over all $x > 0$. If all the coefficients of $f$ are non-negative, then $f$ is trivially positive. In 1883, Poincar\'e proved that $f$ is positive…

Algebraic Geometry · Mathematics 2025-09-12 Brittany Riggs

Given a graded ideal $I$ in a polynomial ring over a field $K$ it is well known, that the number of distinct generic initial ideals of $I$ is finite. While it is known that for a given $d\in\N$ there is a global upper bound for the number…

Commutative Algebra · Mathematics 2013-03-15 Joke Frels , Kirsten Schmitz

We call an ideal in a polynomial ring robust if it can be minimally generated by a universal Gr\"obner basis. In this paper we show that robust toric ideals generated by quadrics are essentially determinantal. We then discuss two possible…

Commutative Algebra · Mathematics 2013-06-20 Adam Boocher , Elina Robeva

We consider cubic polynomials f(z)=z^3+az+b defined over the function field C(L), with a marked point of period N and multiplier L. In the case N=1, there are infinitely many such objects, and in the case N>2, only finitely many. The case…

Dynamical Systems · Mathematics 2019-08-15 Patrick Ingram

The W-characteristic set of a polynomial ideal is the minimal triangular set contained in the reduced lexicographical Groebner basis of the ideal. A pair (G,C) of polynomial sets is a strong regular characteristic pair if G is a reduced…

Symbolic Computation · Computer Science 2020-07-02 Rina Dong , Dongming Wang

We provide formulas and algorithms for computing the excess numbers of certain ideals. The solution for monomial ideals is given by the mixed volumes of certain polytopes. These results enable us to design specific homotopies for numerical…

Combinatorics · Mathematics 2014-05-06 Jose Rodriguez

We construct a Gr\"obner Basis of the relation ideal of a polynomial, give an interpolation formula for the basis elements and explain the connection of the interpolation formula to the Buchberger--M\"oller algorithm. We present a situation…

Number Theory · Mathematics 2007-05-23 Mathias Lederer

We obtain an effective analytic formula, with explicit constants, for the number of distinct irreducible factors of a polynomial $f \in \mathbb{Z}[x]$. We use an explicit version of Mertens' theorem for number fields to estimate a related…

Number Theory · Mathematics 2020-12-11 Stephan Ramon Garcia , Ethan Simpson Lee , Josh Suh , Jiahui Yu

In this paper, we prove a result similar to results of Itoh and Hong-Ulrich, proving that integral closure of an ideal is compatible with specialization by a general element of that ideal for ideals of height at least two in a large class…

Commutative Algebra · Mathematics 2022-08-02 Lindsey Hill , Rachel Lynn

We introduce the concept of quasi-linearity and prove it is necessary for a monomial ideal to have a linear resolution and identify all the quasi-linear quadratic monomial ideals. We define a strongly linear monomial for a monomial ideal…

Commutative Algebra · Mathematics 2023-01-30 Dancheng Lu

In this paper, we characterize the (generalized) Frobenius powers and critical exponents of two classes of monomial ideals of a polynomial ring in positive characteristic: powers of the homogeneous maximal ideal, and ideals generated by…

Commutative Algebra · Mathematics 2018-08-30 Daniel J. Hernández , Pedro Teixeira , Emily E. Witt

After sketching the basic theory of injective ideals of homogeneous polynomials, we characterize injective polynomial ideals by means of a domination property and applications of this characterization to some classical operator ideals and…

Functional Analysis · Mathematics 2019-05-08 Geraldo Botelho , Leodan A. Torres

The generalized test ideals introduced in [HY] are related to multiplier ideals via reduction to characteristic p. In addition, they satisfy many of the subtle properties of the multiplier ideals, which in characteristic zero follow via…

Commutative Algebra · Mathematics 2008-06-03 Mircea Mustata , Ken-ichi Yoshida

For an arbitrary ideal $I$ in a polynomial ring $R$ we define the notion of initially regular sequences on $R/I$. These sequences share properties with regular sequences. In particular, the length of an initially regular sequence provides a…

Commutative Algebra · Mathematics 2019-07-02 Louiza Fouli , Huy Tai Ha , Susan Morey

Let $I,J$ be componentwise linear ideals in a polynomial ring $S$. We study necessary and sufficient conditions for $I+J$ to be componentwise linear. We provide a complete characterization when $\dim S=2$. As a consequence, any…

Commutative Algebra · Mathematics 2025-04-08 Hailong Dao , Sreehari Suresh-Babu

We show that any nonzero polynomial in the ideal generated by the $r \times r$ minors of an $n \times n$ matrix $X$ can be used to efficiently approximate the determinant. For any nonzero polynomial $f$ in this ideal, we construct a small…

Computational Complexity · Computer Science 2022-10-28 Robert Andrews , Michael A. Forbes