Related papers: The Integer Cuboid Table
The family of Euclidean triangles having some fixed perimeter and area can be identified with a subset of points on a nonsingular cubic plane curve, i.e., an elliptic curve; furthermore, if the perimeter and the square of the area are…
An algorithm for determining the list of smallest volume right-angled hyperbolic polyhedra in dimension 3 is described. This algorithm has been implemented on computer using the program Orb to compute volumes, and the first 825 polyhedra in…
Polypolyhedra are edge-transitive compounds of polyhedra. In this paper we use group theory to determine the number of distinct polypolyhedra whose symmetry group is any given finite irreducible Coxeter group. We apply this result in order…
A graph is called (generically) rigid in R^d if, for any choice of sufficiently generic edge lengths, it can be embedded in R^d in a finite number of distinct ways, modulo rigid transformations. Here, we deal with the problem of determining…
We consider nearly-perfect cuboids (NPC), where the only irrational is one of the face diagonals. Obtained are three rational parametrizations for NPC with one parameter.
The Hilbert basis is fundamental in describing the structure of the integer points of a polyhedral cone. The face-centered cubic grid is one of the densest packing of the 3-dimensional space. The cycles of a grid satisfy the constraint set…
We provide a complete classification of six-dimensional symmetric toroidal orbifolds which yield N>=1 supersymmetry in 4D for the heterotic string. Our strategy is based on a classification of crystallographic space groups in six…
We consider spherical quadrangulations -- spherical embeddings of multigraphs, possibly with loops, so that every face has boundary walk of length 4 -- in which all vertices have degree 3 or 4. Interpreting each degree 4 vertex as a…
A rational Diophantine m-tuple is a set of m nonzero rationals such that the product of any two of them increased by 1 is a perfect square. The first rational Diophantine quadruple was found by Diophantus, while Euler proved that there are…
Let $E$ be an elliptic curve over $\mathbb{Q}$ described by $y^2= x^3+ Kx+ L$ where $K, L \in \mathbb{Q}$. A set of rational points $(x_i,y_i) \in E(\mathbb{Q})$ for $i=1, 2, \cdots, k$, is said to be a sequence of consecutive cubes on $E$…
We construct a countable family of multi-dimensional continued fraction algorithms, built out of five specific multidimensional continued fractions, and find a wide class of cubic irrational real numbers a so that either (a, a^2) or (a,…
Eberhard proved that for every sequence $(p_k), 3\le k\le r, k\ne 5,7$ of non-negative integers satisfying Euler's formula $\sum_{k\ge3} (6-k) p_k = 12$, there are infinitely many values $p_6$ such that there exists a simple convex…
We prove that Dirichlet stereohedra for non-cubic crystallographic groups in dimension 3 cannot have more than 80 facets. The bound depends on the particular crystallographic group considered and is above 50 only on 9 of the 97 affine…
This paper considers Platonic solids/polytopes in the real Euclidean space R^n of dimension 3 <= n < infinity. The Platonic solids/polytopes are described together with their faces of dimensions 0 <= d <= n-1. Dual pairs of Platonic…
We establish a classification of cubic minimal cones in case of the so-called radial eigencubics. Our principal result states that any radial eigencubic is either a member of the infinite family of eigencubics of Clifford type, or belongs…
There are four characteristic circles for each triangle on a plane. All for are tangential to the three straight lines containing the triangles' three sides. Three are exterior circles, the fourth is the in-circle. When the triangle is…
Triple orthogonal coordinate systems having coordinate lines as circles or straight lines are considered. Technically, they are represented by trilinear rational quaternionic maps and are called Dupin cyclidic cubes, naturally generalizing…
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$…
The number of planar Eulerian maps with n edges is well-known to have a simple expression. But what is the number of planar Eulerian orientations with n edges? This problem appears to be difficult. To approach it, we define and count…
Sets of three types of convex pentagons that are aperiodic with no matching conditions on the edges are created from a chiral aperiodic monotile Tile(1, 1). This method divides the interior of Tile(1,1) into five convex polygons with five…