Searcharxiv⌕ Search

arXiv subjects

Takayuki Hibi

Publications and source records attributed to Takayuki Hibi.

At least 163 records · Page 9Linked to original sources

The binomial edge ideal of a pair of graphs

We introduce a class of ideals generated by a set of 2-minors of $m\times n$-matrix of indeterminates indexed by a pair of graphs. This class of ideals is a natural common generalization of binomial edge ideals and ideals generated by adjacent minors. We determine the minimal prime ideals of such ideals and give a lower bound for their degree of nilpotency. In some special cases we compute their Gröbner basis and characterize unmixedness and Cohen--Macaulayness.

math.AC↗

Finite lattices and Gröbner bases

Gröbner bases of binomial ideals arising from finite lattices will be studied. In terms of Gröbner bases and initial ideals, a characterization of finite distributive lattices as well as planar distributive lattices will be given.

math.AC↗

Hermite normal forms and $δ$-vector

Let $δ(\Pc) = (δ_0, δ_1,..., δ_d)$ be the $δ$-vector of an integral polytope $\Pc \subset \RR^N$ of dimension $d$. Following the previous work of characterizing the $δ$-vectors with $\sum_{i=0}^d δ_i \leq 3$, the possible $δ$-vectors with $\sum_{i=0}^d δ_i = 4$ will be classified. And each possible $δ$-vectors can be obtained by simplices. We get this result by studying the problem of classifying the possible integral simplices with a given $δ$-vector $(δ_0, δ_1,..., δ_d)$, where $\sum_{i=0}^d δ_i \leq 4$, by means of Hermite normal forms of square matrices.

math.CO↗

Centrally symmetric configurations of integer matrices

The concept of centrally symmetric configurations of integer matrices is introduced. We study the problem when the toric ring of a centrally symmetric configuration is normal as well as is Gorenstein. In addition, Gröbner bases of toric ideals of centrally symmetric configurations will be discussed. Special attentions will be given to centrally symmetric configurations of unimodular matrices and those of incidence matrices of finite graphs.

math.AC↗

Depth of initial ideals of normal edge rings

Let $G$ be a finite graph on the vertex set $[d] = \{1, ..., d \}$ with the edges $e_1, ..., e_n$ and $K[\tb] = K[t_1, ..., t_d]$ the polynomial ring in $d$ variables over a field $K$. The edge ring of $G$ is the semigroup ring $K[G]$ which is generated by those monomials $\tb^e = t_it_j$ such that $e = \{i, j\}$ is an edge of $G$. Let $K[\xb] = K[x_1, ..., x_n]$ be the polynomial ring in $n$ variables over $K$ and define the surjective homomorphism $π: K[\xb] \to K[G]$ by setting $π(x_i) = \tb^{e_i}$ for $i = 1, ..., n$. The toric ideal $I_G$ of $G$ is the kernel of $π$. It will be proved that, given integers $f$ and $d$ with $6 \leq f \leq d$, there exist a finite connected nonbipartite graph $G$ on $[d]$ together with a reverse lexicographic order $<_{\rev}$ on $K[\xb]$ and a lexicographic order $<_{\lex}$ on $K[\xb]$ such that (i) $K[G]$ is normal, (ii) $\depth K[\xb]/\ini_{<_{\rev}}(I_G) = f$ and (iii) $K[\xb]/\ini_{<_{\lex}}(I_G)$ is Cohen--Macaulay, where $\ini_{<_{\rev}}(I_G)$ (resp.\ $\ini_{<_{\lex}}(I_G)$) is the initial ideal of $I_G$ with respect to $<_{\rev}$ (resp.\ $<_{\lex}$) and where $\depth K[\xb]/\ini_{<_{\rev}}(I_G)$ is the depth of $K[\xb]/\ini_{<_{\rev}}(I_G)$.

math.AC↗

Ideals generated by adjacent 2-minors

Ideals generated by adjacent 2-minors are studied. First, the problem when such an ideal is a prime ideal as well as the problem when such an ideal possesses a quadratic Gröbner basis is solved. Second, we describe explicitly a primary decomposition of the radical ideal of an ideal generated by adjacent 2-minors, and challenge the question of classifying all ideals generated by adjacent 2-minors which are radical ideals. Finally, we discuss connectedness of contingency tables in algebraic statistics.

math.AC↗

Roots of Ehrhart polynomials arising from graphs

Several polytopes arise from finite graphs. For edge and symmetric edge polytopes, in particular, exhaustive computation of the Ehrhart polynomials not merely supports the conjecture of Beck {\it et al.}\ that all roots $α$ of Ehrhart polynomials of polytopes of dimension $D$ satisfy $-D \le \Re(α) \le D - 1$, but also reveals some interesting phenomena for each type of polytope. Here we present two new conjectures: (1) the roots of the Ehrhart polynomial of an edge polytope for a complete multipartite graph of order $d$ lie in the circle $|z+\tfrac{d}{4}| \le \tfrac{d}{4}$ or are negative integers, and (2) a Gorenstein Fano polytope of dimension $D$ has the roots of its Ehrhart polynomial in the narrower strip $-\tfrac{D}{2} \leq \Re(α) \leq \tfrac{D}{2}-1$. Some rigorous results to support them are obtained as well as for the original conjecture. The root distribution of Ehrhart polynomials of each type of polytope is plotted in figures.

math.CO↗

Depth of edge rings arising from finite graphs

Let $G$ be a finite graph and $K[G]$ the edge ring of $G$. Based on the technique of Gröbner bases and initial ideals, it will be proved that, given integers $f$ and $d$ with $7 \leq f \leq d$, there exists a finite graph $G$ on $[d]={1,...,d}$ with $\depth K[G] = f$ and with $\Krull-dim K[G] = d$.

math.AC↗

Toric rings and ideals of nested configurations

The toric ring together with the toric ideal arising from a nested configuration is studied, with particular attention given to the algebraic study of normality of the toric ring as well as the Gröbner bases of the toric ideal. One of the combinatorial applications of these algebraic findings leads to insights on smooth $3 \times 3$ transportation polytopes.

math.AC↗

Roots of Ehrhart polynomials of Gorenstein Fano polytopes

Given arbitrary integers $k$ and $d$ with $0 \leq 2k \leq d$, we construct a Gorenstein Fano polytope $\Pc \subset \RR^d$ of dimension $d$ such that (i) its Ehrhart polynomial $i(\Pc, n)$ possesses $d$ distinct roots; (ii) $i(\Pc, n)$ possesses exactly $2k$ imaginary roots; (iii) $i(\Pc, n)$ possesses exactly $d - 2k$ real roots; (iv) the real part of each of the imaginary roots is equal to $- 1 / 2$; (v) all of the real roots belong to the open interval $(-1, 0)$.

math.CO↗

Non-very ample configurations arising from contingency tables

In this paper, it is proved that, if a toric ideal possesses a fundamental binomial none of whose monomials is squarefree, then the corresponding semigroup ring is not very ample. Moreover, very ample semigroup rings of Lawrence type are discussed. As an application, we study very ampleness of configurations arising from contingency tables.

math.AC↗

Binomial edge ideals and conditional independence statements

We introduce binomial edge ideals attached to a simple graph $G$ and study their algebraic properties. We characterize those graphs for which the quadratic generators form a Gröbner basis in a lexicographic order induced by a vertex labeling. Such graphs are chordal and claw-free. We give a reduced squarefree Gröbner basis for general $G$. It follows that all binomial edge ideals are radical ideals. Their minimal primes can be characterized by particular subsets of the vertices of $G$. We provide sufficient conditions for Cohen--Macaulayness for closed and nonclosed graphs. Binomial edge ideals arise naturally in the study of conditional independence ideals. Our results apply for the class of conditional independence ideals where a fixed binary variable is independent of a collection of other variables, given the remaining ones. In this case the primary decomposition has a natural statistical interpretation

math.AC↗

Betti numbers of chordal graphs and $f$-vectors of simplicial complexes

Let $G$ be a chordal graph and $I(G)$ its edge ideal. Let $β(I(G)) = (β_0, β_1, ..., β_p)$ denote the Betti sequence of $I(G)$, where $β_i$ stands for the $i$th total Betti number of $I(G)$ and where $p$ is the projective dimension of $I(G)$. It will be shown that there exists a simplicial complex $Δ$ of dimension $p$ whose $f$-vector $f (Δ) = (f_0, f_1, ..., f_p)$ coincides with $β(I(G))$.

math.CO↗

Powers of componentwise linear ideals

We give criteria for graded ideals to have the property that all their powers are componentwise linear. Typical examples to which our criteria can be applied include the vertex cover ideals of certain finite graphs.

math.AC↗