Related papers: The Integer Cuboid Table
Unextendible product bases have been shown to have many important uses in quantum information theory, particularly in the qubit case. However, very little is known about their mathematical structure beyond three qubits. We present several…
We discover suprising connections between three seemingly different problems: finding right triangles with rational sides in a non-Euclidean geometry, finding three integers such that the difference of the squares of any two is a square,…
For an integer $k\geq 1$, a graph is called a $k$-circulant if its automorphism group contains a cyclic semiregular subgroup with $k$ orbits on the vertices. We show that, if $k$ is even, there exist infinitely many cubic arc-transitive…
A fullerene graph is a cubic bridgeless plane graph with only pentagonal and hexagonal faces. We exhibit an infinite family of fullerene graphs of diameter $\sqrt{4n/3}$, where $n$ is the number of vertices. This disproves a conjecture of…
A quadrangle in the Euclidean plane is called $n$-self-affine if it has a dissection into $n$ affine images of itself. All convex quadrangles are known to be $n$-self-affine for every $n \ge 5$. The only $2$-self-affine convex quadrangles…
In this article we present theoretical and computational results on the existence of polyhedral embeddings of graphs. The emphasis is on cubic graphs. We also describe an efficient algorithm to compute all polyhedral embeddings of a given…
An effective search bound is established for the least non-trivial integer zero of an arbitrary integral cubic form in at least 17 variables.
This article discusses two versions of elliptic equations obtained from a system of equations describing a rational cuboid. Analysis of elliptic equations shows that they are equivalent, and that there are rational points on the elliptic…
A cube is an 8-rep-tile: it is the union of eight smaller copies of itself. Is there a set with a hole which has this property? The computer found an interesting and complicated solution, which then could be simplified. We discuss some…
The identity of the smallest quadrangulation with minimum degree 3 also containing parallel edges is unknown. However, it has already been determined that its order (the number of vertices) is between 11 and 14. This paper narrows this…
This paper deals with finite cubic ($3$-regular) graphs whose automorphism group acts transitively on the edges of the graph. Such graphs split into two broad classes, namely arc-transitive and semisymmetric cubic graphs, and then these…
For a finite set $U$ of directions in the Euclidean plane, a convex non-degenerate polygon $P$ is called a $U$-polygon if every line parallel to a direction of $U$ that meets a vertex of $P$ also meets another vertex of $P$. We characterize…
This paper addresses the problem of determining the maximum number of edges in a unit distance graph (UDG) of $n$ vertices using computer search. An unsolved problem of Paul Erd\H{o}s asks the maximum number of edges $u(n)$ a UDG of $n$…
We show that convex pentagons that can generate edge-to-edge monohedral tilings of the plane can be classified into exactly eight types. Using these results, it is also proved that no single convex polygon can be an aperiodic prototile…
We show that a matchstick graph with $n$ vertices has no more than $3n-c\sqrt{n-1/4}$ edges, where $c=\frac12(\sqrt{12} + \sqrt{2\pi\sqrt{3}})$. The main tools in the proof are the Euler formula, the isoperimetric inequality, and an upper…
We construct the first linear strand of the minimal free resolutions of edge ideals of $d$-partite $d$-uniform clutters. We show that the first linear strand is supported on a relative simplicial complex. In the case that the edge ideals of…
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…
Diophantine tuples are of ancient and modern interest, with a huge literature. In this paper we study Diophantine graphs, i.e., finite graphs whose vertices are distinct positive integers, and two vertices are linked by an edge if and only…
We propose an effective algorithm that enumerates (and actually finds) all 3-edge colorings and Hamiltonian cycles in a cubic graph. The idea is to make a preliminary run that separates the vertices into two types: ``rigid'' (such that the…
We study each of the 16 types of complete intersection Calabi-Yau threefolds in projective n-space times the projective line, for various n, and prove existence of isolated rational curves of bidegree (d,0) for all positive integers d on a…