Naoki Terai

Prof. Naoki Terai


Research Focus & Metrics

Academic Career Length

30Years (1997-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 November 2005 in Archiv der Mathematik
Verified
Journal Article
Closed access
PDF file
JHJ. Herzog
J. Herzog
YTY. Takayama
Y. Takayama
NTNaoki Terai
Naoki Terai

29 May 2008 in Journal of Algebraic Combinatorics
Verified
Journal Article
Closed access
PDF file
KKKyouko Kimura
Kyouko Kimura
NTNaoki Terai
Naoki Terai
KYKen-Ichi Yoshida
Ken-Ichi Yoshida

1 June 2014 in Journal of Pure and Applied Algebra
Verified
Journal Article
Closed access
NTNaoki Terai
Naoki Terai
NTNgo Viet Trung
Ngo Viet Trung

12 April 2017 in Nagoya Mathematical Journal
Verified
Journal Article
Closed access
PDF file
KKKyouko Kimura
Kyouko Kimura
NTNaoki Terai
Naoki Terai
SYSiamak Yassemi
Siamak Yassemi
A very well-covered graph is an unmixed graph whose covering number is half of the number of vertices. We construct an explicit minimal free resolution of the cover ideal of a Cohen–Macaulay very well-covered graph. Using this resolution, we characterize the projective dimension of the edge ideal of a very well-covered graph in terms of a pairwise -disjoint set of complete bipartite subgraphs of the graph. We also show nondecreasing property of the projective dimension of symbolic powers of the edge ideal of a very well-covered graph with respect to the exponents.

18 November 2010 in Proceedings of the American Mathematical Society
Verified
Journal Article
Closed access
PDF file
HHHassan Haghighi
Hassan Haghighi
NTNaoki Terai
Naoki Terai
SYSiamak Yassemi
Siamak Yassemi
RZRahim Zaare-Nahandi
Rahim Zaare-Nahandi
We introduce sequentially S r S_r modules over a commutative graded ring and sequentially S r S_r simplicial complexes. This generalizes two properties for modules and simplicial complexes: being sequentially Cohen-Macaulay, and satisfying Serre’s condition S r S_r . In analogy with the sequentially Cohen-Macaulay property, we show that a simplicial complex is sequentially S r S_r if and only if its pure i i -skeleton is S r S_r for all i i . For r = 2 r=2 , we provide a more relaxed characterization. As an algebraic criterion, we prove that a simplicial complex is sequentially S r S_r if and only if the minimal free resolution of the ideal of its Alexander dual is componentwise linear in the first r r steps. We apply these results for a graph, i.e., for the simplicial complex of the independent sets of vertices of a graph. We characterize sequentially S r S_r cycles showing that the only sequentially S 2 S_2 cycles are odd cycles and, for r ≥ 3 r\ge 3 , no cycle is sequentially S r S_r with the exception of cycles of length 3 3 and 5 5 . We extend certain known results on sequentially Cohen-Macaulay graphs to the case of sequentially S r S_r graphs. We prove that a bipartite graph is vertex decomposable if and only if it is sequentially S 2 S_2 . We provide some more results on certain graphs which in particular implies that any graph with no chordless even cycle is sequentially S 2 S_2 . Finally, we propose some questions.

1 December 1997 in manuscripta mathematica
Verified
Journal Article
Closed access
PDF file
NTNaoki Terai
Naoki Terai
Takayuki HibiTakayuki Hibi
Takayuki Hibi