11 papers
Regularity and depth of binomial ideals arising from combinatorics
Takayuki Hibi, Seyed Amin Seyed Fakhari
Regularity and depth of binomial ideals generated by adjacent -minors together with those arising from finite lattices are studied.
An algebraic study of ideals of weak graph homomorphisms
Francesco Navarra, Ayesha Asloob Qureshi, Seyed Amin Seyed Fakhari
Let and be finite simple graphs and assume that either both are undirected or both are directed. We introduce and study the ideal of weak graph homomorphisms .…
Depth of edge ideals and vertex connectivity of finite graphs
Takayuki Hibi, Seyed Amin Seyed Fakhari
Let be a finite graph on and its vertex connectivity. Let denote the polynomial ring in variables over a field a…
Modular lattices and algebras with straightening laws
Takayuki Hibi, Seyed Amin Seyed Fakhari
The conjecture that every modular lattice is integral is disproved.
Partially ordered sets of distributive type and algebras with straightening laws
Takayuki Hibi, Seyed Amin Seyed Fakhari
A finite poset (partially ordered set) with is called of distributive type if every interval , , of is a distributive lattice. From a vie…
Bounded powers of edge ideals: Pseudo-Gorenstein and Level polytopes
Takayuki Hibi, Seyed Amin Seyed Fakhari
A lattice polytope of dimension is called level* if (i) is normal, (ii) $(\mathcal{P} \setminus \partial \mathcal{P}) \cap \mat…