Ngo Viet Trung
We prove that the integral closures of the powers of a squarefree monomial ideal I equal the symbolic powers if and only if I is the edge ideal of a Fulkersonian hypergraph.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We define a new combinatorial object, which we call a labeled hypergraph, uniquely associated to any square-free monomial ideal. We prove several upper bounds on the regularity of a square-free monomial ideal in terms of simple combinatorial properties of its labeled hypergraph. We also give specific formulas for the regularity of square-free monomial ideals with certain labeled hypergraphs. Furthermore, we prove results in the case of one-dimensional labeled hypergraphs.
The aim of this paper is to study the associated primes of powers of squarefree monomial ideals. Hypergraphs and squarefree monomial ideals are strongly connected. The cover ideal $J(H)$ of a hypergraph $H$ is the intersection of the primes corresponding to the edges of $H$. We define the $shadow$ of $H$ as a certain set of smaller hypergraphs related to $H$. We then describe how the shadows of $H$ preserve information about the associated primes of the powers of $J(H)$. Some implications to the persistence property are studied.
There is a natural one-to-one correspondence between squarefree monomial ideals and finite simple hypergraphs via the cover ideal construction. Let H be a finite simple hypergraph, and let J = J(H) be its cover ideal in a polynomial ring R. We give an explicit description of all associated primes of R/J^s, for any power J^s of J, in terms of the coloring properties of hypergraphs arising from H. We also give an algebraic method for determining the chromatic number of H, proving that it is equivalent to a monomial ideal membership problem involving powers of J. Our work yields two new purely al…
We use the correspondence between hypergraphs and their associated edge ideals to study the minimal graded free resolution of squarefree monomial ideals. The theme of this paper is to understand how the combinatorial structure of a hypergraph H appears within the resolution of its edge ideal I(H). We discuss when recursive formulas to compute the graded Betti numbers of I(H) in terms of its sub-hypergraphs can be obtained; these results generalize our previous work on the edge ideals of simple graphs. We introduce a class of hypergraphs, which we call properly-connected, that naturally general…
Given a square-free monomial ideal $I$ in a polynomial ring $R$ over a field $\mathbb{K}$, one can associate it with its LCM-lattice and its hypergraph. In this short note, we establish the connection between the LCM-lattice and the hypergraph, and in doing so we provide a sufficient condition for removing higher dimension edges of the hypergraph without impacting the projective dimension of the square-free monomial ideal. We also offer algorithms to compute the projective dimension of a class of square-free monomial ideals built using the new result and previous results of Lin-Mantero.
In a 2008 paper, the first author and Van Tuyl proved that the regularity of the edge ideal of a graph G is at most one greater than the matching number of G. In this note, we provide a generalization of this result to any square-free monomial ideal. We define a 2-collage in a simple hypergraph to be a collection of edges with the property that for any edge E of the hypergraph, there exists an edge F in the collage such that |E \ F| < 2. The Castelnuovo-Mumford regularity of the edge ideal of a simple hypergraph is bounded above by a multiple of the minimum size of a 2-collage. We also give a …
We prove a sufficient and a necessary condition for a square-free monomial ideal $J$ associated to a (dual) hypergraph to have projective dimension equal to the minimal number of generators of $J$ minus 2. We also provide an effective explicit procedure to compute the projective dimension of 1-dimensional hypergraphs $\mathcal{H}$ when each connected component contains at most one cycle. An algorithm to compute the projective dimension is also included. Applications of these results are given; they include, for instance, computing the projective dimension of monomial ideals whose associated hy…
We present a closed formula and a simple algorithmic procedure to compute the projective dimension of square-free monomial ideals associated to string or cycle hypergraphs. As an application, among these ideals we characterize all the Cohen-Macaulay ones.
In this paper,we introduce the monomial ideals I(H) associated to a special class of non uniform hypergraphs H(X; E; d) namely uniformly increasing hypergraphs. These ideals are named as inclusion ideals. In this paper, we discuss some algebraic properties of these inclusion ideals. In particular, we give an upper bound of the Castlenouvo-Mumford regularity of the special dual ideal I^[*](H) of the inclusion ideal.
We give an upper bound for the Stanley depth of the edge ideal of a complete $k$-partite hypergraph and as an application we give an upper bound for the Stanley depth of a monomial ideal in a polynomial ring $S$. We also give a lower and an upper bound for the cyclic module $S/I$ associated to the complete $k$-partite hypergraph.
We survey a number of recent studies of the Castelnuovo-Mumford regularity of squarefree monomial ideals. Our focus is on bounds and exact values for the regularity in terms of combinatorial data from associated simplicial complexes and/or hypergraphs.
In this paper, we unfold balanced and totally balanced neighborhood hypergraphs to discover new classes of normally torsion-free monomial ideals. As a consequence, we establish that the closed neighborhood ideals and the dominating ideals of strongly chordal graphs are normally torsion-free. We discuss the stable sets of associated primes of the dominating ideals of cycles and characterize all the cycles with normally torsion-free dominating ideals.
Let $R$ be a polynomial ring over a field $K$. To a given squarefree monomial ideal $I \subset R$, one can associate a hypergraph $H(I)$. In this article, we prove that the arithmetical rank of $I$ is equal to the projective dimension of $R/I$ when $H(I)$ is a string or a cycle hypergraph.
We derive two general bounds for the depths of powers of squarefree monomial ideals corresponding to hyperforests. These bounds generalize known bounds for the depths of squarefree monomial ideals, which were given in terms of the edgewise domination number of the corresponding hypergraphs and the lengths of initially regular sequences with respect to the ideals.
Lefschetz properties of squarefree monomial ideals via Rees algebras
本文利用单项式理想 Rees 代数理论，将 Lefschetz 性质与无平方单项式理想及单纯复形联系起来，推广了 Postnikov 的混合欧拉数并证明其正性。
An ideal I in a Noetherian ring R is normally torsion-free if Ass(R/I^t)=Ass(R/I) for all natural numbers t. We develop a technique to inductively study normally torsion-free square-free monomial ideals. In particular, we show that if a square-free monomial ideal I is minimally not normally torsion-free then the least power t such that I^t has embedded primes is bigger than beta_1, where beta_1 is the monomial grade of I, which is equal to the matching number of the hypergraph H(I) associated to I. If in addition I fails to have the packing property, then embedded primes of I^t do occur when t…
In this paper, our main focus is to explore different classes of nearly normally torsion-free ideals. We first characterize all finite simple connected graphs with nearly normally torsion-free cover ideals. Next, we characterize all normally torsion-free $t$-spread principal Borel ideals that can also be viewed as edge ideals of uniform multipartite hypergraphs.
Persistent commutative algebra on graphs and hypergraphs
本文提出持久交换代数用于研究图与超图边理想在过滤下的代数与组合演变，通过持久Hochster公式和Betti分裂不等式，揭示了持久边理想在数据科学中的应用价值。
The edges of any hypergraph parametrize a monomial algebra called the edge subring of the hypergraph. We study presentation ideals of these edge subrings, and describe their generators in terms of balanced walks on hypergraphs. Our results generalize those for the defining ideals of edge subrings of graphs, which are well-known in the commutative algebra community, and popular in the algebraic statistics community. One of the motivations for studying toric ideals of hypergraphs comes from algebraic statistics, where generators of the toric ideal give a basis for random walks on fibers of the s…
On the set of associated radicals of powers of monomial ideals
本文研究了多项式环中单项式理想（符号）幂的结合根理想集合的渐近行为，证明了其一般不稳定的结论，并针对无平方单项式理想和平衡超图覆盖理想给出了稳定性和单调性结果。
We explore connections between the generalized multiplicities of square-free monomial ideals and the combinatorial structure of the underlying hypergraphs using methods of commutative algebra and polyhedral geometry. For instance, we show the $j$-multiplicity is multiplicative over the connected components of a hypergraph, and we explicitly relate the $j$-multiplicity of the edge ideal of a properly connected uniform hypergraph to the Hilbert-Samuel multiplicity of its special fiber ring. In addition, we provide general bounds for the generalized multiplicities of the edge ideals and compute t…
Vertex cover ideals of simplicial complexes
本文构造新单纯复形并给出超图顶点可分解性检验程序，证明所得复形的关联超图可顶点分解且覆盖理想的所有符号幂分量线性，推广了已有图论结果。
Given a squarefree monomial ideal $I \subseteq R =k[x_1,\ldots,x_n]$, we show that $\widehatα(I)$, the Waldschmidt constant of $I$, can be expressed as the optimal solution to a linear program constructed from the primary decomposition of $I$. By applying results from fractional graph theory, we can then express $\widehatα(I)$ in terms of the fractional chromatic number of a hypergraph also constructed from the primary decomposition of $I$. Moreover, expressing $\widehatα(I)$ as the solution to a linear program enables us to prove a Chudnovsky-like lower bound on $\widehatα(I)$, thus verifying…
A hypergraph characterization of nearly complete intersections
本文扩展了边理想理论，完全刻画了任意生成次数的近似完全交，并利用该刻画从其2次部分计算极小自由分解。
The edge ideals of $\bf{t}$-spread $d$-partite hypergraphs
本文引入t-spread d-部超图并研究其边理想，证明该理想具线性商、各幂具线性分解、Rees代数为正规Cohen-Macaulay整环，且理想正规无挠，并完整刻画商环的Cohen-Macaulay性。
Admissible set and squarefree-power-like function with applications to squarefree symbolic powers
本文引入类平方自由幂函数统一平方自由幂序列，借助Tor-消没准则建立正则性下界，并应用于块图及Cohen-Macaulay弦图得到精确公式。
Normal Rees algebras arising from vertex decomposable simplicial complexes
本文证明了顶点可分解单纯复形的Rees代数是正规Cohen-Macaulay整环，并据此推导出无平方弱多拟阵理想及相关图覆盖理想和超图边理想的正规性。
To a natural number $n$, a finite partially ordered set $P$ and a poset ideal ${\mathcal J}$ in the poset $Hom(P,[n])$ of isotonian maps from $P$ to the chain on $n$ elements, we associate two monomial ideals, the letterplace ideal $L(n,P;{\mathcal J})$ and the co-letterplace ideal $L(P,n;{\mathcal J})$. These ideals give a unified understanding of a number of ideals studied in monomial ideal theory in recent years. By cutting down these ideals by regular sequences of variable differences we obtain: multichain ideals and generalized Hibi type ideals, initial ideals of determinantal ideals, str…
In this paper we study minimal free resolutions of some classes of monomial ideals. we first give a sufficient condition to check the minimality of the resolution obtained by the mapping cone. Using it, we obtain the Betti numbers of max-path ideals of rooted trees and ideals containing powers of variables. In particular, we discuss about resolutions of ideals of the form $J_{\mathcal{H}}+(x_{i_1}^2,\ldots, x_{i_m}^2)$ where $J_{\mathcal{H}}$ is the edge ideal of a hypergraph $\mathcal{H}$.
Star configurations are certain unions of linear subspaces of projective space that have been studied extensively. We develop a framework for studying a substantial generalization, which we call matroid configurations, whose ideals generalize Stanley-Reisner ideals of matroids. Such a matroid configuration is a union of complete intersections of a fixed codimension. Relating these to the Stanley-Reisner ideals of matroids and using methods of Liaison Theory allows us, in particular, to describe the Hilbert function and minimal generators of the ideal of, what we call, a hypersurface configurat…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。