Let $K$ be a field, and let $R = K[X]$ be the polynomial ring in an infinite collection $X$ of indeterminates over $K$. Let ${\mathfrak S}_{X}$ be the symmetric group of $X$. The group ${\mathfrak S}_{X}$ acts naturally on $R$, and this in turn gives $R$ the structure of a left module over the (left) group ring $R[{\mathfrak S}_{X}]$. A recent theorem of Aschenbrenner and Hillar states that the module $R$ is Noetherian. We prove that submodules of $R$ can have any number of minimal generators.
Let $I_G$ be the toric ideal of a graph $G$. We characterize in graph theoretical terms the primitive, the minimal, the indispensable and the fundamental binomials of the toric ideal $I_G$.
We develop several techniques for the study of the radical ideal $I$ defining the diagonal locus of $(\C^2)^n$. Using these techniques, we give combinatorial construction of generators for $I$ of certain bi-degrees.
Let $I$ be an ideal of a polynomial algebra $S$ over a field generated by square free monomials of degree $\geq d$. If $I$ contains more monomials of degree $d$ than $(n-d)/(n-d+1)$ of the total number of square free monomials of $S$ of degree $d+1$ then $\depth_SI\leq d$, in particular the Stanley's Conjecture holds in this case.
Let $A=\{{\bf a}_1,...,{\bf a}_m\} \subset \mathbb{Z}^n$ be a vector configuration and $I_A \subset K[x_1,...,x_m]$ its corresponding toric ideal. The paper consists of two parts. In the first part we completely determine the number of different minimal systems of binomial generators of $I_A$. We also prove that generic toric ideals are generated by indispensable binomials. In the second part we associate to $A$ a simplicial complex $Δ_{\ind(A)}$. We show that the vertices of $Δ_{\ind(A)}$ correspond to the indispensable monomials of the toric ideal $I_A$, while one dimensional facets of $Δ_{\…
In this paper, we investigate three problems concerning the toric ideal associated to a matroid. Firstly, we list all matroids $\mathcal M$ such that its corresponding toric ideal $I_{\mathcal M}$ is a complete intersection. Secondly, we handle with the problem of detecting minors of a matroid $\mathcal M$ from a minimal set of binomial generators of $I_{\mathcal M}$. In particular, given a minimal set of binomial generators of $I_{\mathcal M}$ we provide a necessary condition for $\mathcal M$ to have a minor isomorphic to $\mathcal U_{d,2d}$ for $d \geq 2$. This condition is proved to be suff…
We study the number of generators of ideals in regular rings and ask the question whether $μ(I)<μ(I^2)$ if $I$ is not a principal ideal, where $μ(J)$ denotes the number of generators of an ideal $J$. We provide lower bounds for the number of generators for the powers of an ideal and also show that the CM-type of $I^2$ is $\geq 3$ if $I$ is a monomial ideal of height $n$ in $K[x_1,\ldots,x_n]$ and $n\geq 3$.
In this paper we define an interesting family of perfect ideals of codimension three, with five generators, of Cohen-Macaulay type two with trivial multiplication on the Tor algebra. This family is likely to play a key role in classifying perfect ideals with five generators of type two.
Given a number $q$, we construct a monomial ideal $I$ with the property that the function which describes the number of generators of $I^k$ has at least $q$ local maxima.
Let $I$ be the ideal generated by alternating polynomials in two sets of $n$ variables. Haiman proved that the $q,t$-Catalan number is the Hilbert series of the graded vector space $M(=\bigoplus_{d_1,d_2}M_{d_1,d_2})$ spanned by a minimal set of generators for $I$. In this paper we give simple upper bounds on $\text{dim}M_{d_1, d_2}$ in terms of partition numbers, and find all bi-degrees $(d_1,d_2)$ such that $\dim M_{d_1, d_2}$ achieve the upper bounds. For such bi-degrees, we also find explicit bases for $M_{d_1, d_2}$. The main idea is to define and study a nontrivial linear map from $M$ to…
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 conjectures are also introduced with some partial results.
We exhibit a set of minimal generators of the defining ideal of the Rees Algebra associated to the ideal of three bivariate homogeneous polynomials parametrizing a proper rational curve in projective plane, having a minimal syzygy of degree 2.
We consider a certain class of Schubert varieties of the affine Grassmannian of type A. By embedding a Schubert variety into a finite-dimensional Grassmannian, we construct an explicit basis of sections of the basic line bundle by restricting certain Plücker co-ordinates. As a consequence, we write an explicit set of generators for the degree-one part of the ideal of the finite-dimensional embedding. This in turn gives a set of generators for the degree-one part of the ideal defining the affine Grassmannian inside the infinite Grassmannian which we conjecture to be a complete set of ideal gene…
We present an explicit construction of a minimal cellular resolution for the edge ideals of forests, based on discrete Morse theory. In particular, the generators of the free modules are subsets of the generators of the modules in the Lyubeznik resolution. This procedure allows to ease the computation of the graded Betti numbers and the projective dimension.
We prove that a monomial ideal $I$ generated in a single degree, is polymatroidal if and only if it has linear quotients with respect to the lexicographical ordering of the minimal generators induced by every ordering of variables. We also conjecture that the polymatroidal ideals can be characterized with linear quotients property with respect to the reverse lexicographical ordering of the minimal generators induced by every ordering of variables. We prove our conjecture in many special cases.
In this paper we study the algebra of graph invariants, focusing mainly on the invariants of simple graphs. All other invariants, such as sorted eigenvalues, degree sequences and canonical permutations, belong to this algebra. In fact, every graph invariant is a linear combination of the basic graph invariants which we study in this paper. To prove that two graphs are isomorphic, a number of basic invariants are required, which are called separator invariants. The minimal set of separator invariants is also the minimal basic generator set for the algebra of graph invariants. We find lower and …
A minimal monomial ideal is the combinatorially simplest monomial ideal whose lcm-lattice equals a given finite atomic lattice $\hat{L}$. The minimal ideal inherits many nice properties of any ideal $I$ whose lcm-lattice also equals $\hat{L}$, e.g. Cohen-Macaulayness and the dual property of having a linear resolution. Conversely, any ideal having a linear resolution is shown to be (essentially) minimal.
This paper studies the numbers of minimal generators of powers of monomial ideals in polynomial rings. For a monomial ideal $I$ in two variables, Eliahou, Herzog, and Saem gave a sharp lower bound $μ(I^2)\ge 9$ for the number of minimal generators of $I^2$ with $μ(I)\geq 6$. Recently, Gasanova constructed monomial ideals such that $μ(I)>μ(I^n)$ for any positive integer $n$. In reference to them, we construct a certain class of monomial ideals such that $μ(I)>μ(I^2)>\cdots >μ(I^n)=(n+1)^2$ for any positive integer $n$, which provides one of the most unexpected behaviors of the function $μ(I^k)$…
Over a field of characteristic $0$, we construct a minimal set of generators of the defining ideals of closures of nilpotent conjugacy class in the set of $n \times n$ matrices. This modifies a conjecture of Weyman and provides a complete answer to it.
For a Noetherian local domain $A$, there exists an upper bound $N_τ(A)$ on the minimal number of generators of any height two ideal $I$ for which $A/I$ is Cohen-Macaulay of type $τ$. More precisely, we may take $N_τ(A):=(τ+1)e_{\text{h}}(A)$, where $e_{\text{h}}(A)$ is the homological multiplicity of $A$.
In this paper we discuss minimal primes over permanental ideals of generic matrices. We give a complete list of the minimal primes over ideals of 3 x 3 permanents of a generic matrix, and show that there are monomials in the ideal of maximal permanents of a d x 2d-1 matrix if the characteristic of the ground field is sufficiently large. We also discuss the Alon-Jaeger-Tarsi Conjecture, using our results and techniques to strenthen the previously known results.
Cellular resolutions of second powers of square-free monomial ideals with divisibility relations
University of Manitoba（曼尼托巴大学）；King Abdullah University Of Science and Technology（阿卜杜拉国王科技大学）；Dalhousie University（达尔豪斯大学）；Texas State University（德克萨斯州立大学）；University of Missouri-Kansas City（密苏里大学堪萨斯城分校）；University of Mississippi（密西西比大学）
We provide an algorithm that computes a set of generators for any complete ideal in a smooth complex surface. More interestingly, these generators admit a presentation as monomials in a set of maximal contact elements associated to the minimal log-resolution of the ideal. Furthermore, the monomial expression given by our method is an equisingularity invariant of the ideal. As an outcome, we provide a geometric method to compute the integral closure of a planar ideal and we apply our algorithm to some families of complete ideals.
Otto von Guericke University Magdeburg（奥托·冯·格里克马格德堡大学）；Iowa State University（爱荷华州立大学）；Dalhousie University（达尔豪斯大学）；MPI für Mathematik in den Naturwissenschaften（德国马普自然科学数学研究所）
We use the notion of Borel generators to give alternative methods for computing standard invariants, such as associated primes, Hilbert series, and Betti numbers, of Borel ideals. Because there are generally few Borel generators relative to ordinary generators, this enables one to do manual computations much more easily. Moreover, this perspective allows us to find new connections to combinatorics involving Catalan numbers and their generalizations. We conclude with a surprising result relating the Betti numbers of certain principal Borel ideals to the number of pointed pseudo-triangulations o…
The $G$-parking function ideal $M_G$ of a directed multigraph $G$ is a monomial ideal which encodes some of the combinatorial information of $G$. It is an initial ideal of the toppling ideal $I_G$, a lattice ideal intimately related to the chip-firing game on a graph. Both ideals were first studied by Cori, Rossin, and Salvy. A minimal free resolution for $M_G$ was given by Postnikov and Shaprio in the case when $G$ is saturated, i.\,e., whenever there is at least one edge $(u,v)$ for every ordered pair of distinct vertices $u$ and $v$. They also raised the problem of an explicit description o…
In this paper, we deal with the problem of uniqueness of minimal system of binomial generators of a semigroup ideal. Concretely, we give different necessary and/or sufficient conditions for uniqueness of such minimal system of generators. These conditions come from the study and combinatorial description of the so-called indispensable binomials in the semigroup ideal.
Stillman posed a question as to whether the projective dimension of a homogeneous ideal I in a polynomial ring over a field can be bounded by some formula depending only on the number and degrees of the minimal generators of I. More recently, motivated by work on local cohomology modules in characteristic p, Zhang asked more specifically if the projective dimension of I is bounded by the sum of the degrees of the generators. We define a family of homogeneous ideals in a polynomial ring over a field of arbitrary characteristic whose projective dimension grows exponentially if the number and deg…
A graph-theoretic method, simpler than existing ones, is used to characterize the minimal set of monomial generators for the integral closure of any algebra of polynomials generated by quadratic monomials. The toric ideal of relations between these generators is generated by a set of binomials, defined graphically. The spectra of the original algebra and of its integral closure turn out to be canonically homeomorphic.
In recent years, the combinatorial properties of monomials ideals and binomial ideals have been widely studied. In particular, combinatorial interpretations of free resolution algorithms have been given in both cases. In this present work, we will introduce similar techniques, or modify existing ones to obtain two new results. The first is $S[Λ]$-resolutions of $Λ$-invariant submodules of $k[\mathbb{Z}^n]$ where $Λ$ is a lattice in $\mathbb{Z}^n$ satisfying some trivial conditions. A consequence will be the ability to resolve submodules of $k[\mathbb{Z}^n/Λ]$, and in particular ideals $J$ of $…
Based upon a previous work of Manjunath and Sturmfels for a finite, complete, undirected graph, and a refined algorithm by Eröcal, Motsak, Schreyer and Steenpaß for computing syzygies, we display a free resolution of the lattice ideal associated to a finite, strongly connected, weighted, directed graph. Moreover, the resolution is minimal precisely when the digraph is strongly complete.
The question we address in this paper is: which monomial ideals have minimal cellular resolutions, that is, minimal resolutions obtained from homogenizing the chain maps of CW-complexes? Velasco gave families of examples of monomial ideals that do not have minimal cellular resolutions, but those examples have large minimal generating sets. In this paper, we show that if a monomial ideal has at most four generators, then the ideal and its (monomial) Artinian reductions have minimal cellular resolutions. When the ideal is generated by two monomials, we can give a precise description of the CW-co…
We let $A=R/I$ be a standard graded Artinian algebra quotient of $R={\sf k}[x,y]$, the polynomial ring in two variables over a field ${\sf k}$ by an ideal $I$, and let $n$ be its vector space dimension. The Jordan type $P_\ell$ of a linear form $\ell\in A_1$ is the partition of $n$ determining the Jordan block decomposition of the multiplication on $A$ by $\ell$ -- which is nilpotent. The first three authors previously determined which partitions of $n=\dim_{\sf k}A$ may occur as the Jordan type for some linear form $\ell$ on a graded complete intersection Artinian quotient $A=R/(f,g)$ of $R$,…
We study the vanishing ideal of the parametrized algebraic toric associated to the complete multipartite graph $\G=\mathcal{K}_{α_1,...,α_r}$ over a finite field of order $q$. We give an explicit family of binomial generators for this lattice ideal, consisting of the generators of the ideal of the torus, (referred to as type I generators), a set of quadratic binomials corresponding to the cycles of length 4 in $\G$ and which generate the \emph{toric algebra of $\G$} (type II generators) and a set of binomials of degree $q-1$ obtained combinatorially from $\G$ (type III generators). Using this …
Let $a, b$ and $n > 1$ be three positive integers such that $a$ and $\sum_{j=0}^{n-1} b^j$ are relatively prime. In this paper, we prove that the toric ideal $I$ associated to the submonoid of $\mathbb{N}$ generated by $\{\sum_{j=0}^{n-1} b^j\} \cup \{\sum_{j=0}^{n-1} b^j + a\, \sum_{j=0}^{i-2} b^j \mid i = 2, \ldots, n\}$ is determinantal. Moreover, we prove that for $n > 3$, the ideal $I$ has a unique minimal system of generators if and only if $a < b-1$.
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 having a syzygy of minimal degree (μ=1). We also show that our approach can be applied to parametrizations of rational surfaces having a Hilbert-Burch resolution with μ_1=μ_2=1.
We define a total order, which we call rooted order, on minimal generating set of $J(P_n)^s$ where $J(P_n)$ is the cover ideal of a path graph on $n$ vertices. We show that each power of a cover ideal of a path has linear quotients with respect to the rooted order. Along the way, we characterize minimal generating set of $J(P_n)^s$ for $s\geq 3$ in terms of minimal generating set of $J(P_n)^2$. We also discuss the extension of the concept of rooted order to chordal graphs. Computational examples suggest that such order gives linear quotients for powers of cover ideals of chordal graphs as well…
Let $S$ be a polynomial ring over any field $\Bbbk$, and let $P \subseteq S$ be a non-degenerate homogeneous prime ideal of height $h$. When $\Bbbk$ is algebraically closed, a classical result attributed to Castelnuovo establishes an upper bound on the number of linearly independent quadrics contained in $P$ which only depends on $h$. We significantly extend this result by proving that the number of minimal generators of $P$ in any degree $j$ can be bounded above by an explicit function that only depends on $j$ and $h$. In addition to providing a bound for generators in any degree $j$, not jus…
If $I$ is a perfect ideal in a local Cohen-Macaulay ring, the generators of ideals linked to $I$ are well understood. However, the generators of the residual intersections of $I$ have only been computed in a few special cases. In this paper, we show that the $n$-residual intersections of determinantal ideals of generic $2\times n$ matrices are sums of links.
We discuss a class of modules, which we call $\underline{g}$-weak complete intersection modules, inspired by the weak complete intersection ideals studied by Rahmati, Striuli, and Yang and we present explicit formulas for the generators of Koszul homology with coefficients in a $\underline{g}$-weak complete intersection module. This generalizes work of Herzog and of Corso, Goto, Huneke, Polini, and Ulrich. We use these explicit formulas to study connections between $\underline{g}$-weak complete intersection ideals and weak complete intersection ideals.
Let I be the toric ideal defined by a 2 x n matrix of integers, A = ((1 1 ... 1)(a_1 a_2 ... a_n)) with a_1<a_2<...<a_n. We give a combinatorial proof that I is generated by elements of degree at most the sum of the two largest differences a_i - a_(i-1). The novelty is in the method of proof: the result has already been shown by L'vovsky using cohomological arguments.
Let $(R,\mathfrak{m})$ be a local Noetherian ring with residue field $k$. While much is known about the generating sets of reductions of ideals of $R$ if $k$ is infinite, the case in which $k$ is finite is less well understood. We investigate the existence (or lack thereof) of proper reductions of an ideal of $R$ and the number of generators needed for a reduction in the case $k$ is a finite field. When $R$ is one-dimensional, we give a formula for the smallest integer $n$ for which every ideal has an $n$-generated reduction. It follows that in a one-dimensional local Noetherian ring every ide…
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 show that dominant ideals give a precise characterization of when the Taylor resolution is minimal, 1-semidominant ideals are Scarf, and the minimal resolutions of 2-semidominant ideals can be obtained from their Taylor resolutions by eliminating faces and facets of equal multidegree, in arbitrary order. We study the combinatorial properties of these classe…
An equigenerated monomial ideal $I$ in the polynomial ring $S= K[x_1,\ldots,x_n]$ is a Freiman ideal if $μ(I^2)=\ell(I)μ(I)-{\ell(I)\choose 2}$ where $\ell(I)$ is the analytic spread of $I$ and $μ(I)$ is the number of minimal generators of $I$. In this paper, we classify certain classes of Borel type ideals, including Borel ideals with multiple Borel generators and principal $k$-Borel ideals, which are Freiman.
We give a necessary and sufficient condition on a homogeneous polynomial ideal for its Taylor complex to be exact. Then we give a combinatorial construction of a minimal resolution for ideals satisfying the above condition (in particular for monomial ideals).
We characterize componentwise linear monomial ideals with minimal Taylor resolution and consider the lower bound for the Betti numbers of componentwise linear ideals.
An equigenerated monomial ideal $I$ is a Freiman ideal if $μ(I^2)=\ell(I)μ(I)-{\ell(I)\choose 2}$ where $\ell(I)$ is the analytic spread of $I$ and $μ(I)$ is the least number of monomial generators of $I$. Freiman ideals are special since there exists an exact formula computing the least number of monomial generators of any of their powers. In this paper we give a complete classification of Freiman $t$-spread principal Borel ideals.
Let $(R, \mathfrak m)$ be a Noetherian local ring and $I$ a $\mathfrak m$-primary ideal. In this paper, we study an inequality involving the number of generators, the Loewy length and the multiplicity of $I$. There is strong evidence that the inequality holds for all integrally closed ideals of finite colength if and only if $R$ has sufficiently nice singularities. We verify the inequality for regular local rings in all dimensions, for rational singularity in dimension $2$, and cDV singularities in dimension $3$. In addition, we can classify when the inequality always hold for a Cohen-Macaulay…
