Related papers: Constructing and Counting Hexaflexagons

We develop recursion equations to describe the three-dimensional shape of a sheet upon which a series of concentric curved folds have been inscribed. In the case of no stretching outside the fold, the three-dimensional shape of a single…

Over the past decade, we have designed six typefaces based on mathematical theorems and open problems, specifically computational geometry. These typefaces expose the general public in a unique way to intriguing results and hard problems in…

In this paper, we study edge-transitive surfaces, i.e. triangulated 2-dimensional manifolds whose automorphism groups act transitively on the edges of these triangulated surfaces. We show that there exist four types of edge-transitive…

Let F be a foliation of codimension 2 on a compact manifold with at least one non-compact leaf. We show that then F must contain uncountably many non-compact leaves. We prove the same statement for oriented p-dimensional foliations of…

The folding of paper, hide, and woven fabric has been used for millennia to achieve enhanced articulation, curvature, and visual appeal for intrinsically flat, two-dimensional materials. For graphene, an ideal two-dimensional material,…

We establish a simple recurrence formula for the number $Q_g^n$ of rooted orientable maps counted by edges and genus. We also give a weighted variant for the generating polynomial $Q_g^n(x)$ where $x$ is a parameter taking the number of…

In this paper we obtain cyclic pentagons and hexagons with rational sides, diagonals and area all of which are expressed in terms of rational functions of several arbitrary rational parameters. On suitable scaling, we obtain cyclic…

We study the geometric structure of Poncelet $n$-gons from a projective point of view. In particular we present explicit constructions of Poncelet $n$-gons for certain $n$ and derive algebraic characterisations in terms of bracket…

A survey of enumeration problems arising from the study of graphs formed when the edges of a polygon are marked with evenly spaced points and every pair of points is joined by a line. A few of these problems have been solved, a classical…

The new concept of a system of hex equations is introduced as an overdetermined system of six five-point face-centered quad equations defined on six vertices of a hexagon. For a consistent system of hex equations, two variables on…

A classical theorem of MacMahon states that the number of lozenge tilings of any centrally symmetric hexagon drawn on the triangular lattice is given by a beautifully simple product formula. In this paper we present a counterpart of this…

Simultaneous diagonal flips in plane triangulations are investigated. It is proved that every $n$-vertex triangulation with at least six vertices has a simultaneous flip into a 4-connected triangulation, and that it can be computed in O(n)…

We demonstrate the construction of several families of flexible polyhedra by extending Bricard octahedra to form larger composite flexible polyhedra. These flexible polyhedra are of genus 0 and 1, have dihedral angles that are non-constant…

A census is presented of all closed non-orientable 3-manifold triangulations formed from at most seven tetrahedra satisfying the additional constraints of minimality and P^2-irreducibility. The eight different 3-manifolds represented by…

The enumeration of lozenge tilings of hexagons with holes has been studied intensively in recent years. Researchers tried to find shapes and positions of holes in hexagonal regions so that the number of lozenge tilings of the resulting…

We develop the necessary machinery in order to prove that hexagonal tilings are uniquely determined by their Tutte polynomial, showing as an example how to apply this technique to the toroidal hexagonal tiling.

A convex figures F is called uniquely constructed if it satisfies the following condition: if F equidecomposable to a convex figure G then F is congruent to G. We classify all convex uniquely constructed figures. The paper written primary…

We compute the number of rhombus tilings of a hexagon with sides $a+2,b+2,c+2,a+2,b+2,c+2$ with three fixed tiles touching the border. The particular case $a=b=c$ solves a problem posed by Propp. Our result can also be viewed as the…

A smooth compactification X<n> of the configuration space of n distinct labeled points in a smooth algebraic variety X is constructed by a natural sequence of blowups, with the full symmetry of the permutation group S_n manifest at each…

We compute the number of rhombus tilings of a hexagon with sides $N,M,N,N,M,N$, which contain a fixed rhombus on the symmetry axis that cuts through the sides of length $M$.