Deciding nonconstructibility of 3-balls with strict spanning edges

DOI10.4036/IIS.2012.37MaRDI QIDQ4911237zbMATH OpenOpenAlexFDO

Authors Satoshi Kamei

Publication date 14 March 2013

Published in Interdisciplinary Information Sciences (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1110.3128

zbMATH Keywords

constructibilityshellabilitysimplicial complex

Mathematics Subject Classification ID

Combinatorial aspects of simplicial complexes (05E45)

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.

Recommendations

• Deciding nonconstructibility of 3-balls with spanning edges and interior vertices
• Decompositions of simplicial balls and spheres with knots consisting of few edges
• Nonconstructible simplicial balls and a way of testing constructibility
• A shellable 3-ball with a knotted spanning arc consisting of 3 edges
• Deciding constructibility of 3-balls with at most two interior vertices

Cited in

(4)

• Nonconstructible simplicial balls and a way of testing constructibility
• Deciding nonconstructibility of 3-balls with spanning edges and interior vertices
• Deciding constructibility of 3-balls with at most two interior vertices
• Non-constructible complexes and the bridge index

This page was built for publication: Deciding nonconstructibility of 3-balls with strict spanning edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4911237)