Related papers: Partitioning the projective plane and the dunce ha…
We present a simple construction of hat tilings. The construction can be carried out by superimposing a triangular grid on a specially colored image and reading off the orientation of the tiles. We show that our construction produces valid…
A \emph{generalized dunce hat} is a 2-dimensional polyhedron created by attaching the boundary of a disk $\Delta$ to a circle $J$ via a map $f:\partial \Delta \to J$ with the property that there is a point $v \in J$ such that…
In this paper we introduce a technique to produce tighter cutting planes for mixed-integer non-linear programs. Usually, a cutting plane is generated to cut off a specific infeasible point. The underlying idea is to use the infeasible point…
From descent theory to higher geometry, the idea of gluing has been embedded in many elegant and powerful techniques, proving instrumental for the solution of many problems. In this paper, we introduce a framework that allows to link…
We provide a technique to glue simple-minded collections along a recollement of Hom-finite Krull-Schmidt triangulated categories over a field. This gluing technique for simple-minded collections is shown to be compatible with those for…
Generalizing pseudospherical drawings, we introduce a new class of simple drawings, which we call separable drawings. In a separable drawing, every edge can be closed to a simple curve that intersects each other edge at most once. Curves of…
Shellings of simplicial complexes have long been a useful tool in topological and algebraic combinatorics. Shellings of a complex expose a large amount of information in a helpful way, but are not easy to construct, often requiring deep…
We prove that a planar graph is generically rigid in the plane if and only if it can be embedded as a pseudo-triangulation. This generalizes the main result of math.CO/0307347 which treats the minimally generically rigid case. The proof…
Finite projective planes are constructed using groups that satisfy simple-looking conditions. The resulting projective planes include many known planes and possibly new ones, and are precisely those having a collineation group fixing a flag…
We obtain a geometric realization of a minimal 8-vertex triangulation of the dunce hat in Euclidean 3-space. We show there is a simplicial 3-ball with 8 vertices that is collapsible, but also collapses onto the dunce hat, which is not…
Partial duality generalizes the fundamental concept of the geometric dual of an embedded graph. A partial dual is obtained by forming the geometric dual with respect to only a subset of edges. While geometric duality preserves the genus of…
A hinged dissection of a set of polygons S is a collection of polygonal pieces hinged together at vertices that can be folded into any member of S. We present a hinged dissection of all edge-to-edge gluings of n congruent copies of a…
We develop the partitioning technique for quantum discrete systems. The graph consists of several subgraphs: a central graph and several branch graphs, with each branch graph being rooted by an individual node on the central one. We show…
Classification theory and the study of projective varieties which are covered by rational curves of minimal degrees naturally leads to the study of families of singular rational curves. Since families of arbitrarily singular curves are hard…
This work proves that the process of gluing finite lattices to form a larger lattice is bijective, that is each lattice is the glued sum of a unique system of finite lattices, provided the class of lattices is constrained to modular,…
We consider the problem of computing a triangulation of the real projective plane P2, given a finite point set S={p1, p2,..., pn} as input. We prove that a triangulation of P2 always exists if at least six points in S are in general…
Any space-filling packing of spheres can be cut by a plane to obtain a space-filling packing of disks. Here, we deal with space-filling packings generated using inversive geometry leading to exactly self-similar fractal packings. First, we…
A multigraph G is triangle decomposable if its edge set can be partitioned into subsets, each of which induces a triangle of G, and rationally triangle decomposable if its triangles can be assigned rational weights such that for each edge e…
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…
It is shown that the descending plane partitions of Andrews can be geometrically realized as cyclically symmetric rhombus tilings of a certain hexagon where an equilateral triangle of side length 2 has been removed from its centre. Thus,…