Searcharxiv⌕ Search

arXiv subjects

Takayuki Hibi

Publications and source records attributed to Takayuki Hibi.

At least 127 records · Page 7Linked to original sources
arXiv2015

Dominating induced matchings of finite graphs and regularity of edge ideals

The regularity of an edge ideal of a finite simple graph $G$ is at least the induced matching number of $G$ and is at most the minimum matching number of $G$. If $G$ possesses a dominating inuduced matching, i.e., an induced matching which forms a maximal matching, then the induced matching number of $G$ is equal to the minimum matching number of $G$. In the present paper, from viewpoints of both combinatorics and commutative algebra, finite simple graphs with dominating induced matchings will be mainly studied.

math.CO↗
arXiv2015

Nonsimple polyominoes and prime ideals

It is known that the polyomino ideal of a simple polyomino is a prime ideal. A new class of nonsimple polyominoes $\Pc$ for which the polyomino ideal $I_{\Pc}$ is a prime ideal will be presented.

math.AC↗
arXiv2015

Gorenstein Fano polytopes arising from order polytopes and chain polytopes

Richard Stanley introduced the order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$ arising from a finite partially ordered set $P$, and showed that the Ehrhart polynomial of $\mathcal{O}(P)$ is equal to that of $\mathcal{C}(P)$. In addition, the unimodular equivalence problem of $\mathcal{O}(P)$ and $\mathcal{C}(P)$ was studied by the first author and Nan Li. In the present paper, three integral convex polytopes $Γ(\mathcal{O}(P), -\mathcal{O}(Q))$, $Γ(\mathcal{O}(P), -\mathcal{C}(Q))$ and $Γ(\mathcal{C}(P), -\mathcal{C}(Q))$, where $P$ and $Q$ are partially ordered sets with $| P | = | Q |$, will be studied. First, it will be shown that the Ehrhart polynomial of $Γ(\mathcal{O}(P), -\mathcal{C}(Q))$ coincides with that of $Γ(\mathcal{C}(P), -\mathcal{C}(Q))$. Furthermore, when $P$ and $Q$ possess a common linear extension, it will be proved that these three convex polytopes have the same Ehrhart polynomial. Second, the problem of characterizing partially ordered sets $P$ and $Q$ for which $Γ(\mathcal{O}(P), -\mathcal{O}(Q))$ or $Γ(\mathcal{O}(P), -\mathcal{C}(Q))$ or $Γ(\mathcal{C}(P), -\mathcal{C}(Q))$ is a smooth Fano polytope will be solved. Finally, when these three polytopes are smooth Fano polytopes, the unimodular equivalence problem of these three polytopes will be discussed.

math.CO↗
arXiv2015

Quadratic Gröbner bases of twinned order polytopes

Let $P$ and $Q$ be finite partially ordered sets on $[d] = \{1, \ldots, d\}$, and $\mathcal{O}(P) \subset \mathbb{R}^{d}$ and $\mathcal{O}(Q) \subset \mathbb{R}^{d}$ their order polytopes. The twinned order polytope of $P$ and $Q$ is the convex polytope $Δ(P,-Q) \subset \mathbb{R}^{d}$ which is the convex hull of $\mathcal{O}(P) \cup (- \mathcal{O}(Q))$. It follows that the origin of $\mathbb{R}^{d}$ belongs to the interior of $Δ(P,-Q)$ if and only if $P$ and $Q$ possess a common linear extension. It will be proved that, when the origin of $\mathbb{R}^{d}$ belongs to the interior of $Δ(P,-Q)$, the toric ideal of $Δ(P,-Q)$ possesses a quadratic Gröbner basis with respect to a reverse lexicographic order for which the variable corresponding to the origin is smallest. Thus in particular if $P$ and $Q$ possess a common linear extension, then the twinned order polytope $Δ(P,-Q)$ is a normal Gorenstein Fano polytope.

math.AC↗
arXiv2015

Centrally symmetric configurations of order polytopes

It is shown that the toric ideal of the centrally symmetric configuration of the order polytope of a finite partially ordered set possesses a squarefree quadratic initial ideal. It then follows that the convex polytope arising from the centrally symmetric configuration of an order polytope is a normal Gorenstein Fano polytope.

math.AC↗
arXiv2015

Markov chain Monte Carlo methods for the Box-Behnken designs and centrally symmetric configurations

We consider Markov chain Monte Carlo methods for calculating conditional p values of statistical models for count data arising in Box-Behnken designs. The statistical model we consider is a discrete version of the first-order model in the response surface methodology. For our models, the Markov basis, a key notion to construct a connected Markov chain on a given sample space, is characterized as generators of the toric ideals for the centrally symmetric configurations of root system D_n. We show the structure of the Groebner bases for these cases. A numerical example for an imaginary data set is given.

math.ST↗
arXiv2014

Simplicial complexes of whisker type

Let $I\subset K[x_1,\ldots,x_n]$ be a zero-dimensional monomial ideal, and $Δ(I)$ be the simplicial complex whose Stanley--Reisner ideal is the polarization of $I$. It follows from a result of Soleyman Jahan that $Δ(I)$ is shellable. We give a new short proof of this fact by providing an explicit shelling. Moreover, we show that $Δ(I)$ is even vertex decomposable. The ideal $L(I)$, which is defined to be the Stanley--Reisner ideal of the Alexander dual of $Δ(I)$, has a linear resolution which is cellular and supported on a regular CW-complex. All powers of $L(I)$ have a linear resolution. We compute $\mathrm{depth}\ L(I)^k$ and show that $\mathrm{depth}\ L(I)^k=n$ for all $k\geq n$.

math.AC↗
arXiv2014

The face ideal of a simplicial complex

Given a simplicial complex we associate to it a squarefree monomial ideal which we call the face ideal of the simplicial complex, and show that it has linear quotients. It turns out that its Alexander dual is a whisker complex. We apply this construction in particular to chain and antichain ideals of a finite partially ordered set. We also introduce so-called higher dimensional whisker complexes and show that their independence complexes are shellable.

math.AC↗
arXiv2014

Integer decomposition property of free sums of convex polytopes

Let $\mathcal{P} \subset \mathbb{R}^{d}$ and $\mathcal{Q} \subset \mathbb{R}^e$ be integral convex polytopes of dimension $d$ and $e$ which contain the origin of $\mathbb{R}^{d}$ and $\mathbb{R}^e$, respectively. In the present paper, under some assumptions, the necessary and sufficient condition for the free sum of $\mathcal{P}$ and $\mathcal{Q}$ to possess the integer decomposition property will be presented.

math.CO↗
arXiv2014

The face vector of a half-open hypersimplex

The half-open hypersimplex $Δ'_{n,k}$ consists of those $x = (x_{1}, \ldots, x_{n}) \in[0,1]^n$ with $k-1<x_1+\cdots+x_n\le k$, where $0 < k \leq n$. The $f$-vector of a half-open hypersimplex and related generating functions are explicitly studied.

math.CO↗
arXiv2014

Algebraic study on Cameron-Walker graphs

Let $G$ be a finite simple graph on $[n]$ and $I(G) \subset S$ the edge ideal of $G$, where $S = K[x_{1}, \ldots, x_{n}]$ is the polynomial ring over a field $K$. Let $m(G)$ denote the maximum size of matchings of $G$ and $im(G)$ that of induced matchings of $G$. It is known that $im(G) \leq \text{reg}(S/I(G)) \leq m(G)$, where $\text{reg}(S/I(G))$ is the Castelnuovo-Mumford regularity of $S/I(G)$. Cameron and Walker succeeded in classifying the finite connected simple graphs $G$ with $im(G) = m(G)$. We say that a finite connected simple graph $G$ is a Cameron-Walker graph if $im(G) = m(G)$ and if $G$ is neither a star nor a star triangle. In the present paper, we study Cameron-Walker graphs from a viewpoint of commutative algebra. First, we prove that a Cameron-Walker graph $G$ is unmixed if and only if $G$ is Cohen-Macaulay and classify all Cohen-Macaulay Cameron-Walker graphs. Second, we prove that there is no Gorenstein Cameron-Walker graph. Finally, we prove that every Cameron--Walker graph is sequentially Cohen-Macaulay.

math.AC↗
arXiv2014

Pfaffian Systems of A-Hypergeometric Equations I: Bases of Twisted Cohomology Groups

This is the third revision. We study bases of Pfaffian systems for $A$-hypergeometric system. Gröbner deformations give bases. These bases also give those for twisted cohomology groups. For hypergeometric system associated to a class of order polytopes, these bases have a combinatorial description. The size of the bases associated to a subclass of the order polytopes have the growth rate of the polynomial order. Bases associated to two chain posets and bouquets are studied.

math.CA↗
arXiv2014

Pseudo-Gorenstein and level Hibi rings

We introduce pseudo-Gorenstein rings and characterize those Hibi rings attached to a finite distributive lattice L which are pseudo-Gorenstein. The characterization is given in terms of the poset of join-irreducible elements of L. We also present a necessary condition for Hibi rings to be level. Special attention is given to planar and hyper-planar lattices. Finally the pseudo-Goresntein and level property of Hibi rings and generalized Hibi rings is compared with each other.

math.AC↗
arXiv2014

Linearly related polyominoes

We classify all convex polyomino ideals which are linearly related or have a linear resolution. Convex stack polyominoes whose ideals are extremal Gorenstein are also classified. In addition, we characterize, in combinatorial terms, the distributive lattices whose join-meet ideals are extremal Gorenstein or have a linear resolution.

math.AC↗
arXiv2014

Cutting convex polytopes by hyperplanes

Cutting a polytope is a very natural way to produce new classes of interesting polytopes. Moreover, it has been very enlightening to explore which algebraic and combinatorial properties of the orignial polytope are hereditary to its subpolytopes obtained by a cut. In this work, we put our attention to all the seperating hyperplanes for some given polytope (integral and convex) and study the existence and classification of such hyperplanes. We prove the exitence of seperating hyperplanes for the order and chain polytopes for any finite posets that are not a single chain; prove there are no such hyperplanes for any Birkhoff polytopes. Moreover, we give a complete seperating hyperplane classification for the unit cube and its subpolytopes obtained by one cut, together with some partial classification results for order and chain polytopes.

math.CO↗
arXiv2014

Strongly Koszul edge rings

We classify the finite connected simple graphs whose edge rings are strongly Koszul. From the classification, it follows that if the edge ring is strongly Koszul, then its toric ideal possesses a quadratic Gröbner basis.

math.AC↗
arXiv2013

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.

math.CO↗