arXiv subjects

Ali Akbar Yazdan Pour

Publications and source records attributed to Ali Akbar Yazdan Pour.

18 recordsLinked to original sources

arXiv2025

Positive matching decompositions of the cartesian product of graphs

Let $Γ=(V,E)$ be a finite simple graph. A matching $M \subseteq E$ is positive if there exists a weight function on $V$ such that the matching $M$ is characterized by those edges with positive weights. A positive matching decomposition (pmd) of $Γ$ with $p$ parts is an ordered partition $E_1,\ldots,E_p$ of $E$ such that $E_i$ is a positive matching of $(V, E \setminus \bigcup_{j=1}^{i-1} E_j)$, for $i = 1, \ldots, p$. The smallest $p$ for which $Γ$ admits a pmd with $p$ parts is denoted by $\mathrm{pmd}(Γ)$. We study the pmd of the Cartesian product of graphs and give sharp upper bounds for them in terms of the pmds and chromatic numbers of their components. In special cases, we compute the pmd of grid graphs that is the Cartesian product of paths and cycles.

math.CO↗

arXiv2023

Shedding vertices and Ass-decomposable monomial ideals

The shedding vertices of simplicial complexes are studied from an algebraic point of view. Based on this perspective, we introduce the class of ass-decomposable monomial ideals which is a generalization of the class of Stanley-Reisner ideals of vertex decomposable simplicial complexes. The recursive structure of ass-decomposable monomial ideals allows us to find a simple formula for the depth, and in squarefree case, an upper bound for the regularity of such ideals.

math.AC↗

arXiv2023

Gröbner basis and Krull dimension of Lovász-Saks-Sherijver ideal associated to a tree

Let $\mathbb{K}$ be a field and $n$ be a positive integer. Let $Γ=([n], E)$ be a simple graph, where $[n]=\{1,\ldots, n\}$. If $S=\mathbb{K}[x_1, \ldots, x_n, y_1, \ldots, y_n]$ is a polynomial ring, then the graded ideal \[ L_Γ^\mathbb{K}(2) = \left( x_{i}x_{j} + y_{i}y_{j} \colon \quad \{i, j\} \in E(Γ)\right) \subset S,\] is called the Lovász-Saks-Schrijver ideal, LSS-ideal for short, of $Γ$ with respect to $\mathbb{K}$. In the present paper, we compute a Gröbner basis of this ideal with respect to lexicographic ordering induced by $x_1>\cdots>x_n>y_1>\cdots>y_n$ when $Γ=T$ is a tree. As a result, we show that it is independent of the choice of the ground field $\mathbb{K}$ and compute the Hilbert series of $L_T^\mathbb{K}(2)$. Finally, we present concrete combinatorial formulas to obtain the Krull dimension of $S/L_T^\mathbb{K}(2)$ as well as lower and upper bounds for Krull dimension.

math.AC↗

arXiv2023

The saturation number of monomial ideals

Let $S=\mathbb{K}[x_1,\ldots, x_n]$ be the polynomial ring over a field $\mathbb{K}$ and $\mathfrak{m}= (x_1, \ldots, x_n)$ be the irredundant maximal ideal of $S$. For an ideal $I \subset S$, let $\mathrm{sat}(I)$ be the minimum number $k$ for which $I \colon \mathfrak{m}^k = I \colon \mathfrak{m}^{k+1}$. In this paper, we compute the saturation number of irreducible monomial ideals and their powers. We apply this result to find the saturation number of the ordinary powers and symbolic powers of some families of monomial ideals in terms of the saturation number of irreducible components appearing in an irreducible decomposition of these ideals. Moreover, we give an explicit formula for the saturation number of monomial ideals in two variables.

math.AC↗

arXiv2022

Cellular resolutions of monomial ideals and their Artinian reductions

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-complex supporting minimal free resolution of the ideal and its Artinian reduction. Also, in this case, we compute the multigraded Betti numbers, Cohen-Macaulay type and determine when the corresponding algebra is a level algebra.

math.AC↗

arXiv2022

Positive matching decompositions of graphs

A matching $M$ in a graph $Γ$ is positive if $Γ$ has a vertex-labeling such that $M$ coincides with the set of edges with positive weights. A positive matching decomposition (pmd) of $Γ$ is an edge-partition $M_1,\ldots,M_p$ of $Γ$ such that $M_i$ is a positive matching in $Γ-M_1\cup\cdots\cup M_{i-1}$, for $i=1,\ldots,p$. The pmds of graphs are used to study algebraic properties of the Lovász-Saks-Schrijver ideals arising from orthogonal representations of graphs. We give a characterization of pmds of graphs in terms of alternating closed walks and apply it to study pmds of various classes of graphs including complete multipartite graphs, (regular) bipartite graphs, cacti, generalized Petersen graphs, etc. We further show that computation of pmds of a graph can be reduced to that of its maximum pendant-free subgraph.

math.CO↗

arXiv2022

Green-Lazarsfeld index of square-free monomial ideals and their powers

Let $\mathbb{K}$ be a field and $I$ be a square-free monomial ideal in the polynomial ring $\mathbb{K}[x_1, \ldots, x_n]$. The Green-Lazarsfeld index, $\mathrm{index}(I)$, counts the number of steps to reach to a syzygy minimally generated by a nonlinear form in a graded minimal free resolution of $I$. In this paper, we study this invariant for $I$ and its powers from a combinatorial point of view. We characterize all square-free monomial ideals $I$ generated in degree $3$ such that $\mathrm{index}(I)>1$. Utilizing this result, we also characterize all square-free monomial ideals generated in degree $3$ such that $\mathrm{index}(I)>1$ and $\mathrm{index}(I^2)=1$. In case $n\leq5$, it is shown that $\mathrm{index}(I^k)>1$ for all $k$ if $I$ is any square-free monomial ideal with $\mathrm{index}(I)>1$.

math.AC↗

arXiv2021

Extending simplicial complexes: Topological and combinatorial properties

Given an arbitrary hypergraph $\mathcal{H}$, we may glue to $\mathcal{H}$ a family of hypergraphs to get a new hypergraph $\mathcal{H}'$ having $\mathcal{H}$ as an induced subhypergraph. In this paper, we introduce three gluing techniques for which the topological and combinatorial properties (such as Cohen-Macaulayness, shellability, vertex-decomposability etc.) of the resulting hypergraph $\mathcal{H}'$ is under control in terms of the glued components. This enables us to construct broad classes of simplicial complexes containing a given simplicial complex as induced subcomplex satisfying nice topological and combinatorial properties. Our results will be accompanied with some interesting open problems.

math.AC↗

arXiv2020

Multigraded minimal free resolutions of simplicial subclutters

This paper concerns the study of a class of clutters called simplicial subclutters. Given a clutter $\mathcal{C}$ and its simplicial subclutter $\mathcal{D}$, we compare some algebraic properties and invariants of the ideals $I, J$ associated to these two clutters, respectively. We give a formula for computing the (multi)graded Betti numbers of $J$ in terms of those of $I$ and some combinatorial data about $\mathcal{D}$. As a result, we see that if $\mathcal{C}$ admits a simplicial subclutter, then there exists a monomial $u \notin I$ such that the (multi)graded Betti numbers of $I+(u)$ can be computed through those of $I$. It is proved that the Betti sequence of any graded ideal with linear resolution is the Betti sequence of an ideal associated to a simplicial subclutter of the complete clutter. These ideals turn out to have linear quotients. However, they do not form all the equigenerated square-free monomial ideals with linear quotients. If $\mathcal{C}$ admits $\varnothing$ as a simplicial subclutter, then $I$ has linear resolution over all fields. Examples show that the converse is not true.

math.AC↗

arXiv2020

The Valabrega-Valla modules of monomial ideals

In this paper, we focus on the initial degree and the vanishing of the Valabrega-Valla module of a pair of monomials ideals $J\subseteq I$ in a polynomials ring over a field $\mathbb{K}$. We prove that the initial degree of this module is bounded above by the maximum degree of a minimal generators of $J$. For edge ideals of graphs, a complete characterization of the vanishing of the Valabrega-Valla module is given. For higher degree ideals, we find classes which the Valabrega-Valla module vanishes. For the case that $J$ is the facet ideal of a clutter $\mathcal{C}$ and $I$ is the defining ideal of singular subscheme of $J$, the non-vanishing of this module is investigated in terms of the combinatorics of $\mathcal{C}$. Finally, we describe the defining ideal of the Rees algebra of $I/J$ provided that the Valabrega-Valla module is zero.

math.AC↗

arXiv2018

Decomposable clutters and a generalization of Simon's conjectutre

Each (equigenerated) squarefree monomial ideal in the polynomial ring $S=\mathbb{K}[x_1, \ldots, x_n]$ represents a family of subsets of $[n]$, called a (uniform) clutter. In this paper, we introduce a class of uniform clutters, called decomposable clutters, whose associated ideal has linear quotients and hence linear resolution over all fields. We show that chordality of these clutters guarantees the correctness of a conjecture raised by R. S. Simon on extendable shellability of $d$-skeletons of a simplex $\langle [n] \rangle$, for all $d$. We then prove this conjecture for $d \geq n-3$.

math.AC↗

arXiv2016

Candidates for non-zero Betti numbers of monomial ideals

Let $I$ be a monomial ideal in the polynomial ring $S$ generated by elements of degree at most $d$. In this paper, it is shown that, if the $i$-th syzygy of $I$ has no element of degrees $j, \ldots, j+(d-1)$ (where $j \geq i+d$), then $(i+1)$-syzygy of $I$ does not have any element of degree $j+d$. Then we give several applications of this result, including an alternative proof for Green-Lazarsfeld index of the edge ideals of graphs as well as an alternative proof for Fröberg's theorem on classification of square-free monomial ideals generated in degree two with linear resolution. Among all, we describe the possible indices $i, j$ for which $I$ may have non-zero Betti numbers $β_{i,j}$.

math.AC↗

arXiv2016

Tame graphs, clutters and their Rees algebras

A tame ideal is an ideal $I$ such that the blowup of the affine space $\mathbb{A}_k^n$ along $I$ is regular. In this paper, we give a combinatorial characterization of tame squarefree monomial ideals. More precisely, we show that a square free monomial ideal is tame if and only if the corresponding clutter is a union of some isolated vertices and a complete $d$-partite $d$-uniform clutter. It turns out that a squarefree monomial ideal is tame, if and only if the facets of its Stanley-Reisner complex have mutually disjoint complements. Also, we characterize all monomial ideals generated in degree at most 2 which are tame. Finally, we prove that tame squarefree ideals are of fiber type.

math.AC↗

arXiv2016

Simplicial orders and chordality

Chordal clutters in the sense of [14] and [3] are defined via simplicial orders. Their circuit ideal has a linear resolution, independent of the characteristic of the base field. We show that any Betti sequence of an ideal with linear resolution appears as the Betti sequence of the circuit ideal of such a chordal clutter. Associated with any simplicial order is a sequence of integers which we call the $λ$-sequence of the chordal clutter. All possible $λ$-sequences are characterized. They are intimately related to the Hilbert function of a suitable standard graded $K$-algebra attached to the chordal clutter. By the $λ$-sequence of a chordal clutter we determine other numerical invariants of the circuit ideal, such as the $\textbf{h}$-vector and the Betti numbers.

math.AC↗

arXiv2015

Stability of Betti numbers under reduction processes: towards chordality of clutters

For a given clutter $\mathcal{C}$, let $I:=I ( \bar{\mathcal{C}} )$ be the circuit ideal in the polynomial ring $S$. In this paper, we show that the Betti numbers of $I$ and $I + ( \textbf{x}_F )$ are the same in their non-linear strands, for some suitable $F \in \mathcal{C}$. Motivated by this result, we introduce a class of clutters that we call chordal. This class, is a natural extension of the class of chordal graphs and has the nice property that the circuit ideal associated to any member of this class has a linear resolution over any field. Finally we compare this class with all known families of clutters which generalize the notion of chordality, and show that our class contains several important previously defined classes of chordal clutters. We also show that in comparison with others, this class is possibly the best approximation to the class of $d$-uniform clutters with linear resolution over any field.

math.AC↗

arXiv2012

Regularity of edge ideal of a graph

In this paper, we introduce some reduction processes on graphs which preserve the regularity of related edge ideals. As a consequence, an alternative proof for the theorem of R. Fröberg on linearity of resolution of edge ideal of graphs is given.

math.AC↗

arXiv2012

Regularity and Free Resolution of Ideals which are Minimal to $d$-linearity

Toward a partial classification of monomial ideals with $d$-linear resolution, in this paper, some classes of $d$-uniform clutters which do not have linear resolution, but every proper subclutter of them has a $d$-linear resolution, are introduced and the regularity and Betti numbers of circuit ideals of such clutters are computed. Also, it is proved that for given two $d$-uniform clutters $\mathcal{C}_1, \mathcal{C}_2$, the Castelnuovo-Mumford regularity of the ideal $I(\bar{\mathcal{C}_1 \cup \mathcal{C}_2})$ is equal to the maximum of regularities of $I(\bar{\C}_1)$ and $I(\bar{\C}_2)$, whenever $V(\mathcal{C}_1) \cap V(\mathcal{C}_2)$ is a clique or ${\rm SC}(\mathcal{C}_1) \cap {\rm SC}(\mathcal{C}_2)=\emptyset$. As applications, alternative proofs are given for Fröberg's Theorem on linearity of edge ideal of graphs with chordal complement as well as for linearity of generalized chordal hypergraphs defined by Emtander. Finally, we find minimal free resolutions of the circuit ideal of a triangulation of a pseudo-manifold and a homology manifold explicitly.

math.AC↗

arXiv2012

Monomial ideals with 3-linear resolutions

In this paper, we study Cstelnuovo-Mumford regularity of square-free monomial ideals generated in degree 3. We define some operations on the clutters associated to such ideals and prove that the regularity is conserved under these operations. We apply the operations to introduce some classes of ideals with linear resolutions and also show that any clutter corresponding to a triangulation of the sphere does not have linear resolution while any proper sub-clutter of it has a linear resolution.

math.AC↗