Kenji Kashiwabara
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Kenji Kashiwabara has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Masahiro Hachimori
Graduate School of Systems and Information Engineering, University of Tsukuba, Tsukuba, Ibaraki 305-8573, Japan
3 shared publications - Ayaka Shimizu
Institute for Global Leadership, Ochanomizu University, Ohtsuka, Bunkyo-ku, Tokyo 112-8610, Japan
1 shared publication Masahiro Hachimori
Graduate School of Systems and Information Engineering, University of Tsukuba, Japan
1 shared publicationMasataka Nakamura
Department of Systems Science, The University of Tokyo, Japan
1 shared publication- Masataka Nakamura
University of Tokyo
1 shared publication
Latest Publications
- 20 November 2024
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 40 (6) , 1-19
Several Minimality Concepts Related to Frankl’s Conjecture
- 20 November 2024
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 40 (6) , 1-19
Several Minimality Concepts Related to Frankl’s Conjecture
- Open Access
A note on unavoidable sets for a spherical curve of reductivity four
The reductivity of a spherical curve is the minimal number of a local transformation called an inverse-half-twisted splice required to obtain a reducible spherical curve from the spherical curve. It is unknown if there exists a spherical curve whose reductivity is four. In this paper, an unavoidable set of configurations for a spherical curve with reductivity four is given by focusing on 5-gons. It has also been unknown if there exists a reduced spherical curve which has no 2-gons and 3-gons of type A, B and C. This paper gives the answer to the question by constructing such a spherical curve.
Open AccessA note on unavoidable sets for a spherical curve of reductivity four
The reductivity of a spherical curve is the minimal number of a local transformation called an inverse-half-twisted splice required to obtain a reducible spherical curve from the spherical curve. It is unknown if there exists a spherical curve whose reductivity is four. In this paper, an unavoidable set of configurations for a spherical curve with reductivity four is given by focusing on 5-gons. It has also been unknown if there exists a reduced spherical curve which has no 2-gons and 3-gons of type A, B and C. This paper gives the answer to the question by constructing such a spherical curve.
- Open Access
- 7 January 2013
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 20 (1) , P22
The Prime Stems of Rooted Circuits of Closure Spaces and Minimum Implicational Bases
A rooted circuit is firstly introduced for convex geometries (antimatroids). We generalize it for closure systems or equivalently for closure operators. A rooted circuit is a specific type of a pair $(X,e)$ of a subset $X$, called a stem, and an element $e\not\in X$, called a root. We introduce a notion called a 'prime stem', which plays the key role in this article. Every prime stem is shown to be a pseudo-closed set of an implicational system. If the sizes of stems are all the same, the stems are all pseudo-closed sets, and they give rise to a canonical minimum implicational basis. For an affine convex geometry, the prime stems determine a canonical minimum basis, and furthermore gives rise to an optimal basis. A 'critical rooted circuit' is a special case of a rooted circuit defined for an antimatroid. As a precedence structure, 'critical rooted circuits' are necessary and sufficient to fix an antimatroid whereas critical rooted circuits are not necessarily sufficient to restore the original antimatroid as an implicational system. It is shown through an example.- 7 January 2013
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 20 (1) , P22
Open AccessThe Prime Stems of Rooted Circuits of Closure Spaces and Minimum Implicational Bases
A rooted circuit is firstly introduced for convex geometries (antimatroids). We generalize it for closure systems or equivalently for closure operators. A rooted circuit is a specific type of a pair $(X,e)$ of a subset $X$, called a stem, and an element $e\not\in X$, called a root. We introduce a notion called a 'prime stem', which plays the key role in this article. Every prime stem is shown to be a pseudo-closed set of an implicational system. If the sizes of stems are all the same, the stems are all pseudo-closed sets, and they give rise to a canonical minimum implicational basis. For an affine convex geometry, the prime stems determine a canonical minimum basis, and furthermore gives rise to an optimal basis. A 'critical rooted circuit' is a special case of a rooted circuit defined for an antimatroid. As a precedence structure, 'critical rooted circuits' are necessary and sufficient to fix an antimatroid whereas critical rooted circuits are not necessarily sufficient to restore the original antimatroid as an implicational system. It is shown through an example. - 1 July 2011
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 118 (5) , 1608-1623
Obstructions to shellability, partitionability, and sequential Cohen–Macaulayness
- 1 July 2011
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 118 (5) , 1608-1623
Obstructions to shellability, partitionability, and sequential Cohen–Macaulayness
- Open Access
Obstructions to shellability, partitionability, and sequential Cohen-Macaulayness
For a property $\cal P$ of simplicial complexes, a simplicial complex $\Gamma$ is an obstruction to $\cal P$ if $\Gamma$ itself does not satisfy $\cal P$ but all of its proper restrictions satisfy $\cal P$. In this paper, we determine all obstructions to shellability of dimension $\le 2$, refining the previous work by Wachs. As a consequence we obtain that the set of obstructions to shellability, that to partitionability and that to sequential Cohen-Macaulayness all coincide for dimensions $\le 2$. We also show that these three sets of obstructions coincide in the class of flag complexes. These results show that the three properties, hereditary-shellability, hereditary-partitionability, and hereditary-sequential Cohen-Macaulayness are equivalent for these classes.Open AccessObstructions to shellability, partitionability, and sequential Cohen-Macaulayness
For a property $\cal P$ of simplicial complexes, a simplicial complex $\Gamma$ is an obstruction to $\cal P$ if $\Gamma$ itself does not satisfy $\cal P$ but all of its proper restrictions satisfy $\cal P$. In this paper, we determine all obstructions to shellability of dimension $\le 2$, refining the previous work by Wachs. As a consequence we obtain that the set of obstructions to shellability, that to partitionability and that to sequential Cohen-Macaulayness all coincide for dimensions $\le 2$. We also show that these three sets of obstructions coincide in the class of flag complexes. These results show that the three properties, hereditary-shellability, hereditary-partitionability, and hereditary-sequential Cohen-Macaulayness are equivalent for these classes. - 28 August 2010
- Published by Elsevier in Discrete Mathematics
- Vol. 310 (15-16) , 2100-2112
Characterizations of the convex geometries arising from the double shellings of posets
- 28 August 2010
- Published by Elsevier in Discrete Mathematics
- Vol. 310 (15-16) , 2100-2112
Characterizations of the convex geometries arising from the double shellings of posets
- Open Access
- 5 January 2010
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 17 (1) , R28
The Toric Ideal of a Matroid of Rank 3 is Generated by Quadrics
White conjectured that the toric ideal associated with the basis of a matroid is generated by quadrics corresponding to symmetric exchanges. We present a combinatorial proof of White's conjecture for matroids of rank 3 by using a lemma proposed by Blasiak.
- 5 January 2010
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 17 (1) , R28
Open AccessThe Toric Ideal of a Matroid of Rank 3 is Generated by Quadrics
White conjectured that the toric ideal associated with the basis of a matroid is generated by quadrics corresponding to symmetric exchanges. We present a combinatorial proof of White's conjecture for matroids of rank 3 by using a lemma proposed by Blasiak.
- 28 January 2007
- Published by Elsevier in Discrete Mathematics
- Vol. 307 (2) , 274-279
On the topology of the free complexes of convex geometries
- 28 January 2007
- Published by Elsevier in Discrete Mathematics
- Vol. 307 (2) , 274-279
On the topology of the free complexes of convex geometries