Akihiro Higashitani

  1. Lattice multi-polygons.

    Authors: Mikiya Masuda, Akihiro Higashitani
    Subjects: Combinatorics
    Abstract

    We discuss generalizations of some results on lattice polygons to certain
    piecewise linear loops which may have a self-intersection but have vertices in
    the lattice $\Z^2$. We first prove a formula on the rotation number of a
    unimodular sequence in $\Z^2$ using toric topology. This formula implies the
    generalized twelve-point theorem.

  2. Depth of initial ideals of normal edge rings.

    Authors: Takayuki Hibi, Akihiro Higashitani, Kyouko Kimura, Augustine B. O'Keefe
    Subjects: Commutative Algebra
    Abstract

    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 $\pi :
    K[\xb] \to K[G]$ by setting $\pi(x_i) = \tb^{e_i}$ for $i = 1, ..., n$. The
    toric ideal $I_G$ of $G$ is the kernel of $\pi$.

  3. Depth of edge rings arising from finite graphs.

    Authors: Takayuki Hibi, Akihiro Higashitani, Kyouko Kimura, Augustine B. O'Keefe
    Subjects: Commutative Algebra
    Abstract

    Let $G$ be a finite graph and $K[G]$ the edge ring of $G$. Based on the
    technique of Gr\"obner 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$.

  4. Roots of Ehrhart polynomials of Gorenstein Fano polytopes.

    Authors: Takayuki Hibi, Akihiro Higashitani, Hidefumi Ohsugi
    Subjects: Combinatorics
    Abstract

    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)$.

  5. Shifted symmetric $\delta$-vectors of convex polytopes.

    Authors: Akihiro Higashitani
    Subjects: Combinatorics
    Abstract

    A $\delta$-vector $\delta(\Pc)= (\delta_0, \delta_1, ..., \delta_d)$ is
    called shifted symmetric if $\delta_{d-i} = \delta_{i+1}$ for each $0 \leq i
    \leq [(d-1)/2]$. A natural family of $(0,1)$-polytopes with shifted symmetric
    $\delta$-vectors will be studied.

  6. Shifted symmetric $\delta$-vectors of convex polytopes.

    Authors: Akihiro Higashitani
    Subjects: Combinatorics
    Abstract

    A $\delta$-vector $\delta(\Pc)= (\delta_0, \delta_1, ..., \delta_d)$ is
    called shifted symmetric if $\delta_{d-i} = \delta_{i+1}$ for each $0 \leq i
    \leq [(d-1)/2]$. A natural family of $(0,1)$-polytopes with shifted symmetric
    $\delta$-vectors will be studied.

  7. Smooth Fano polytopes arising from finite partially ordered sets.

    Authors: Takayuki Hibi, Akihiro Higashitani
    Subjects: Combinatorics
    Abstract

    Gorenstein Fano polytopes arising from finite partially ordered sets will be
    introduced. Then we study the problem which partially ordered sets yield smooth
    Fano polytopes.

Syndicate content