Searcharxiv⌕ Search

arXiv subjects

Sara Saeedi Madani

Publications and source records attributed to Sara Saeedi Madani.

30 records · Page 2Linked to original sources
arXiv2016

Algebraic properties of ideals of poset homomorphisms

Given finite posets $P$ and $Q$, we consider a specific ideal $L(P,Q)$, whose minimal monomial generators correspond to order-preserving maps $ϕ:P\rightarrow Q$. We study algebraic invariants of those ideals. In particular, sharp lower and upper bounds for the Castelnuovo-Mumford regularity and the projective dimension are provided. Precise formulas are obtained for a large subclass of these ideals. Moreover, we provide complete characterizations for several algebraic properties of $L(P,Q)$, including being Buchsbaum, Cohen-Macaulay, Gorenstein and having a linear resolution. We also give a partial characterization for Golod property of $L(P,Q)$. Using those results, we derive applications for other important classes of monomial ideals, such as initial ideals of determinantal ideals and multichain ideals.

math.AC↗
arXiv2015

The linear strand of determinantal facet ideals

Let $X$ be an $(m\times n)$-matrix of indeterminates, and let $J$ be the ideal generated by a set $\mathcal{S}$ of maximal minors of $X$. We construct the linear strand of the resolution of $J$. This linear strand is determined by the clique complex of the $m$-clutter corresponding to the set $\mathcal{S}$. As a consequence one obtains explicit formulas for the graded Betti numbers $β_{i,i+m}(J)$ for all $i\geq 0$. We also determine all sets $\mathcal{S}$ for which $J$ has a linear resolution.

math.AC↗
arXiv2015

Some Cohen-Macaulay and unmixed binomial edge ideals

We study unmixed and Cohen-Macaulay properties of the binomial edge ideal of some classes of graphs. We compute the depth of the binomial edge ideal of a generalized block graph. We also characterize all generalized block graphs whose binomial edge ideals are Cohen-Macaulay and unmixed. So that we generalize the results of Ene, Herzog and Hibi on block graphs. Moreover, we study unmixedness and Cohen-Macaulayness of the binomial edge ideal of some graph products such as the join and corona of two graphs with respect to the original graphs'.

math.AC↗
arXiv2015

Cohen-Macaulay and Gorenstein path ideals of trees

Let $R=k[x_{1},\ldots,x_{n}]$, where $k$ is a field. The path ideal (of length $t\geq 2$) of a directed graph $G$ is the monomial ideal, denoted by $I_{t}(G)$, whose generators correspond to the directed paths of length $t$ in $G$. Let $Γ$ be a directed rooted tree. We characterize all such trees whose path ideals are unmixed and Cohen-Macaulay. Moreover, we show that $R/I_{t}(Γ)$ is Gorenstein if and only if the Stanley-Reisner simplicial complex of $I_{t}(Γ)$ is a matroid.

math.CO↗
arXiv2015

The Castelnuovo-Mumford regularity of binomial edge ideals

We prove a conjectured upper bound for the Castelnuovo-Mumford regularity of binomial edge ideals of graphs, due to Matsuda and Murai. Indeed, we prove that $\mathrm{reg}(J_G)\leq n-1$ for any graph $G$ with $n$ vertices, which is not a path. Moreover, we study the behavior of the regularity of binomial edge ideals under the join product of graphs.

math.AC↗
arXiv2014

On the ideal of orthogonal representations of a graph in $\mathbb{R}^2$

In this paper, we study orthogonal representations of simple graphs $G$ in $\mathbb{R}^d$ from an algebraic perspective in case $d = 2$. Orthogonal representations of graphs, introduced by Lovász, are maps from the vertex set to $\mathbb{R}^d$ where non-adjacent vertices are sent to orthogonal vectors. We exhibit algebraic properties of the ideal generated by the equations expressing this condition and deduce geometric properties of the variety of orthogonal embeddings for $d=2$ and $\mathbb{R}$ replaced by an arbitrary field. In particular, we classify when the ideal is radical and provide a reduced primary decomposition if $\sqrt{-1} \not\in K$. This leads to a description of the variety of orthogonal embeddings as a union of varieties defined by prime ideals. In particular, this applies to the motivating case $K = \mathbb{R}$.

math.AC↗
arXiv2014

The coordinate ring of a simple polyomino

In this paper it is shown that a polyomino is balanced if and only if it is simple. As a consequence one obtains that the coordinate ring of a simple polyomino is a normal Cohen-Macaulay domain.

math.AC↗
arXiv2014

Pseudo-Gorenstein and level Hibi rings

We introduce pseudo-Gorenstein rings and characterize those Hibi rings attached to a finite distributive lattice L which are pseudo-Gorenstein. The characterization is given in terms of the poset of join-irreducible elements of L. We also present a necessary condition for Hibi rings to be level. Special attention is given to planar and hyper-planar lattices. Finally the pseudo-Goresntein and level property of Hibi rings and generalized Hibi rings is compared with each other.

math.AC↗
arXiv2014

The edge ideals of complete multipartite hypergraphs

We classify all complete uniform multipartite hypergraphs with respect to some algebraic properties, such as being (almost) complete intersection, Gorenstein, level, $l$-Cohen-Macaulay, $l$-Buchsbaum, unmixed, and satisfying Serre's condition $S_r$, via some combinatorial terms. Also, we prove that for a complete $s$-uniform $t$-partite hypergraph $H$, vertex decomposability, shellability, sequentially $S_r$ and sequentially Cohen-Macaulay properties coincide with the condition that $H$ has $t-1$ sides consisting of a single vertex. Moreover, we show that the latter condition occurs if and only if it is a chordal hypergraph.

math.CO↗
arXiv2014

Binomial edge ideals with pure resolutions

We characterize all graphs whose binomial edge ideals have pure resolutions. Moreover, we introduce a new switching of graphs which does not change some algebraic invariants of graphs, and using this, we study the linear strand of the binomial edge ideals for some classes of graphs. Also, we pose a conjecture on the linear strand of such ideals for every graph.

math.CO↗
arXiv2013

The regularity of binomial edge ideals of graphs

We prove two recent conjectures on some upper bounds for the Castelnuovo-Mumford regularity of the binomial edge ideals of some different classes of graphs. We prove the conjecture of Matsuda and Murai for graphs which has a cut edge or a simplicial vertex, and hence for chordal graphs. We determine the regularity of the binomial edge ideal of the join of graphs in terms of the regularity of the original graphs, and consequently prove the conjecture of Matsuda and Murai for such a graph, and hence for complete $t$-partite graphs. We also generalize some results of Schenzel and Zafar about complete $t$-partite graphs. We also prove the conjecture due to the authors for a class of chordal graphs.

math.AC↗