Related papers: Monomization of Power Ideals and Parking Functions
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…
In this paper it is shown that it is possible to associate several polynomial ideals to a directed graph $D$ in order to find properties of it. In fact by using algebraic tools it is possible to give appropriate procedures for automatic…
For the edge ideal I of an arbitrary simple graph G we describe the monomials of the saturation of a power of I in terms of (vertex) weighted graphs associated with the monomials. This description allows us to characterize the embedded…
Symbolic powers are studied in the combinatorial context of monomial ideals. When the ideals are generated by quadratic squarefree monomials, the generators of the symbolic powers are obstructions to vertex covering in the associated graph…
To compute the local cohomology of powers of edge ideals one needs to know their saturations. The saturation of the second and third powers has been described in terms of the graph in [13] and [10]. In this article, we give a combinatorial…
We introduce the concept of matching powers of monomial ideals. Let $I$ be a monomial ideal of $S=K[x_1,\dots,x_n]$, with $K$ a field. The $k$th matching power of $I$ is the monomial ideal $I^{[k]}$ generated by the products $u_1\cdots u_k$…
We characterize monomial ideals which are intersections of monomial prime ideals and study classes of ideals with this property, among them polymatroidal ideals.
This paper is concerned with the question of whether geometric structures such as cell complexes can be used to simultaneously describe the minimal free resolutions of all powers of a monomial ideal. We provide a full answer in the case of…
We study powers of binomial edge ideals associated with closed and block graphs.
The aim of this work is to compare symbolic and ordinary powers of monomial ideals using commutative algebra and combinatorics. Monomial ideals whose symbolic and ordinary powers coincide are called Simis ideals. Weighted monomial ideals…
We present a close relationship between matching number, covering numbers and their fractional versions in combinatorial optimization and ordinary powers, integral closures of powers, and symbolic powers of monomial ideals. This…
We generalize the enhanced power graph by replacing elements with classes under automorphisms. We show that the connectivity and diameter of this graph is similar to that of the enhanced power graph. We consider the universal vertices of…
We survey classical and recent results on symbolic powers of ideals. We focus on properties and problems of symbolic powers over regular rings, on the comparison of symbolic and regular powers, and on the combinatorics of the symbolic…
The power-law behavior is ubiquitous in a majority of real-world networks, and it was shown to have a strong effect on various combinatorial, structural, and dynamical properties of graphs. For example, it has been shown that in real-life…
This paper concerns the exponentiation of monomial ideals. While it is customary for the exponentiation operation on ideals to consider natural powers, we extend this notion to powers where the exponent is a positive real number. Real…
After sketching the basic theory of injective ideals of homogeneous polynomials, we characterize injective polynomial ideals by means of a domination property and applications of this characterization to some classical operator ideals and…
Powers of (monomial) ideals is a subject that still calls attraction in various ways. In this paper we present a nice presentation of high powers of ideals in a certain class in $\mathbb K[x_1, \ldots, x_n]$ and $\mathbb K[[x_1, \ldots,…
We survey research relating algebraic properties of powers of squarefree monomial ideals to combinatorial structures. In particular, we describe how to detect important properties of (hyper)graphs by solving ideal membership problems and…
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…
In here, I present a series of combinatorial equalities derived using a graph based approach. Different nodes in the graphs are visited following probabilistic dynamics of a moving dot. The results are presented in such a way that the…