537 research outputs found

    Combinatorial 3-manifolds with 10 vertices

    Full text link
    We give a complete enumeration of all combinatorial 3-manifolds with 10 vertices: There are precisely 247882 triangulated 3-spheres with 10 vertices as well as 518 vertex-minimal triangulations of the sphere product S2×S1S^2\times S^1 and 615 triangulations of the twisted sphere product S^2_\times_S^1. All the 3-spheres with up to 10 vertices are shellable, but there are 29 vertex-minimal non-shellable 3-balls with 9 vertices.Comment: 9 pages, minor revisions, to appear in Beitr. Algebra Geo

    Balanced triangulations on few vertices and an implementation of cross-fips

    Get PDF
    A d -dimensional simplicial complex is balanced if the underlying graph is ( d + 1 ) -colorable. We present an implementation of cross-flips, a set of local moves introduced by Izmestiev, Klee and Novik which connect any two PL-homeomorphic balanced combinatorial manifolds. As a result we exhibit a vertex minimal balanced triangulation of the real projective plane, of the dunce hat and of the real projective space, as well as several balanced triangulations of surfaces and 3-manifolds on few vertices. In particular we construct small balanced triangulations of the 3-sphere that are non-shellable and shellable but not vertex decomposable

    Small examples of non-constructible simplicial balls and spheres

    Full text link
    We construct non-constructible simplicial dd-spheres with d+10d+10 vertices and non-constructible, non-realizable simplicial dd-balls with d+9d+9 vertices for d3d\geq 3.Comment: 9 pages, 3 figure

    Hyperplane Neural Codes and the Polar Complex

    Full text link
    Hyperplane codes are a class of convex codes that arise as the output of a one layer feed-forward neural network. Here we establish several natural properties of stable hyperplane codes in terms of the {\it polar complex} of the code, a simplicial complex associated to any combinatorial code. We prove that the polar complex of a stable hyperplane code is shellable and show that most currently known properties of the hyperplane codes follow from the shellability of the appropriate polar complex.Comment: 23 pages, 5 figures. To appear in Proceedings of the Abel Symposiu

    On kk-stellated and kk-stacked spheres

    Full text link
    We introduce the class Σk(d)\Sigma_k(d) of kk-stellated (combinatorial) spheres of dimension dd (0kd+10 \leq k \leq d + 1) and compare and contrast it with the class Sk(d){\cal S}_k(d) (0kd0 \leq k \leq d) of kk-stacked homology dd-spheres. We have Σ1(d)=S1(d)\Sigma_1(d) = {\cal S}_1(d), and Σk(d)Sk(d)\Sigma_k(d) \subseteq {\cal S}_k(d) for d2k1d \geq 2k - 1. However, for each k2k \geq 2 there are kk-stacked spheres which are not kk-stellated. The existence of kk-stellated spheres which are not kk-stacked remains an open question. We also consider the class Wk(d){\cal W}_k(d) (and Kk(d){\cal K}_k(d)) of simplicial complexes all whose vertex-links belong to Σk(d1)\Sigma_k(d - 1) (respectively, Sk(d1){\cal S}_k(d - 1)). Thus, Wk(d)Kk(d){\cal W}_k(d) \subseteq {\cal K}_k(d) for d2kd \geq 2k, while W1(d)=K1(d){\cal W}_1(d) = {\cal K}_1(d). Let Kˉk(d)\bar{{\cal K}}_k(d) denote the class of dd-dimensional complexes all whose vertex-links are kk-stacked balls. We show that for d2k+2d\geq 2k + 2, there is a natural bijection MMˉM \mapsto \bar{M} from Kk(d){\cal K}_k(d) onto Kˉk(d+1)\bar{{\cal K}}_k(d + 1) which is the inverse to the boundary map  ⁣:Kˉk(d+1)Kk(d)\partial \colon \bar{{\cal K}}_k(d + 1) \to {\cal K}_k(d).Comment: Revised Version. Theorem 2.24 is new. 18 pages. arXiv admin note: substantial text overlap with arXiv:1102.085
    corecore