Related papers: A system for constructing relatively small polyhed…
A projective mirror polyhedron is a projective polyhedron endowed with reflections across its faces. We construct an explicit diffeomorphism between the moduli space of a mirror projective polyhedron with fixed dihedral angles in…
A conjecture regarding the structure of expander graphs is discussed.
We derive a mixed integer nonlinear programming formulation for the problem of finding a convex polygon with a given number of vertices that is small (diameter at most one) and has maximum perimeter. The formulation is based on a geometric…
In this thesis we explore natural procedures through which topological structure can be constructed from specific semigroups. We will do this in two ways: 1) we equip the semigroup object itself with a topological structure, and 2) we find…
We present an improved algorithm for {\em quasi-properly} learning convex polyhedra in the realizable PAC setting from data with a margin. Our learning algorithm constructs a consistent polyhedron as an intersection of about $t \log t$…
It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…
We provide an algorithm for unfolding the surface of any orthogonal polyhedron that falls into a particular shape class we call Manhattan Towers, to a nonoverlapping planar orthogonal polygon. The algorithm cuts along edges of a 4x5x1…
A product of cochains in a polyhedral complex is constructed. The multiplication algorithm depends on the choice of a parameter. The parameter is a linear functional on the ambient space. Cocycles form a subring of the ring of cochains,…
We investigate algebraic structures that can be placed on vertices of the multiplihedra, a family of polytopes originating in the study of higher categories and homotopy theory. Most compelling among these are two distinct structures of a…
This paper considers a simple geometric construction, called the Pentagram map. The pentagram map, performed on N-gons, gives rise to a birational mapping on the space of all N-gons. This paper finds what conjecturally are all the…
The purpose of this article is to demonstrate that non-crystallographic reflection groups can be used to build new solvable quantum particle systems. We explicitly construct a one-parametric family of solvable four-body systems on a line,…
The first author in recent work with D. Gay developed the notion of a Morse structure on an open book as a tool for studying closed contact 3-manifolds. We extend the notion of Morse structure to extendable partial open books in order to…
A characterization of real numbers constructible by paper folding.
We show that minimally 3-rigid block-and-hole graphs, with one block or one hole, are characterised as those which are constructible from $K_3$ by vertex splitting, and also, as those having associated looped face graphs which are…
Polygraphs are a higher-dimensional generalization of the notion of directed graph. Based on those as unifying concept, this monograph on polygraphs revisits the theory of rewriting in the context of strict higher categories, adopting the…
Compacting orthogonal drawings is a challenging task. Usually algorithms try to compute drawings with small area or edge length while preserving the underlying orthogonal shape. We present a one-dimensional compaction algorithm that alters…
We survey algorithms and bounds for constructing planar drawings of graphs in small area.
We study convex domino towers using a classic dissection technique on polyominoes to find the generating function and an asymptotic approximation.
The aim of this work is to construct families of weighing matrices via their automorphism group action. This action is determined from the $0,1,2$-cohomology groups of the underlying abstract group. As a consequence, some old and new…
We give a method of constructing self-orthogonal codes from equitable partitions of association schemes. By applying this method we construct self-orthogonal codes from some distance-regular graphs. Some of the obtained codes are optimal.…