Related papers: Nearly Gorenstein Polytopes
We show that the polytopes obtained from the Birkhoff polytope by imposing additional inequalities restricting the "longest increasing subsequence" have Ehrhart quasi-polynomials which are honest polynomials, even though they are just…
A matroid is Gorenstein if its toric variety is. Hibi, Laso\'n, Matsuda, Micha\l{}ek, and Vodi\v{c}ka provided a full graph-theoretic classification of Gorenstein matroids associated to simple graphs. We extend this classification to…
The purpose of this paper is, as part of the stratification of Cohen-Macaulay rings, to investigate the question of when the fiber products are almost Gorenstein rings. We show that the fiber product $R \times_T S$ of Cohen-Macaulay local…
In this paper, we state criteria of a Hibi ring to be level, non-Gorenstein and almost Gorenstein and to be non-level and almost Gorenstein in terms of the structure of the partially ordered set defining the Hibi ring. We also state a…
In this paper, we introduce and study the rings of Gorenstein homological dimensions small or equal than 1, which we call Gorenstein (semi)hereditary rings, specially particular cases of these rings, which we call strongly Gorenstein…
In 1983 Kustin and Miller introduced a construction of Gorenstein ideals in local Gorenstein rings, starting from smaller such ideals. We review and modify their construction in the case of graded rings and discuss it within the framework…
The Ehrhart quasipolynomial of a rational polytope $\mathsf{P}$ encodes fundamental arithmetic data of $\mathsf{P}$, namely, the number of integer lattice points in positive integral dilates of $\mathsf{P}$. Ehrhart quasipolynomials were…
To classify the lattice polytopes with a given $\delta$-polynomial is an important open problem in Ehrhart theory. A complete classification of the Gorenstein simplices whose normalized volumes are prime integers is known. In particular,…
A half-integral polygon with quasi-period collapse behaves similarly to a lattice polygon in the sense that the number of lattice points in its integer dilates can be calculated as values of a polynomial, its Ehrhart polynomial. As a main…
Starting with a commutative ring $R$ and an ideal $I$, it is possible to define a family of rings $R(I)_{a,b}$, with $a,b \in R$, as quotients of the Rees algebra $\oplus_{n \geq 0} I^nt^n$; among the rings appearing in this family we find…
The h^*-polynomial of a lattice polytope is the numerator of the generating function of the Ehrhart polynomial. Let P be a lattice polytope with h^*-polynomial of degree d and with linear coefficient h^*_1. We show that P has to be a…
Fix two lattice paths $P$ and $Q$ from $(0,0)$ to $(m,r)$ that use East and North steps with $P $ never going above $Q$. Bonin et al. show that the lattice paths that go from $(0,0)$ to $(m,r)$ and remain bounded by $P$ and $Q$ can be…
In this paper we investigate the number of integer points lying in dilations of lattice path matroid polytopes. We give a characterization of such points as polygonal paths in the diagram of the lattice path matroid. Furthermore, we prove…
We study the perfect matching lattice of a matching covered graph $G$, generated by the incidence vectors of its perfect matchings. Building on results of Lov\'asz and de Carvalho, Lucchesi, and Murty, we give a polynomial-time algorithm…
Reflexive polytopes form one of the distinguished classes of lattice polytopes. Especially reflexive polytopes which possess the integer decomposition property are of interest. In the present paper, by virtue of the algebraic technique on…
One of the main results of this paper is the characterization of the rings over which all modules are strongly Gorenstein projective. We show that these kinds of rings are very particular cases of the well-known quasi-Frobenius rings. We…
We present an algorithm for growing the denominator $r$ polygons containing a fixed number of lattice points and enumerate such polygons containing few lattice points for small $r$. We describe the Ehrhart quasi-polynomial of a rational…
Let $G$ be a finite graph allowing loops, having no multiple edge and no isolated vertex. We associate $G$ with the edge polytope ${\cal P}_G$ and the toric ideal $I_G$. By classifying graphs whose edge polytope is simple, it is proved that…
A lattice polytope is called spanning if its lattice points affinely span the ambient lattice. We show as a corollary to a general result in the Ehrhart theory of lattice polytopes that the $h^*$-vector of a spanning lattice polytope has no…
The paper is devoted to perfect and almost perfect homogeneous polytopes in Euclidean spaces. We classified perfect and almost perfect polytopes among all regular polytopes and all semiregular polytopes excepting Archimedean solids and two…