On ideals generated by monomials and one binomial
英文摘要:
We determine, in a polynomial ring over a field, the arithmetical rank of certain ideals generated by a set of monomials and one binomial.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
Margherita Barile
We determine, in a polynomial ring over a field, the arithmetical rank of certain ideals generated by a set of monomials and one binomial.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
继续探索
In this paper a new classification of monomial curves in $\mathbb{A}^4(\mathbbmss{k})$ is given. Our classification relies on the detection of those binomials and monomials that have to appear in every system of binomial generators of the defining ideal of the monomial curve; these special binomials and monomials are called indispensable in the literature. This way to proceed has the advantage of producing a natural necessary and sufficient condition for the definining ideal of a monomial curve in $\mathbb{A}^4(\mathbbmss{k})$ to have a unique minimal system of binomial generators. Furthermore…
We study various binomial and monomial ideals arising in the theory of divisors, orientations, and matroids on graphs. We use ideas from potential theory on graphs and from the theory of Delaunay decompositions for lattices to describe their minimal polyhedral cellular free resolutions. We show that the resolutions of all these ideals are closely related and that their $\mathbb{Z}$-graded Betti tables coincide. As corollaries, we give conceptual proofs of conjectures and questions posed by Postnikov and Shapiro, by Manjunath and Sturmfels, and by Perkinson, Perlman, and Wilmes. Various other r…
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 $…
The Riemann-Roch theorem on a graph G is related to Alexander duality in combinatorial commutive algebra. We study the lattice ideal given by chip firing on G and the initial ideal whose standard monomials are the G-parking functions. When G is a saturated graph, these ideals are generic and the Scarf complex is a minimal free resolution. Otherwise, syzygies are obtained by degeneration. We also develop a self-contained Riemann-Roch theory for artinian monomial ideals.
M. Morales introduced a family of binomial ideals that are binomial extensions of square free monomial ideals. Let $I\subset \si$ be a square free monomial ideal and $J\subset\sis$ a sum of scroll ideals with some extra conditions, we define the binomial extension of $I$ as $\B=I+J\subset \sis$. We set $p_2(\B)$ the minimal $i\in\N$ such that there exists $j>2$ such that $β_{i,i+j}(\B)\neq 0$. In the case where J=0, Fröberg characterized combinatorally the case $p_2(I)=\infty$; later Eisenbud et al. solved the case $p_2(I)<\infty$. We obtain a similar result as Fröberg for the binomial extensi…
We show that the defining ideal of every monomial curve in the affine or projective three-dimensional space can be set-theoretically defined by three binomial equations, two of which set-theoretically define a determinantal ideal generated by the 2-minors of a $2\times 3$ matrix with monomial entries.
Monomial and binomial retracts of polynomial rings
本文针对多项式环的收缩映射,在基环$R$满足特定条件时,证明由取值为0、单项式或二项式的收缩映射得到的收缩仍是多项式环,刻画了单项式收缩并推广了其结构。
In this paper, we study a family of binomial ideals defining monomial curves in the $n-$dimensional affine space determined by $n$ hypersurfaces of the form $x_i^{c_i} - x_1^{u_{i1}} \cdots x_n^{u_{1n}} \in k[x_1, \ldots, x_n]$ with $u_{ii} = 0$, $i\in \{ 1, \ldots, n\}$. We prove that, the monomial curves in that family are set-theoretic complete intersection. Moreover, if the monomial curve is irreducible, we compute some invariants such as genus, type and Fröbenius number of the corresponding numerical semigroup. We also describe a method to produce set-theoretic complete intersection semig…
We use cellular resolutions of monomial ideals to prove an analog of Hilbert's syzygy theorem for virtual resolutions of monomial ideals on smooth toric varieties.
In this paper we investigate the question of normality for special monomial ideals in a polynomial ring over a field. We first include some expository sections that give the basics on the integral closure of a ideal, the Rees algebra on an ideal, and some fundamental results on the integral closure of a monomial ideal.
In this paper, we investigate the arithmetical rank of a binomial ideal $J$. We provide lower bounds for the binomial arithmetical rank and the $J$-complete arithmetical rank of $J$. Special attention is paid to the case where $J$ is the binomial edge ideal of a graph. We compute the arithmetical rank of such an ideal in various cases.
We give a combinatorial description of the roots of the Bernstein-Sato polynomial of a monomial ideal using the Newton polyhedron and some semigroups associated to the ideal.
The support poset of a monomial ideal $I\subseteq\mathbf{k}[x_1,\dots,x_n]$ encodes the relation between the variables $x_1,\dots,x_n$ and the minimal monomial generators of $I$. It is known that not every poset is realizable as the support poset of some monomial ideal. We describe some posets $P$ for which we can explicitly find at least one monomial ideal $I_P$ such that $P$ is the support poset of $I_P$. Also, for some families of monomial ideals we describe their support posets and study their properties. As an example of application we examine the relation between forests and series-paral…
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$.
The core of an ideal is the intersection of all its reductions. We describe the core of a zero-dimensional monomial ideal I as the largest monomial ideal contained in a general reduction of I. This provides a new interpretation of the core in the monomial case as well as an efficient algorithm for computing it. We relate the core to adjoints and first coefficient ideals, and in dimension two and three we give explicit formulas.
We show that the real parts of the poles of the Igusa zeta function of a monomial ideal can be computed from the torus-invariant divisors on the normalized blowing-up along the ideal. Moreover, we show that every such number is a root of the Bernstein-Sato polynomial associated to the monomial ideal.
In this paper, by a modification of a previously constructed minimal free resolution for a transversal monomial ideal, the Betti numbers of this ideal is explicitly computed. For convenient characteristics of the ground field, up to a change of coordinates, the ideal of $t$-minors of a generic pluri-circulant matrix is a transversal monomial ideal . Using a Gröbner basis for this ideal, it is shown that the initial ideal of a generic pluri-circulant matrix is a stable monomial ideal when the matrix has two square blocks. By means of the Eliahou-Kervair resolution, the Betti numbers of this ini…
In this paper we characterize, in algebraic and geometric terms, when a graded vanishing ideal is generated by binomials over any field K.
In this article, we define a class of binomial ideals associated to a simplicial complex. This class of ideals appears in the presentation of fiber cones of codimension 2 lattice ideals \cite{hm}, and in the work of Barile and Morales \cite{bm2}, \cite{bm3}, \cite{bm4}. We compute the reduction number of Binomial extensions of Simplicial ideals. This extends all the previous results in this area.
Let $G$ be a simple graph on $n$ vertices and $\mathcal{I}_G$ denotes parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots, y_n].$ We obtain a lower bound for the regularity of parity binomial edge ideals of graphs. We then classify all graphs whose parity binomial edge ideals have regularity $3$. We classify graphs whose parity binomial edge ideals have pure resolution.
The goal of this paper is to produce a formula for the multiplier ideals of monomial space curves in the spirit of Howald's formula for the multiplier ideals of monomial ideals. This is achieved by constructing a toric blowup of affine space in such a way that a log resolution of the monomial curve may be constructed from this toric variety in a well controlled manner.
Let $I$ be a monomial ideal of a polynomial ring $R$. In this paper we determine a number $B$ such that $\Ass (I^n/I^{n+1}) = \Ass (I^{B}/I^{B+1})$ for all $n\geq B$.
We prove that the log canonical thresholds of a large class of binomial ideals, such as complete intersection binomial ideals and the defining ideals of space monomial curves, are computable by linear programming.
In this article, we study monomial curves, toric ideals and monomial algebras associated to $4$-generated pseudo symmetric numerical semigroups. Namely, we determine indispensable binomials of these toric ideals, give a characterization for these monomial algebras to have strongly indispensable minimal graded free resolutions. We also characterize when the tangent cones of these monomial curves at the origin are Cohen-Macaulay.
In this paper we consider the local cohomology of monomial ideals with respect to monomial prime ideals and show that all these local cohomology modules are tame.
We investigate the structure of ideals generated by binomials (polynomials with at most two terms) and the schemes and varieties associated to them. The class of binomial ideals contains many classical examples from algebraic geometry, and it has numerous applications within and beyond pure mathematics. The ideals defining toric varieties are precisely the binomial prime ideals. Our main results concern primary decomposition: If $I$ is a binomial ideal then the radical, associated primes, and isolated primary components of $I$ are again binomial, and $I$ admits primary decompositions in terms …
It is shown that any set of nonzero monomial prime ideals can be realized as the stable set of associated prime ideals of a monomial ideal. Moreover, an algorithm is given to compute the stable set of associated prime ideals of a monomial ideal.
We show that the mixed volumes of arbitrary convex bodies are equal to mixed multiplicities of graded families of monomial ideals, and to normalized limits of mixed multiplicities of monomial ideals. This result evinces the close relation between the theories of mixed volumes from convex geometry and mixed multiplicities from commutative algebra.
In this paper, basic properties of monomial difference ideals are studied. We prove the finitely generated property of well-mixed difference ideals generated by monomials. Furthermore, a finite prime decomposition of radical well-mixed monomial difference ideals is given. As a consequence, we prove that every strictly ascending chain of radical well-mixed monomial difference ideals in a difference polynomial ring is finite, which answers a question raised by E. Hrushovski in the monomial case. Moreover, the Alexander Duality for monomial ideals is generalized to the monomial case.
We characterize monomial ideals which are intersections of monomial prime ideals and study classes of ideals with this property, among them polymatroidal ideals.
We study conditions on polynomials such that the ideal generated by their orbits under the symmetric group action becomes a monomial ideal or has a monomial radical. If the polynomials are homogeneous, we expect that such an ideal has a monomial radical if their coefficients are sufficiently general with respect to their supports. We prove this for instance in the case where some generator contains a power of a variable. Moreover, if the polynomials have only square-free terms and their coefficients do not sum to zero, then in a larger polynomial ring the ideal itself is square-free monomial. …
It gives a class of $p$-Borel principal ideals of a polynomial algebra over a field $K$ for which the graded Betti numbers do not depend on the characteristic of $K$ and the Koszul homology modules have monomial cyclic basis. Also it shows that all principal $p$-Borel ideals have binomial cycle basis on Koszul homology modules.
In this paper we study the complex simultaneous Waring rank for collections of monomials. For general collections we provide a lower bound, whereas for special collections we provide a formula for the simultaneous Waring rank. Our approach is algebraic and combinatorial. We give an application to ranks of binomials and maximal simultaneous ranks. Moreover, we include an appendix of scripts written in the algebra software Macaulay2 to experiment with simultaneous ranks.
We express the multigraded Betti numbers of monomial ideals in 4 variables in terms of the multigraded Betti numbers of 66 squarefree monomial ideals, also in 4 variables. We use this class of 66 ideals to prove that monomial resolutions in 4 variables are independent of the base field. In addition, we give a formula for the Betti numbers of an arbitrary monomial ideal in 4 variables.
The reduction number of monomial ideals in the polynomial $K[x,y]$ is studied. We focus on ideals $I$ for which $J=(x^a,y^b)$ is a reduction ideal. The computation of the reduction number amounts to solve linear inequalities. In some special cases the reduction number can be explicitly computed.
We study when Taylor resolutions of monomial ideals are minimal. We consider monomial ideals with linear quotients. In particular, we determine precisely the stable ideals and the monomial ideals with linear resolutions having the miminal Taylor resolutions.
Monomial Cycles in Koszul Homology
该研究探讨单项式环上Koszul同调的单项式闭链,提出边缘理想刻画闭链为边缘链的条件,推导Golod单项式理想的判定条件并完成多类Golod理想分类,还证明具线性商的一类理想存在单项式闭链构成的同调基。
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 $I$ and prove that if $\mathbf{u}$ is a strongly linear monomial over $I$ then $I$ has a linear resolution (resp: is quasi-linear) if and only if $I+\mathbf{u}\mathfrak{p}$ has a linear resolution (resp: is quasi-linear). Here $\mathfrak{p}$ is any monomial prime ideal.
Two minimal generating sets of the first syzygies of a monomial ideal are produced, given the minimal generating set of the ideal.
We determine a new technique which allows the computation of the arithmetical rank of certain monomial ideals.
In this thesis we are interested in describing some homological invariants of certain classes of monomial ideals. We will pay attention to the squarefree and non-squarefree lexsegment ideals.
In this paper, we prove that every binomial ideal in a polynomial ring over an algebraically closed field of characteristic zero admits a canonical primary decomposition into binomial ideals. Moreover, we prove that this special decomposition is obtained from a cellular decomposition which is also defined in a canonical way and does not depend on the field.
Lyubeznik introduced the concept of size of a monomial ideal and showed that the size of a monomial ideal increased by $1$ is a lower bound for its depth. We show that the size is also a lower bound for its Stanley depth. Applying Alexander duality we obtain upper bounds for the regularity and Stanley regularity of squarefree monomial ideals.
Let $S$ be a polynomial algebra over a field. We study classes of monomial ideals (as for example lexsegment ideals) of $S$ having minimal depth. In particular, Stanley's conjecture holds for these ideals. Also we show that if Stanley's conjecture holds for a square free monomial ideal then it holds for all its trivial modifications.
We determine in an explicit way the depth of the fiber cone and its relation ideal for classes of monomial ideals in two variables. These classes include concave and convex ideals as well as symmetric ideals.
On the copersistence property and nearly copersistence property of monomial ideals
该论文聚焦数学交换代数领域,针对单项式理想展开研究,主要探究满足共持续性质或近共持续性质的这类单项式理想的相关特性。
We show that $\depth(S/I)=0$ if and only if $\sdepth(S/I)=0$, where $I\subset S=K[x_1,...,x_n]$ is a monomial ideal. We give an algorithm to compute the Stanley depth of $S/I$, where $I\subset S=K[x_1,x_2,x_3]$ is a monomial ideal. Also, we prove that a monomial ideal $I\subset K[x_1,x_2,x_3]$ minimally generated by three monomials has $\sdepth(I)=2$.
We construct monomial ideals with the property that their depth function has any given number of strict local maxima.
We introduce an exact functor defined on multigraded modules which we call the expansion functor and study its homological properties. The expansion functor applied to a monomial ideal amounts to substitute the variables by monomial prime ideals and to apply this substitution to the generators of the ideal. This operation naturally occurs in various combinatorial contexts.
In this paper, we prove that a squarefree monomial ideal of height 2 whose quotient ring is Cohen-Macaulay is set-theoretic complete intersection.
In this paper, we show for a monomial ideal $I$ of $K[x_1,x_2,\ldots,x_n]$ that the integral closure $\ol{I}$ is a monomial ideal of Borel type (Borel-fixed, strongly stable, lexsegment, or universal lexsegment respectively), if $I$ has the same property. We also show that the $k^{th}$ symbolic power $I^{(k)}$ of $I$ preserves the properties of Borel type, Borel-fixed and strongly stable, and $I^{(k)}$ is lexsegment if $I$ is stably lexsegment. For a monomial ideal $I$ and a monomial prime ideal $P$, a new ideal $J(I, P)$ is studied, which also gives a clear description of the primary decompos…
We show that the number of elements generating a squarefree monomial ideal up to radical can always be bounded above in terms of the number of its minimal monomial generators and the maximal height of its minimal primes.
We provide the regularity and the Cohen-Macaulay type of binomial edge ideals of Cohen-Macaulay cones, and we show the extremal Betti numbers of some classes of Cohen-Macaulay binomial edge ideals: Cohen-Macaulay bipartite and fan graphs. In addition, we compute the Hilbert-Poincaré series of the binomial edge ideals of some Cohen-Macaulay bipartite graphs.
Let $I$ be a monomial ideal in a polynomial ring $A=K[x_1,...,x_n]$. We call a monomial ideal $J$ to be a minimal monomial reduction ideal of $I$ if there exists no proper monomial ideal $L \subset J$ such that $L$ is a reduction ideal of $I$. We prove that there exists a unique minimal monomial reduction ideal $J$ of $I$ and we show that the maximum degree of a monomial generator of $J$ determines the slope $p$ of the linear function $\reg(I^t)=pt+c$ for $t\gg 0$. We determine the structure of the reduced fiber ring $\mathcal{F}(J)_{\red}$ of $J$ and show that $\mathcal{F}(J)_{\red}$ is isomo…
Let S be a polynomial ring in n variables, over an arbitrary field. We give the total, graded, and multigraded Betti numbers of S/M, for every monomial ideal M in S. We also give an explicit characterization of all monomial ideals M in S for which the quotient S/M has projective dimension n.
We find an explicit expression of the associated primes of monomial ideals as a colon by an element $v$, using the unique irredundant irreducible decomposition whose irreducible components are monomial ideals (Theorem 3.1). An algorithm to compute $v$ is given using Macaulay2 (Section 7). For squarefree monomial ideals the problem is related to the combinatorics of the underlying clutter or graph (Proposition 4.3). For ideals of Borel type the monomial $f$ takes a simpler form (Proposition 5.2). The authors classify when $f$ is unique (Proposition 6.2).
For a monomial ideal $I$, let $G(I)$ be its minimal set of monomial generators. If there is a total order on $G(I)$ such that the corresponding Lyubeznik resolution of $I$ is a minimal free resolution of $I$, then $I$ is called a Lyubeznik ideal. In this paper, we characterize the Lyubeznik ideals, and we discover some classes of Lyubeznik ideals.
We state a conjecture on the stability of Betti diagrams of powers of monomial ideals.
We compute the Stanley depth of irreducible monomial ideals and we show that the Stanley depth of a monomial complete intersection ideal is the same as the Stanley depth of it's radical. Also, we give some bounds for the Stanley depth of a monomial complete intersection ideal.
We characterize when the monomial maximal ideal of a simplicial affine semigroup ring has a monomial minimal reduction. When this is the case, we study the Cohen-Macaulay and Gorenstein properties of the associated graded ring and provide several bounds for the reduction number with respect to the monomial minimal reduction.
扫码添加微信好友,提出您的宝贵建议 👇
💡 备注请填写:网站反馈
发表机构由 AI 从论文文本抽取,如发现错误,欢迎反馈修正建议。