Searcharxiv⌕ Search

arXiv subjects

Takayuki Hibi

Publications and source records attributed to Takayuki Hibi.

At least 145 records · Page 8Linked to original sources
arXiv2013

Linear flags and Koszul filtrations

We show that the graded maximal ideal of a graded $K$-algebra $R$ has linear quotients for a suitable choice and order of its generators if the defining ideal of $R$ has a quadratic Gröbner basis with respect to the reverse lexicographic order, and show that this linear quotient property for algebras defined by binomial edge ideals characterizes closed graphs. Furthermore, for algebras defined by binomial edge ideals attached to a closed graph and for join-meet rings attached to a finite distributive lattice we present explicit Koszul filtrations.

math.AC↗
arXiv2013

Koszul binomial edge ideals

It is shown that if the binomial edge ideal of a graph $G$ defines a Koszul algebra, then $G$ must be chordal and claw free. A converse of this statement is proved for a class of chordal and claw free graphs.

math.AC↗
arXiv2013

Bounding the socles of powers of squarefree monomial ideals

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring in $n$ variables over a field $K$ and $I\subset S$ a squarefree monomial ideal. In the present paper we are interested in the monomials $u \in S$ belonging to the socle $\Soc(S/I^{k})$ of $S/I^{k}$, i.e., $u \not\in I^{k}$ and $ux_{i} \in I^{k}$ for $1 \leq i \leq n$. We prove that if a monomial $x_1^{a_1}\cdots x_n^{a_n}$ belongs to $\Soc(S/I^{k})$, then $a_i\leq k-1$ for all $1 \leq i \leq n$. We then discuss squarefree monomial ideals $I \subset S$ for which $x_{[n]}^{k-1} \in \Soc(S/I^{k})$, where $x_{[n]} = x_{1}x_{2}\cdots x_{n}$. Furthermore, we give a combinatorial characterization of finite graphs $G$ on $[n] = \{1, \ldots, n\}$ for which $\depth S/(I_{G})^{2}=0$, where $I_{G}$ is the edge ideal of $G$.

math.AC↗
arXiv2013

Normal cyclic polytopes and cyclic polytopes that are not very ample

Let $d$ and $n$ be positive integers with $n \geq d + 1$ and $τ_{1}, ..., τ_{n}$ integers with $τ_{1} < ... < τ_{n}$. Let $C_{d}(τ_{1}, ..., τ_{n}) \subset \RR^{d}$ denote the cyclic polytope of dimension $d$ with $n$ vertices $(τ_{1},τ_{1}^{2},...,τ_{1}^{d}), ..., (τ_{n},τ_{n}^{2},...,τ_{n}^{d})$. We are interested in finding the smallest integer $γ_{d}$ such that if $τ_{i+1} - τ_{i} \geq γ_{d}$ for $1 \leq i < n$, then $C_{d}(τ_{1}, ..., τ_{n})$ is normal. One of the known results is $γ_{d} \leq d (d + 1)$. In the present paper a new inequality $γ_{d} \leq d^{2} - 1$ is proved. Moreover, it is shown that if $d \geq 4$ with $τ_{3} - τ_{2} = 1$, then $C_{d}(τ_{1}, ..., τ_{n})$ is not very ample.

math.CO↗
arXiv2013

Integer decomposition property of dilated polytopes

Let $\mathcal{P} \subset \mathbb{R}^N$ be an integral convex polytope of dimension $d$ and write $k \mathcal{P}$, where $k = 1, 2, \ldots$, for dilations of $\mathcal{P}$. We say that $\mathcal{P}$ possesses the integer decomposition property if, for any integer $k = 1, 2, \ldots$ and for any $α\in k \mathcal{P} \cap \mathbb{Z}^N$, there exist $α_{1}, \ldots, α_k$ belonging to $\mathcal{P} \cap \mathbb{Z}^N$ such that $α= α_1 + \cdots + α_k$. A fundamental question is to determine the integers $k > 0$ for which the dilated polytope $k\mathcal{P}$ possesses the integer decomposition property. In the present paper, combinatorial invariants related to the integer decomposition property of dilated polytopes will be proposed and studied.

math.CO↗
arXiv2013

Many toric ideals generated by quadratic binomials possess no quadratic Gröbner bases

Let $G$ be a finite connected simple graph and $I_{G}$ the toric ideal of the edge ring $K[G]$ of $G$. In the present paper, we study finite graphs $G$ with the property that $I_{G}$ is generated by quadratic binomials and $I_{G}$ possesses no quadratic Gröbner basis. First, we give a nontrivial infinite series of finite graphs with the above property. Second, we implement a combinatorial characterization for $I_{G}$ to be generated by quadratic binomials and, by means of the computer search, we classify the finite graphs $G$ with the above property, up to 8 vertices.

math.AC↗
arXiv2013

Markov chain Monte Carlo methods for the regular two-level fractional factorial designs and cut ideals

It is known that a Markov basis of the binary graph model of a graph $G$ corresponds to a set of binomial generators of cut ideals $I_{\widehat{G}}$ of the suspension $\widehat{G}$ of $G$. In this paper, we give another application of cut ideals to statistics. We show that a set of binomial generators of cut ideals is a Markov basis of some regular two-level fractional factorial design. As application, we give a Markov basis of degree 2 for designs defined by at most two relations.

math.ST↗
arXiv2012

Chain polytopes and algebras with straightening laws

It will be shown that the toric ring of the chain polytope of a finite partially ordered set is an algebra with straightening laws on a finite distributive lattice. Thus in particular every chain polytope possesses a regular unimodular triangulation arising from a flag complex.

math.AC↗
arXiv2012

Toric ideals and their circuits

In this paper, we study toric ideals generated by circuits. For toric ideals which have squarefree quadratic initial ideals, a sufficient condition to be generated by circuits is given. In particular, squarefree Veronese subrings, the second Veronese subrings and configurations arising from root systems satisfy the condition. In addition, we study toric ideals of finite graphs and characterize the graphs whose toric ideals are generated by circuits u -v such that either u or v is squarefree. There exists several classes of graphs whose toric ideals satisfy this condition and whose toric rings are nonnormal.

math.AC↗
arXiv2012

Separating hyperplanes of edge polytopes

Let $G$ be a finite connected simple graph with $d$ vertices and let $\Pc_G \subset \RR^d$ be the edge polytope of $G$. We call $\Pc_G$ \emph{decomposable} if $\Pc_G$ decomposes into integral polytopes $\Pc_{G^+}$ and $\Pc_{G^-}$ via a hyperplane. In this paper, we explore various aspects of decomposition of $\Pc_G$: we give an algorithm deciding the decomposability of $\Pc_G$, we prove that $\Pc_G$ is normal if and only if both $\Pc_{G^+}$ and $\Pc_{G^-}$ are normal, and we also study how a condition on the toric ideal of $\Pc_G$ (namely, the ideal being generated by quadratic binomials) behaves under decomposition.

math.CO↗
arXiv2012

Determinantal Facet Ideals

We consider ideals generated by general sets of $m$-minors of an $m\times n$-matrix of indeterminates. The generators are identified with the facets of an $(m-1)$-dimensional pure simplicial complex. The ideal generated by the minors corresponding to the facets of such a complex is called a determinantal facet ideal. Given a pure simplicial complex $Δ$, we discuss the question when the generating minors of its determinantal facet ideal $J_Δ$ form a Gröbner basis and when $J_Δ$ is a prime ideal.

math.AC↗
arXiv2012

Toric rings arising from cyclic polytopes

In the present paper, we consider the problem when the toric ring arising from an integral cyclic polytope is Cohen-Macaulay by discussing Serre's condition and we give a complete characterization when that is Gorenstein. Moreover, we study the normality of the other semigroup ring arising from an integral cyclic polytope but generated only with its vertices.

math.AC↗