arXiv subjects
Publications and source records attributed to Takayuki Hibi.
In the frame of a classification of general square systems of polynomial equations solvable by radicals, Esterov and Gusev succeeded in classifying all spanning lattice polytopes whose normalized volumes are at most $4$. In the present paper, we complete to classify all lattice polytopes whose normalized volumes are at most $4$ based on the known classification of their $δ$-polynomials.
The toric variety of a matroid is projectively normal, and therefore it is Cohen-Macaulay. We provide a complete graph-theoretic classification when the toric variety of a graphic matroid is Gorenstein.
The regularity of the Rees ring of the edge ideal of a finite simple graph is studied. We show that the matching number is a lower and matching number~$+1$ is an upper bound of the regularity, if the Rees algebra is normal. In general the induced matching number is a lower bound for the regularity, which can be shown by applying the squarefree divisor complex.
Given arbitrary integers $d$ and $r$ with $d \geq 4$ and $1 \leq r \leq d + 1$, a reflexive polytope $\mathcal{P} \subset \mathbb{R}^d$ of dimension $d$ with ${\rm depth} K[\mathcal{P}] = r$ for which its dual polytope $\mathcal{P}^\vee$ is normal will be constructed, where $K[\mathcal{P}]$ is the toric ring of $\mathcal{P}$.
Lattice polytopes which possess the integer decomposition property (IDP for short) turn up in many fields of mathematics. It is known that if the Cayley sum of lattice polytopes possesses IDP, then so does their Minkowski sum. In this paper, the Cayley sum of the order polytope of a finite poset and the stable set polytope of a finite simple graph is studied. We show that the Cayley sum of an order polytope and the stable set polytope of a perfect graph possesses a regular unimodular triangulation and IDP, and hence so does their Minkowski sum. Moreover, it turns out that, for an order polytope and the stable set polytope of a graph, the following conditions are equivalent: (i) the Cayley sum is Gorenstein; (ii) the Minkowski sum is Gorenstein; (iii) the graph is perfect.
Given integers $r$ and $b$ with $1 \leq b \leq r$, a finite simple connected graph $G$ for which ${\rm reg}(S/I(G)) = r$ and the number of extremal Betti numbers of $S/I(G)$ is equal to $b$ will be constructed.
Let $G$ be a finite simple graph on the vertex set $V(G) = \{x_1, \ldots, x_n\}$ and $I(G) \subset K[V(G)]$ its edge ideal, where $K[V(G)]$ is the polynomial ring in $x_1, \ldots, x_n$ over a field $K$ with each ${\rm deg} x_i = 1$ and where $I(G)$ is generated by those squarefree quadratic monomials $x_ix_j$ for which $\{x_i, x_j\}$ is an edge of $G$. In the present paper, given integers $1 \leq a \leq r$ and $s \geq 1$, the existence of a finite connected simple graph $G = G(a, r, d)$ with ${\rm im}(G) = a$, ${\rm reg}(R/I(G)) = r$ and ${\rm deg} h_{K[V(G)]/I(G)} (λ) = s$, where ${\rm im}(G)$ is the induced matching number of $G$ and where $h_{K[V(G)]/I(G)} (λ)$ is the $h$-polynomial of $K[V(G)]/I(G)$.
We study join-meet ideals associated with modular non-distributive lattices. We give a lower bound for the regularity and show that they are not linearly related.
Let $S$ be the polynomial ring over a field $K$ and $I \subset S$ a homogeneous ideal. Let $h(S/I,λ)$ be the $h$-polynomial of $S/I$ and $s = \mathrm{deg} h(S/I,λ)$ the degree of $h(S/I,λ)$. It follows that the inequality $s - r \leq d - e$, where $r = \mathrm{reg} (S/I)$, $d = \dim S/I$ and $e = \mathrm{depth} S/I$, is satisfied and, in addition, the equality $s - r = d - e$ holds if and only if $S/I$ has a unique extremal Betti number. We are interested in finding a natural class of finite simple graphs $G$ for which $S/I(G)$, where $I(G)$ is the edge ideal of $G$, satisfies $s - r = d - e$. Let $a(S/I(G))$ denote the $a$-invariant of $S/I$, i.e., $a(S/I(G)) = s - d$. One has $a(S/I(G)) \leq 0$. In the present paper, by showing the fundamental fact that every Cameron--Walker graph $G$ satisfies $a(S/I(G)) = 0$, a class of Cameron--Walker graphs $G$ for which $S/I(G)$ satisfies $s - r = d - e$ will be exhibited.
Let $K[\mathcal{O}(P)]$ denote the toric ring of the order polytope $\mathcal{O}(P)$ of a finite partially ordered set $P$ and $K[\mathcal{C}(P)]$ that of the chain polytope $\mathcal{C}(P)$. It will be shown that $β_{p, p+j}(K[\mathcal{O}(P)]) = β_{p, p+j}(K[\mathcal{C}(P)])$ for all $j \geq 0$, where $p$ is the projective dimension of $K[\mathcal{O}(P)]$ (and that of $K[\mathcal{C}(P)]$). In particular, $K[\mathcal{O}(P)]$ is level if and only if $K[\mathcal{C}(P)]$ is level.
For any two integers $d,r \geq 1$, we show that there exists an edge ideal $I(G)$ such that the ${\rm reg}\left(R/I(G)\right)$, the Castelnuovo-Mumford regularity of $R/I(G)$, is $r$, and ${\rm deg} (h_{R/I(G)}(t))$, the degree of the $h$-polynomial of $R/I(G)$, is $d$. Additionally, if $G$ is a graph on $n$ vertices, we show that ${\rm reg}\left(R/I(G)\right) + {\rm deg} (h_{R/I(G)}(t)) \leq n$.
For a finite simple graph $G$ we give an upper bound for the regularity of the powers of the edge ideal $I(G)$.
It is shown that the edge ring of a finite connected simple graph with a $3$-linear resolution is a hypersurface.
Let $S = K[x_1, \ldots, x_n]$ denote the polynomial ring in $n$ variables over a field $K$ with each $\mathrm{deg}\ x_i = 1$ and $I \subset S$ a homogeneous ideal of $S$ with $\dim S/I = d$. The Hilbert series of $S/I$ is of the form $h_{S/I}(λ)/(1 - λ)^d$, where $h_{S/I}(λ) = h_0 + h_1λ+ h_2λ^2 + \cdots + h_sλ^s$ with $h_s \neq 0$ is the $h$-polynomial of $S/I$. Given arbitrary integers $r \geq 1$ and $s \geq 1$, a lexsegment ideal $I$ of $S = K[x_1, \ldots, x_n]$, where $n \leq \max\{r, s\} + 2$, satisfying $\mathrm{reg}(S/I) = r$ and $ \mathrm{deg}\ h_{S/I}(λ) = s$ will be constructed.
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 Grönbner bases, a new class of reflexive polytopes which possess the integer decomposition property and which arise from perfect graphs will be presented. Furthermore, the Ehrhart $δ$-polynomials of these polytopes will be studied.
Reflexive polytopes which have the integer decomposition property are of interest. Recently, some large classes of reflexive polytopes with integer decomposition property coming from the order polytopes and the chain polytopes of finite partially ordered sets are known. In the present paper, we will generalize this result. In fact, by virtue of the algebraic technique on Gröbner bases, new classes of reflexive polytopes with the integer decomposition property coming from the order polytopes of finite partially ordered sets and the stable set polytopes of perfect graphs will be introduced. Furthermore, the result will give a polyhedral characterization of perfect graphs. Finally, we will investigate the Ehrhart $δ$-polynomials of these reflexive polytopes.
Freiman's theorem gives a lower bound for the cardinality of the doubling of a finite set in $\RR^n$. In this paper we give an interpretation of his theorem for monomial ideals and their fiber cones. We call a quasi-equigenerated monomial ideal a Freiman ideal, if the set of its exponent vectors achieves Freiman's lower bound for its doubling. Algebraic characterizations of Freiman ideals are given, and finite simple graphs are classified whose edge ideals or matroidal ideals of its cycle matroids are Freiman ideals.
Given integers $k$ and $m$ with $k \geq 2$ and $m \geq 2$, let $P$ be an empty simplex of dimension $(2k-1)$ whose $δ$-polynomial is of the form $1+(m-1)t^k$. In the present paper, the necessary and sufficient condition for the $k$-th dilation $kP$ of $P$ to have a regular unimodular triangulation will be presented.