Related papers: Symbolic Defect of Monomial Ideals

We consider the problem of determining whether a monomial ideal is dominant. This property is critical for determining for which monomial ideals the Taylor resolution is minimal. We first analyze dominant ideals with a fixed least common…

Inspired by the study of random graphs and simplicial complexes, and motivated by the need to understand average behavior of ideals, we propose and study probabilistic models of random monomial ideals. We prove theorems about the…

As a generalization of the ideals of star configurations of hypersurfaces, we consider the $a$-fold product ideal $I_a(f_1^{m_1}\cdots f_s^{m_s})$ when ${f_1,\dots,f_s}$ is a sequence of generic forms and $1\le a\le m_1+\cdots+m_s$.…

We prove that for m > 2, the m-th symbolic power of a Stanley-Reisner ideal is Cohen-Macaulay if and only if the simplicial complex is a matroid. Similarly, the m-th ordinary power is Cohen-Macaulay for some m > 2 if and only if the complex…

This is an exposition of some new results on associated primes and the depth of different kinds of powers of monomial ideals in order to show a deep connection between commutative algebra and some objects in combinatorics such as simplicial…

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.

This work is about symbolic powers of codimension two perfect ideals in a standard polynomial ring over a field, where the entries of the corresponding presentation matrix are general linear forms. The main contribution of the present…

One of the fundamental invariants connecting algebra and geometry is the degree of an ideal. In this paper we derive the probabilistic behavior of degree with respect to the versatile Erd\H{o}s-R\'enyi-type model for random monomial ideals…

An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…

Let $d \geq 2$ and $m\geq 1$ be integers such that $\gcd (d,m)=1.$ Let ${\mathfrak p}$ be the defining ideal of the monomial curve in ${\mathbb A}_{ \Bbbk{k}}^d$ parametrized by $(t^{n_1}, \ldots, t^{n_d})$ where $n_i = d + (i-1)m$ for all…

In this paper we study some algebraic and combinatorial behaviors of expansion functor. We show that on monomial ideals some properties like polymatroidalness, weakly polymatroidalness and having linear quotients are preserved under taking…

We study asymptotics for the intergal of irrationality measure functions.

Let $\mathcal{D}$ be a weighted oriented graph and $I(\mathcal{D})$ be its edge ideal. In this paper, we show that all the symbolic and ordinary powers of $I(\mathcal{D})$ coincide when $\mathcal{D}$ is a weighted oriented certain class of…

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…

We give explicit formulas for the asymptotic growth rate of the number of summands in tensor powers in certain monoidal categories with finitely many indecomposable objects, and related structures.

The main object of this note is to study the conormal module $M$ and the computation of the second symbolic power $\bar I^{(2)}$ of an ideal $\bar I$ in the residue ring $R/H$ of a polynomial ring $R$ over a field of characteristic zero.…

We consider goodness-of-fit tests for uniformity of a multinomial distribution by means of tests based on a class of symmetric statistics, defined as the sum of some function of cell-frequencies. We are dealing with an asymptotic regime,…

This paper presents a method to detect and recognize symmetries in Boolean functions. The idea is to use information theoretic measures of Boolean functions to detect sub-space of possible symmetric variables. Coupled with the new…

In this paper we study the normality of monomial ideals using linear programming and graph theory. We give normality criteria for monomial ideals, for ideals generated by monomials of degree two, and for edge ideals of graphs and clutters…

We extend the asymptotic Samuel function of an ideal to a filtration and show that many of the good properties of this function for an ideal are true for filtrations. There are, however, interesting differences, which we explore. We study…