Related papers: A Note on Objects Built From Bricks without Corner…
We say that a $2$-dimensional CW complex is a multibranched surface if we remove all points whose open neighborhoods are homeomorphic to the $2$-dimensional Euclidean space, then we obtain a $1$-dimensional complex which is homeomorphic to…
Polycons, initially introduced by Wachspress in 1975 as a tool in finite element methods, are generalizations of polygons in that they allow conic boundary components. We are interested in the adjoint curve of a given polycon, i.e. the…
A surface with boundary is randomly generated by gluing polygons along some of their sides. We show that its genus and number of boundary components asymptotically follow a bivariate normal distribution.
Given a polyhedron (planar, $3$-connected graph) $G$, we investigate its common neighbourhood graph con($G$). For cubic ($3$-regular) polyhedra, we show that the planarity of con($G$) depends on the number of odd faces of $G$, and on their…
We define an integer-valued invariant of special cube complexes called the genus, and prove that having genus one characterizes special cube complexes with abelian fundamental group. Using the genus, we obtain a new proof that the…
In this paper we present the construction of several aggregates of tetrahedra. Each construction is obtained by performing rotations on an initial set of tetrahedra that either (1) contains gaps between adjacent tetrahedra, or (2) exhibits…
We demonstrate in an elementary way how to construct a frieze pattern of width $m-3$ from a partition of a convex $m$-gon by not intersecting diagonals.
We construct knot invariants on the basis of ascribing Euclidean geometric values to a triangulation of sphere S^3 where the knot lies. The main new feature of this construction compared to the author's earlier papers on manifold invariants…
We prove the existence of pure braids with arbitrarily many strands which are small, i.e. they contain no closed incompressible surface in the complement which is not boundary parallel. This implies the existence of irreducible non-Haken…
A spherical polyhedron surface is a triangulated surface obtained by isometric gluing of spherical triangles. For instance, the boundary of a generic convex polytope in the 3-sphere is a spherical polyhedron surface. This paper investigates…
We give coordinate-minimal geometric realizations in general position of all 865 vertex-minimal triangulations of the orientable surface of genus 2 in the 4x4x4-cube.
Many bundle gerbes constructed in practice are either infinite-dimensional, or finite-dimensional but built using submersions that are far from being fibre bundles. Murray and Stevenson proved that gerbes on simply-connected manifolds,…
We describe a new method of weaving a model of the Klein quartic, a highly symmetric, but abstract genus-3 surface akin to a platonic polyhedron, with negatively-curved geometry. The Klein quartic cannot be realized in its fully symmetric…
We prove a structure theorem for 3-manifolds with non-trivial JSJ-decomposition and 2-generated fundamental group. We deduce a variety of Corollaries. Note this is not a complete classification of such manifolds. In particular we believe…
Consider a variant of the graph diameter of a polyhedron where each step in a walk between two vertices travels maximally in a circuit direction instead of along incident edges. Here circuit directions are non-trivial solutions to…
Skeletal polyhedra are discrete structures made up of finite, flat or skew, or infinite, helical or zigzag, polygons as faces, with two faces on each edge and a circular vertex-figure at each vertex. When a variant of Wythoff's construction…
In contrast with the Hovey correspondence of abelian model structures from two compatible complete cotorsion pairs, Beligiannis and Reiten give a construction of model structures on abelian categories from one hereditary complete cotorsion…
{ An edge $e$ in a matching covered graph $G$ is {\em removable} if $G-e$ is matching covered, which was introduced by Lov\'asz and Plummer in connection with ear decompositions of matching covered graphs. A {\it brick}} is a non-bipartite…
A one-degree-of-freedom graph is a graph obtained from a minimally rigid graph in the plane and removing an edge. For such graph, the set of realisations with fixed edge length, modulo rotations and reflections, is an algebraic curve. The…
We construct, for any positive integer n, a family of n congruent convex polyhedra in R^3, such that every pair intersects in a common facet. Previously, the largest such family contained only eight polytopes. Our polyhedra are Voronoi…