Deciding nonconstructibility of 3-balls with strict spanning edges
Combinatorics
2012-02-20 v3
Abstract
In this paper, we consider constructibility of simplicial 3-balls. In many cases, examining 1-dimensional subcomplexes of a simplicial 3-ball is efficient to solve the decision problem whether the simplicial 3-ball is constructible or not. From the point of view, we consider the case where a simplicial 3-ball has spanning edges and present a sufficient condition for nonconstructibility.
Cite
@article{arxiv.1110.3128,
title = {Deciding nonconstructibility of 3-balls with strict spanning edges},
author = {Satoshi Kamei},
journal= {arXiv preprint arXiv:1110.3128},
year = {2012}
}
Comments
8 pages, 4 figures