Searcharxiv⌕ Search

arXiv subjects

Takayuki Hibi

Publications and source records attributed to Takayuki Hibi.

At least 55 records · Page 3Linked to original sources

Diameter and connectivity of finite simple graphs II

Let $G$ be a finite simple non-complete connected graph on $[n] = \{1, \ldots, n\}$ and $κ(G) \geq 1$ its vertex connectivity. Let $f(G)$ denote the number of free vertices of $G$ and $\mathrm{diam}(G)$ the diameter of $G$. The final goal of this paper is to determine all sequences of integers $(n,f,d,k)$ with $n\geq 8$, $f\geq 0$, $d\geq 2$ and $k\geq 1$ for which there exists a finite simple non-complete connected graph on $[n]$ with $f=f(G)$, $d=\mathrm{diam}(G)$ and $k=κ(G)$.

math.CO↗

Binomial ideals attached to finite collections of cells

We consider the ideal of inner $2$-minors $I_{\mathcal{P}}$ of a finite set of cells $\mathcal{P}$, which we call the cell ideal of $\mathcal{P}$. A nice interpretation for the height of an unmixed ideal $I_{\mathcal{P}}$, in terms of the number of cells of $\mathcal{P}$ is given. Moreover, the coordinate rings of cell ideals with isolated singularities are determined.

math.AC↗

The divisor class group of a discrete polymatroid

In this paper we introduce toric rings of multicomplexes. We show how to compute the divisor class group and the class of the canonical module when the toric ring is normal. In the special case that the multicomplex is a discrete polymatroid, its toric ring is studied deeply for several classes of polymatroids.

math.AC↗

Resolution and Betti numbers of Vertex cover ideals

The vertex cover ideal $J(G)$ of a finite graph $G$ is studied. We characterize when a Cohen--Macaulay vertex cover ideal $J(G)$ has a Scarf minimal free resolution. Furthermore, by using both combinatorial and topological techniques, the graded Betti number $β_{i,i+j}(J(G))$, where $i$ and $j$ are the projective dimension and the regularity of $J(G)$, is computed, when $G$ is either a path or a cycle.

math.AC↗

A New Invariant of Lattice polytopes

The maximal degree of monomials belonging to the unique minimal system of monomial generators of the canonical module $ω(K[{\mathcal P}])$ of the toric ring $K[{\mathcal P}]$ defined by a lattice polytope ${\mathcal P}$ will be studied. It is shown that if ${\mathcal P}$ possesses an interior lattice point, then the maximal degree is at most ${\rm dim} {\mathcal P} - 1$, and that this bound is the best possible in general.

math.AC↗

Ideals with componentwise linear powers

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over a field $K$, and let $A$ be a finitely generated standard graded $S$-algebra. We show that if the defining ideal of $A$ has a quadratic initial ideal, then all the graded components of $A$ are componentwise linear. Applying this result to the Rees ring $\mathcal{R}(I)$ of a graded ideal $I$ gives a criterion on $I$ to have componentwise linear powers. Moreover, for any given graph $G$, a construction on $G$ is presented which produces graphs whose cover ideals $I_G$ have componentwise linear powers. This in particular implies that for any Cohen-Macaulay Cameron-Walker graph $G$ all powers of $I_G$ have linear resolutions. Moreover, forming a cone on special graphs like unmixed chordal graphs, path graphs and Cohen-Macaulay bipartite graphs produces cover ideals with componentwise linear powers.

math.AC↗

Behaviour of the normalized depth function

Let $I\subset S=K[x_1,\dots,x_n]$ be a squarefree monomial ideal, $K$ a field. The $k$th squarefree power $I^{[k]}$ of $I$ is the monomial ideal of $S$ generated by all squarefree monomials belonging to $I^k$. The biggest integer $k$ such that $I^{[k]}\ne(0)$ is called the monomial grade of $I$ and it is denoted by $ν(I)$. Let $d_k$ be the minimum degree of the monomials belonging to $I^{[k]}$. Then, $\text{depth}(S/I^{[k]})\ge d_k-1$ for all $1\le k\leν(I)$. The normalized depth function of $I$ is defined as $g_{I}(k)=\text{depth}(S/I^{[k]})-(d_k-1)$, $1\le k\leν(I)$. It is expected that $g_I(k)$ is a non-increasing function for any $I$. In this article we study the behaviour of $g_{I}(k)$ under various operations on monomial ideals. Our main result characterizes all cochordal graphs $G$ such that for the edge ideal $I(G)$ of $G$ we have $g_{I(G)}(1)=0$. They are precisely all cochordal graphs $G$ whose complementary graph $G^c$ is connected and has a cut vertex. As a far-reaching application, for given integers $1\le s<m$ we construct a graph $G$ such that $ν(I(G))=m$ and $g_{I(G)}(k)=0$ if and only if $k=s+1,\dots,m$. Finally, we show that any non-increasing function of non-negative integers is the normalized depth function of some squarefree monomial ideal.

math.AC↗

The minimal volume of a lattice polytope

Let $\mathcal{P} \subset \mathbb{R}^d$ be a lattice polytope of dimension $d$. Let $b$ denote the number of lattice points belonging to the boundary of $\mathcal{P}$ and $c$ that to the interior of $\mathcal{P}$. It follows from a lower bound theorem of Ehrhart polynomials that, when $c > 0$, the volume of $\mathcal{P}$ is bigger than or equal to $(dc + (d-1)b - d^2 + 2)/d!$. In the present paper, via triangulations, a short and elementary proof of the minimal volume formula is given.

math.CO↗

The number of $4$-cycles and the cyclomatic number of a finite simple graph

Let $G$ be a finite connected simple graph with $n$ vertices and $m$ edges. We show that, when $G$ is not bipartite, the number of $4$-cycles contained in $G$ is at most $\binom{m-n+1}{2}$. We further provide a short combinatorial proof of the bound $\binom{m-n+2}{2}$ which holds for bipartite graphs.

math.CO↗

Toric rings arising from vertex cover ideals

We extend the sortability concept to monomial ideals which are not necessarily generated in one degree and as an application we obtain normal Cohen-Macaulay toric rings attached to vertex cover ideals of graphs. Moreover, we consider a construction on a graph called a clique multi-whiskering which always produces vertex cover ideals with componentwise linear powers.

math.AC↗

The normalized depth function of squarefree powers

The depth of squarefree powers of a squarefree monomial ideal is introduced. Let $I$ be a squarefree monomial ideal of the polynomial ring $S=K[x_1,\ldots,x_n]$. The $k$-th squarefree power $I^{[k]}$ of $I$ is the ideal of $S$ generated by those squarefree monomials $u_1\cdots u_k$ with each $u_i\in G(I)$, where $G(I)$ is the unique minimal system of monomial generators of $I$. Let $d_k$ denote the minimum degree of monomials belonging to $G(I^{[k]})$. One has $\operatorname{depth}(S/I^{[k]}) \geq d_k -1$. Setting $g_I(k) = \operatorname{depth}(S/I^{[k]}) - (d_k - 1)$, one calls $g_I(k)$ the normalized depth function of $I$. The computational experience strongly invites us to propose the conjecture that the normalized depth function is nonincreasing. In the present paper, especially the normalized depth function of the edge ideal of a finite simple graph is deeply studied.

math.AC↗

Rings of Teter type

Let $R$ be a Cohen--Macaulay local $K$-algebra or a standard graded $K$-algebra over a field $K$ with a canonical module $ω_R$. The trace of $ω_R$ is the ideal $tr(ω_R)$ of $R$ which is the sum of those ideals $φ(ω_R)$ with $φ\in Hom_R(ω_R,R)$. The smallest number $s$ for which there exist $φ_1, \ldots, φ_s \in Hom_R(ω_R,R)$ with $tr(ω_R)=φ_1(ω_R) + \cdots + φ_s(ω_R)$ is called the Teter number of $R$. We say that $R$ is of Teter type if $s = 1$. It is shown that $R$ is not of Teter type if $R$ is generically Gorenstein. In the present paper, we focus especially on $0$-dimensional graded and monomial $K$-algebras and present various classes of such algebras which are of Teter type.

math.AC↗

Stable set rings which are Gorenstein on the punctured spectrum

The non-Gorenstein locus of stable set rings of finite simple perfect graphs is studied. We describe combinatorially those perfect graphs whose stable set rings are Gorenstein on the punctured spectrum. In addition, we show that, in general, for Cohen--Macaulay graded algebras, their Cohen--Macaulay type and residue are largely independent.

math.AC↗

Toric Codes from Order Polytopes

In this article we investigate a class of linear error correcting codes in relation with the order polytopes. In particular we consider the order polytopes of tree posets and bipartite posets. We calculate the parameters of the associated toric variety codes.

math.CO↗