2011/10/14 by Satoshi Kamei, Kamei, Satoshi
Mathematics · Engineering · #Advanced Combinatorial Mathematics #graph theory and CDMA systems #Mathematics and Applications
paper · pdf · doi:10.48550/arxiv.1110.3128
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.