Related papers: Monomial generators of complete planar ideals
The Koszul homology of modules of the polynomial ring $R$ is a central object in commutative algebra.It is strongly related with the minimal free resolution of these modules, and thus with regularity, Hilbert functions, etc. Here we…
Given a Noetherian ring $A$, the collection of all integrally closed ideals in $A$ which contain a nonzerodivisor, denoted $ic(A)$, forms a cancellative monoid under the operation $I*J=\overline{IJ}$, the integral closure of the product.…
We describe a minimal set of generators of the defining ideal of the Rees Algebra associated to a proper parametrization of any monoid hypersurface. In the case of plane curves, we recover a known description for rational parametrizations…
We introduce a construction, called linearization, that associates to any monomial ideal $I$ an ideal $\mathrm{Lin}(I)$ in a larger polynomial ring. The main feature of this construction is that the new ideal $\mathrm{Lin}(I)$ has linear…
We provide an algorithm that takes as an input a given parametric family of homogeneous polynomials, which is invariant under the action of the general linear group, and an integer $d$. It outputs the ideal of that family intersected with…
Proving statements about linear operators expressed in terms of identities often leads to finding elements of certain form in noncommutative polynomial ideals. We illustrate this by examples coming from actual operator statements and…
Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…
There are many connections between the invariants of the different powers of an ideal. We investigate how to construct minimal resolutions for all powers at once using methods from algebraic and polyhedral topology with a focus on ideals…
We construct a normal form for the walled Brauer algebra, together with the reduction algorithm. We apply normal form to calculate the numbers of monomials in generators with minimal length. We further utilize normal form to give explicit…
A simple formula computing the multiplier ideal of a monomial ideal on an arbitrary affine toric variety is given. Variants for the multiplier module and test ideals are also treated.
We construct the minimal resolutions of three classes of monomial ideals: dominant, 1-semidominant, and 2-semidominant ideals. The families of dominant and 1-semidominant ideals extend those of complete and almost complete intersections. We…
Deciding whether an ideal of a number field is principal and finding a generator is a fundamental problem with many applications in computational number theory. For indefinite quaternion algebras, the decision problem reduces to that in the…
Let $S=\mathbb{K}[x_1,\ldots,x_n]$ the polynomial ring over a field $\mathbb{K}$. In this paper for some families of monomial ideals $I \subset S$ we study the minimal number of generators of $I^k$. We use this results to find some other…
We present a class of homogeneous ideals which are generated by monomials and binomials of degree two and are set-theoretic complete intersections. This class includes certain reducible varieties of minimal degree and, in particular, the…
We construct monomial ideals with the property that their depth function has any given number of strict local maxima.
Proofs of two results about a monomial ideal -- describing membership in auxiliary ideals associated to the monomial ideal -- are given which do not invoke resolution of singularities. The AM--GM inequality is used as a substitute for…
For a finite subset $M\subset [x_1,\ldots,x_d]$ of monomials, we describe how to constructively obtain a monomial ideal $I\subseteq R = K[x_1,\ldots,x_d]$ such that the set of monomials in $\text{Soc}(I)\setminus I$ is precisely $M$, or…
The aim of this work is to reduce the complexity of the available algorithms for computing the generator sets of a semigroup ideal by using the Hermite normal form. In order to achieve it we introduce the concept of decomposable semigroup.…
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…
We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…