Related papers: Perfect Parallelepipeds Exist
Skeletal polyhedra and polygonal complexes are finite or infinite periodic structures in 3-space with interesting geometric, combinatorial, and algebraic properties. These structures can be viewed as finite or infinite periodic graphs…
A perfect cuboid is formed when an Euler brick whose edges and face diagonals are all integers also has an integer internal diagonal. It is known that if a perfect cuboid exists the internal diagonal is odd. No perfect cuboid has been…
Perfect Matching-Cut is the problem of deciding whether a graph has a perfect matching that contains an edge-cut. We show that this problem is NP-complete for planar graphs with maximum degree four, for planar graphs with girth five, for…
A rational face cuboid is a cuboid that all of edges, two of three face diagonals and space diagonal have rational lengths. \[ E_{1,s}: y^2=x(x-(2s)^2)(x+(s^2-1)^2) \] for a rational number $s \neq 0, \pm 1$, and define $\tilde{A}$…
A bottleneck plane perfect matching of a set of $n$ points in $\mathbb{R}^2$ is defined to be a perfect non-crossing matching that minimizes the length of the longest edge; the length of this longest edge is known as {\em bottleneck}. The…
For every $n = 2^k > 8$ there exist exactly $[(k+1)/2]$ mutually nonequivalent $Z_4$-linear extended perfect codes with distance 4. All these codes have different ranks.
This communication describes a representation of images as a set of edges characterized by their position and orientation. This representation allows the comparison of two images and the computation of their similarity. The first step in…
The main result of this paper, is the complete parametric description of the family of triangles which have integer sidelengths and with one angle being sixty degrees.
A polygonal complex in euclidean 3-space is a discrete polyhedron-like structure with finite or infinite polygons as faces and finite graphs as vertex-figures, such that a fixed number r of faces surround each edge. It is said to be regular…
We discuss the question whether the existence of perfect matchings in a cubic graph can be seen from the spectrum of its adjacency matrix. For regular graphs in general and for three edge-disjoint perfect matchings in a cubic graph (that…
Polypolyhedra (after R. Lang) are compounds of edge-transitive 1-skeleta. There are 54 topologically different polypolyhedra, and each has icosidodecahedral, cuboctahedral, or tetrahedral symmetry, all are realizable as modular origami…
The paper is devoted to perfect and almost perfect homogeneous polytopes in Euclidean spaces. We classified perfect and almost perfect polytopes among all regular polytopes and all semiregular polytopes excepting Archimedean solids and two…
We consider a wide class of closed convex cones $K$ in the space of real $n\times n$ symmetric matrices and establish the existence of a chain of faces of $K$, the length of which is maximized at $\frac{n(n+1)}{2} + 1$. Examples of such…
The bi-orthogonal monoclinic Diophantine parallelepiped is introduced, then the s-parameters and their governing equation for the bi-orthogonal monoclinic Diophantine parallelepiped are discussed. Previous discoveries and parameterizations…
The regular 2n-gon (square, hexagon, octagon, ...) is subdivided into smaller polygons (tiles) by the subset of diagonals which run parallel to any of the 2n sides. The manuscript reports on the number of tiles up to the 78-gon.
We demonstrate the existence of four types of flexible prismatic polyhedra that can be derived or inferred from a consideration of Bricard octahedra and generalizations of Bricard octahedra. These flexible polyhedra are of genus 0 and 1,…
We define an analogue of the cube and an analogue of the 5-wedge in higher dimensions, each with $2d+2$ vertices and $d^2+2d-3$ edges. We show that these two are the only minimisers of the number of edges, amongst d-polytopes with $2d+2$…
This paper studies non-crossing geometric perfect matchings. Two such perfect matchings are \emph{compatible} if they have the same vertex set and their union is also non-crossing. Our first result states that for any two perfect matchings…
A graph $G$ is Pfaffian if it has an orientation such that each central cycle $C$ (i.e. $C$ is even and $G-V(C)$ has a perfect matching) has an odd number of edges directed in either direction of the cycle. The number of perfect matchings…
This article gives a short proof that all ideal polygons admit a short orthogeodesic decomposition. Specifically, all $n$-gons admit an orthogeodesic decomposition with orthogeodesics all of length at most $\sim 2 \log(n)$, and this is…