Searcharxiv⌕ Search

arXiv subjects

Takayuki Hibi

Publications and source records attributed to Takayuki Hibi.

At least 109 records · Page 6Linked to original sources

Regularity and $h$-polynomials of monomial ideals

Let $S = K[x_1, \ldots, x_n]$ denote the polynomial ring in $n$ variables over a field $K$ with each $°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$. It is known that, when $S/I$ is Cohen--Macaulay, one has $\reg(S/I) = °h_{S/I}(λ)$, where $\reg(S/I)$ is the (Castelnuovo--Mumford) regularity of $S/I$. In the present paper, given arbitrary integers $r$ and $s$ with $r \geq 1$ and $s \geq 1$, a monomial ideal $I$ of $S = K[x_1, \ldots, x_n]$ with $n \gg 0$ for which $\reg(S/I) = r$ and $°h_{S/I}(λ) = s$ will be constructed. Furthermore, we give a class of edge ideals $I \subset S$ of Cameron--Walker graphs with $\reg(S/I) = °h_{S/I}(λ)$ for which $S/I$ is not Cohen--Macaulay.

math.AC↗

Laplacian Simplices Associated to Digraphs

We associate to a finite digraph $D$ a lattice polytope $P_D$ whose vertices are the rows of the Laplacian matrix of $D$. This generalizes a construction introduced by Braun and the third author. As a consequence of the Matrix-Tree Theorem, we show that the normalized volume of $P_D$ equals the complexity of $D$, and $P_D$ contains the origin in its relative interior if and only if $D$ is strongly connected. Interesting connections with other families of simplices are established and then used to describe reflexivity, $h^*$-polynomial, and integer decomposition property of $P_D$ in these cases. We extend Braun and Meyer's study of cycles by considering cycle digraphs. In this setting we characterize reflexivity and show there are only four non-trivial reflexive Laplacian simplices having the integer decomposition property.

math.CO↗

Self dual reflexive simplices with Eulerian polynomials

A lattice polytope $\mathcal{P}$ is called reflexive if its dual $\mathcal{P}^\vee$ is a lattice polytope. The property that $\mathcal{P}$ is unimodularly equivalent to $\mathcal{P}^\vee$ does not hold in general, and in fact there are few examples of such polytopes. In this note, we introduce a new reflexive simplex $Q_n$ which has this property. Additionally, we show that $δ$-polynomalial of $Q_n$ is the Eulerian polynomial and show the existence of a regular, flag, unimodular triangulation.

math.CO↗

Facets and volume of Gorenstein Fano polytopes

It is known that every integral convex polytope is unimodularly equivalent to a face of some Gorenstein Fano polytope. It is then reasonable to ask whether every normal polytope is unimodularly equivalent to a face of some normal Gorenstein Fano polytope. In the present paper, it is shown that, by giving new classes of normal Gorenstein Fano polytopes, each order polytope as well as each chain polytope of dimension $d$ is unimodularly equivalent to a facet of some normal Gorenstein Fano polytopes of dimension $d + 1$. Furthermore, investigation on combinatorial properties, especially, Ehrhart polynomials and volume of these new polytopes will be achieved. Finally, some curious examples of Gorenstein Fano polytopes will be discovered.

math.CO↗

Flat $δ$-vectors and their Ehrhart polynomials

We call the $δ$-vector of an integral convex polytope of dimension $d$ flat if the $δ$-vector is of the form $(1,0,\ldots,0,a,\ldots,a,0,\ldots,0)$, where $a \geq 1$. In this paper, we give the complete characterization of possible flat $δ$-vectors. Moreover, for an integral convex polytope $\mathcal{P} \subset \mathbb{R}^N$ of dimension $d$, we let $i(\mathcal{P},n)=|n\mathcal{P} \cap \mathbb{Z}^N|$ and $\ i^*(\mathcal{P},n)=|n(\mathcal{P} \setminus \partial \mathcal{P}) \cap \mathbb{Z}^N|.$ By this characterization, we show that for any $d \geq 1$ and for any $k,\ell \geq 0$ with $k+\ell \leq d-1$, there exist integral convex polytopes $\mathcal{P}$ and $\mathcal{Q}$ of dimension $d$ such that (i) For $t=1,\ldots,k$, we have $i(\mathcal{P},t)=i(\mathcal{Q},t),$ (ii) For $t=1,\ldots,\ell$, we have $i^*(\mathcal{P},t)=i^*(\mathcal{Q},t)$ and (iii) $i(\mathcal{P},k+1) \neq i(\mathcal{Q},k+1)$ and $i^*(\mathcal{P},\ell+1)\neq i^*(\mathcal{Q},\ell+1).$

math.CO↗

Markov bases for two-way change-point models of ladder determinantal tables

To evaluate a fitting of a statistical model to given data, calculating a conditional $p$ value by a Markov chain Monte Carlo method is one of the effective approaches. For this purpose, a Markov basis plays an important role because it guarantees the connectivity of the chain for unbiasedness of the estimation, and therefore is investigated in various settings such as incomplete tables or subtable sum constraints. In this paper, we consider the two-way change-point model for the ladder determinantal table, which is an extension of these two previous works. Our main result is based on the theory of Groebner basis for the distributive lattice. We give a numerical example for actual data.

stat.ME↗

Ehrhart series of fractional stable set polytopes of finite graphs

The fractional stable set polytope ${\rm FRAC}(G)$ of a simple graph $G$ with $d$ vertices is a rational polytope that is the set of nonnegative vectors $(x_1,\ldots,x_d)$ satisfying $x_i+x_j\le 1$ for every edge $(i,j)$ of $G$. In this paper we show that (i) The $δ$-vector of a lattice polytope $2 {\rm FRAC}(G)$ is alternatingly increasing; (ii) The Ehrhart ring of ${\rm FRAC}(G)$ is Gorenstein; (iii) The coefficients of the numerator of the Ehrhart series of ${\rm FRAC}(G)$ are symmetric, unimodal and computed by the $δ$-vector of $2 {\rm FRAC}(G)$.

math.CO↗

The numbers of edges of the order polytope and the chain poyltope of a finite partially ordered set

Let $P$ be an arbitrary finite partially ordered set. It will be proved that the number of edges of the order polytope ${\mathcal O}(P)$ is equal to that of the chain polytope ${\mathcal C}(P)$. Furthermore, it will be shown that the degree sequence of the finite simple graph which is the $1$-skeleton of ${\mathcal O}(P)$ is equal to that of ${\mathcal C}(P)$ if and only if ${\mathcal O}(P)$ and ${\mathcal C}(P)$ are unimodularly equivalent.

math.CO↗

Gorenstein properties and integer decomposition properties of lecture hall polytopes

Though much is known about ${\bf s}$-lecture hall polytopes, there are still many unanswered questions. In this paper, we show that ${\bf s}$-lecture hall polytopes satisfy the integer decomposition property (IDP) in the case of monotonic ${\bf s}$-sequences. Given restrictions on a monotonic ${\bf s}$-sequence, we discuss necessary and sufficient conditions for the Fano, reflexive and Gorenstein properties. Additionally, we give a construction for producing Gorenstein/IDP lecture hall polytopes.

math.CO↗

Order-Chain Polytopes

Given two families $X$ and $Y$ of integral polytopes with nice combinatorial and algebraic properties, a natural way to generate new class of polytopes is to take the intersection $\mathcal{P}=\mathcal{P}_1\cap\mathcal{P}_2$, where $\mathcal{P}_1\in X$, $\mathcal{P}_2\in Y$. Two basic questions then arise: 1) when $\mathcal{P}$ is integral and 2) whether $\mathcal{P}$ inherits the "old type" from $\mathcal{P}_1, \mathcal{P}_2$ or has a "new type", that is, whether $\mathcal{P}$ is unimodularly equivalent to some polytope in $X\cup Y$ or not. In this paper, we focus on the families of order polytopes and chain polytopes and create a new class of polytopes following the above framework, which are named order-chain polytopes. In the study on their volumes, we discover a natural relation with Ehrenborg and Mahajan's results on maximizing descent statistics.

math.CO↗

A Gröbner basis characterization for chordal comparability graphs

In this paper, we study toric ideals associated with multichains of posets. It is shown that the comparability graph of a poset is chordal if and only if there exists a quadratic Gröbner basis of the toric ideal of the poset. Strong perfect elimination orderings of strongly chordal graphs play an important role.

math.CO↗

Ehrhart polynomials with negative coefficients

It is shown that, for each $d \geq 4$, there exists an integral convex polytope $\mathcal{P}$ of dimension $d$ such that each of the coefficients of $n, n^{2}, \ldots, n^{d-2}$ of its Ehrhart polynomial $i(\mathcal{P},n)$ is negative. Moreover, it is also shown that for each $d \geq 3$ and $1 \leq k \leq d-2$, there exists an integral convex polytope $\mathcal{P}$ of dimension $d$ such that the coefficient of $n^k$ of the Ehrhart polynomial $i(\mathcal{P},n)$ of $\mathcal{P}$ is negative and all its remaining coefficients are positive. Finally, we consider all the possible sign patterns of the coefficients of the Ehrhart polynomials of low dimensional integral convex polytopes.

math.CO↗

Depth stability of edge ideals

Let $G$ be a connected finite simple graph and let $I_G$ be the edge ideal of $G$. The smallest number $k$ for which $\depth S/I_G^k$ stabilizes is denoted by $\dstab(I_G)$. We show that $\dstab(I_G)<\ell(I_G)$ where $\ell(I_G)$ denotes the analytic spread of $I$. For trees we give a stronger upper bound for $\dstab(I_G)$. We also show for any two integers $1\leq a<b$ there exists a tree for which $\dstab(I_G)=a$ and $\ell(I_G)=b$.

math.AC↗

The number of edges of the edge polytope of a finite simple graph

Let $d \geq 3$ be an integer. It is known that the number of edges of the edge polytope of the complete graph with $d$ vertices is $d(d-1)(d-2)/2$. In this paper, we study the maximum possible number $μ_d$ of edges of the edge polytope arising from finite simple graphs with $d$ vertices. We show that $μ_{d}=d(d-1)(d-2)/2$ if and only if $3 \leq d \leq 14$. In addition, we study the asymptotic behavior of $μ_d$. Tran--Ziegler gave a lower bound for $μ_d$ by constructing a random graph. We succeeded in improving this bound by constructing both a non-random graph and a random graph whose complement is bipartite.

math.CO↗

Isotonian Algebras

To a pair $P$ and $Q$ of finite posets we attach the toric ring $K[P,Q]$ whose generators are in bijection to the isotone maps from $P$ to $Q$. This class of algebras, called isotonian, are natural generalizations of the so-called Hibi rings. We determine the Krull dimension of these algebras and for particular classes of posets $P$ and $Q$ we show that $K[P,Q]$ is normal and that their defining ideal admits a quadratic Gröbner basis.

math.AC↗

Quadratic Gröbner bases arising from partially ordered sets

The order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$ associated to a partially ordered set $P$ are studied. In this paper, we introduce the convex polytope $Γ(\mathcal{O}(P), -\mathcal{C}(Q))$ which is the convex hull of $\mathcal{O}(P) \cup (-\mathcal{C}(Q))$, where both $P$ and $Q$ are partially ordered sets with $|P|=|Q|=d$. It will be shown that $Γ(\mathcal{O}(P), -\mathcal{C}(Q))$ is a normal and Gorenstein Fano polytope by using the theory of reverse lexicographic squarefree initial ideals of toric ideals.

math.AC↗

Facets of the r-stable n,k-hypersimplex

Let $k, n$ and $r$ be positive integers with $k < n$ and $r\leq\lfloor\frac{n}{k}\rfloor$. We determine the facets of the $r$-stable $n,k$-hypersimplex. As a result, it turns out that the $r$-stable $n,k$-hypersimplex has exactly $2n$ facets for every $r<\lfloor\frac{n}{k}\rfloor$. We then utilize the equations of the facets to study when the $r$-stable hypersimplex is Gorenstein. For every $k>0$ we identify an infinite collection of Gorenstein $r$-stable hypersimplices, consequently expanding the collection of $r$-stable hypersimplices known to have unimodal Ehrhart $δ$-vectors.

math.CO↗