Searcharxiv⌕ Search

arXiv subjects

Fatemeh Mohammadi

Publications and source records attributed to Fatemeh Mohammadi.

87 records · Page 5Linked to original sources
arXiv2017

Prime splittings of Determinantal Ideals

We consider determinantal ideals, where the generating minors are encoded in a hypergraph. We study when the generating minors form a Gröbner basis. In this case, the ideal is radical, and we can describe algebraic and numerical invariants of these ideals in terms of combinatorial data of their hypergraphs, such as the clique decomposition. In particular, we can construct a minimal free resolution as a tensor product of the minimal free resolution of their cliques. For several classes of hypergraphs we find a combinatorial description of the minimal primes in terms of a prime splitting. That is, we write the determinantal ideal as a sum of smaller determinantal ideals such that each minimal prime is a sum of minimal primes of the summands.

math.AC↗
arXiv2016

The algebraic method in tree percolation

We apply the methods of algebraic reliability to the study of percolation on trees. To a complete $k$-ary tree $T_{k,n}$ of depth $n$ we assign a monomial ideal $I_{k,n}$ on $\sum_{i=1}^n k^i$ variables and $k^n$ minimal monomial generators. We give explicit recursive formulae for the Betti numbers of $I_{k,n}$ and their Hilbert series, which allow us to study explicitly percolation on $T_{k,n}$. We study bounds on this percolation and study its asymptotical behavior with the mentioned commutative algebra techniques.

math.CO↗
arXiv2015

Divisors on graphs, binomial and monomial ideals, and cellular resolutions

We study various binomial and monomial ideals arising in the theory of divisors, orientations, and matroids on graphs. We use ideas from potential theory on graphs and from the theory of Delaunay decompositions for lattices to describe their minimal polyhedral cellular free resolutions. We show that the resolutions of all these ideals are closely related and that their $\mathbb{Z}$-graded Betti tables coincide. As corollaries, we give conceptual proofs of conjectures and questions posed by Postnikov and Shapiro, by Manjunath and Sturmfels, and by Perkinson, Perlman, and Wilmes. Various other results related to the theory of chip-firing games on graphs also follow from our general techniques and results.

math.CO↗
arXiv2015

Types of signature analysis in reliability based on Hilbert series

The present paper studies multiple failure and signature analysis of coherent systems using the theory of monomial ideals. While system reliability has been studied using Hilbert series of monomial ideals, this is not enough to understand in a deeper sense the ideal structure features that reflect the behavior of the system under multiple simultaneous failures and signature. Therefore, we introduce the lcm-filtration of a monomial ideal, and we study the Hilbert series and resolutions of the corresponding ideals. Given a monomial ideal, we explicitly compute the resolutions for all ideals in the associated lcm-filtration, and we apply this to study coherent systems. Some computational results are shown in examples to demonstrate the usefulness of this approach and the computational issues that arise. We also study the failure distribution from a statistical point of view by means of the algebraic tools described.

math.AC↗
arXiv2015

Divisors on graphs, orientations, syzygies, and system reliability

We study various ideals arising in the theory of system reliability. We use ideas from the theory of divisors, orientations and matroids on graphs to describe the minimal polyhedral cellular free resolutions of these ideals. In each case we give an explicit combinatorial description of the minimal generating set for each higher syzygy module in terms of the acyclic orientations of the graph, the $q$-reduced divisors and the bounded regions of the graphic hyperplane arrangement. The resolutions of all these ideals are closely related, and their Betti numbers are independent of the characteristic of the base field. We apply these results to compute the reliability of their associated coherent systems.

math.CO↗
arXiv2015

On the Orlik--Terao ideal and the relation space of a hyperplane arrangement

The relation space of a hyperplane arrangement is the vector space of all linear dependencies among the defining forms of the hyperplanes in the arrangement. In this paper, we study the relationship between the relation space and the Orlik--Terao ideal of an arrangement. In particular, we characterize spanning sets of the relation space in terms of the Orlik--Terao ideal. This result generalizes a characterization of 2-formal arrangements due to Schenck and Tohǎneanu \cite[Theorem 2.3]{ST}. We also study the minimal prime ideals of subideals of the Orlik--Terao ideal associated to subsets of the relation space. Finally, we give examples to show that for a 2-formal arrangement, the codimension of the Orlik--Terao ideal is not necessarily equal to that of its subideal generated by the quadratic elements.

math.AC↗
arXiv2014

A Family of Quasisymmetry Models

We present a one-parameter family of models for square contingency tables that interpolates between the classical quasisymmetry model and its Pearsonian analogue. Algebraically, this corresponds to deformations of toric ideals associated with graphs. Our discussion of the statistical issues centers around maximum likelihood estimation.

math.ST↗
arXiv2013

Cellular resolutions from mapping cones

One can iteratively obtain a free resolution of any monomial ideal $I$ by considering the mapping cone of the map of complexes associated to adding one generator at a time. Herzog and Takayama have shown that this procedure yields a minimal resolution if $I$ has linear quotients, in which case the mapping cone in each step cones a Koszul complex onto the previously constructed resolution. Here we consider cellular realizations of these resolutions. Extending a construction of Mermin we describe a regular CW-complex that supports the resolutions of Herzog and Takayama in the case that $I$ has a `regular decomposition function'. By varying the choice of chain map we recover other known cellular resolutions, including the `box of complexes' resolutions of Corso, Nagel, and Reiner and the related `homomorphism complex' resolutions of Dochtermann and Engström. Other choices yield combinatorially distinct complexes with interesting structure, and suggests a notion of a `space of cellular resolutions'.

math.AC↗
arXiv2013

Divisors on graphs, Connected flags, and Syzygies

We study the binomial and monomial ideals arising from linear equivalence of divisors on graphs from the point of view of Gröbner theory. We give an explicit description of a minimal Gröbner bases for each higher syzygy module. In each case the given minimal Gröbner bases is also a minimal generating set. The Betti numbers of the binomial ideal and its natural initial ideal coincide and they correspond to the number of 'connected flags' in the graph. In particular the Betti numbers are independent of the characteristic of the base field. For complete graphs the problem was previously studied by Postnikov and Shapiro and by Manjunath and Sturmfels. The case of a general graph was stated as an open problem.

math.CO↗
arXiv2012

Determinantal Facet Ideals

We consider ideals generated by general sets of $m$-minors of an $m\times n$-matrix of indeterminates. The generators are identified with the facets of an $(m-1)$-dimensional pure simplicial complex. The ideal generated by the minors corresponding to the facets of such a complex is called a determinantal facet ideal. Given a pure simplicial complex $Δ$, we discuss the question when the generating minors of its determinantal facet ideal $J_Δ$ form a Gröbner basis and when $J_Δ$ is a prime ideal.

math.AC↗
arXiv2010

Monomial ideals and toric rings of Hibi type arising from a finite poset

In this paper we study monomial ideals attached to posets, introduce generalized Hibi rings and investigate their algebraic and homological properties. The main tools to study these objects are Groebner basis theory, the concept of sortability due to Sturmfels and the theory of weakly polymatroidal ideals.

math.AC↗
arXiv2009

Resolution of Unmixed Bipartite Graphs

For an unmixed bipartite graph $G$ we consider the lattice of vertex covers $\mathcal{L}_G$ and compute depth, projective dimension and extremal Betti-numbers of $R/I(G)$ in terms of this lattice.

math.AC↗
arXiv2009

Poincaré series of some hypergraph algebras

A hypergraph $H=(V,E)$, where $V=\{x_1,...,x_n\}$ and $E\subseteq 2^V$ defines a hypergraph algebra $R_H=k[x_1,...,x_n]/(x_{i_1}... x_{i_k}; \{i_1,...,i_k\}\in E)$. All our hypergraphs are $d$-uniform, i.e., $|e_i|=d$ for all $e_i\in E$. We determine the Poincaré series $P_{R_H}(t)=\sum_{i=1}^\infty\dim_k{\rm Tor}_i^{R_H}(k,k)t^i$ for some hypergraphs generalizing lines, cycles, and stars. We finish by calculating the graded Betti numbers and the Poincaré series of the graph algebra of the wheel graph.

math.AC↗
arXiv2008

Some algebraic properties of hypergraphs

We consider Stanley--Reisner rings $k[x_1,...,x_n]/I(\mc{H})$ where $I(\mc{H})$ is the edge ideal associated to some particular classes of hypergraphs. For instance, we consider hypergraphs that are natural generalizations of graphs that are lines and cycles, and for these we compute the Betti numbers. We also generalize upon some known results about chordal graphs and study a weak form of shellability.

math.AC↗