Related papers: Classifying Diophantine parallelepipeds
A general construction yielding infinitely many families of $D(m^2)$-triples of triangular numbers is presented. Moreover, each triple obtained from this construction contains the same triangular number $T_n$.
This article introduces the theory of Veronese polytopes, a broad generalisation of cyclic polytopes. These arise as convex hulls of points on curves with one or more connected components, obtained as the image of the rational normal curve…
We present a heuristic that suggests that ranks of elliptic curves over the rationals are bounded. In fact, it suggests that there are only finitely many elliptic curves of rank greater than 21. Our heuristic is based on modeling the ranks…
We give a complete enumeration of all 2-neighborly $d$-polytopes with $d+9$ and less facets. All of them are realized as 0/1-polytopes, except a 6-polytope $P_{6,10,15}$ with 10 vertices and 15 facets, and pyramids over $P_{6,10,15}$. In…
We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing…
In characteristic $p>0$ and for $q$ a power of $p$, we compute the number of nonplanar rational curves of arbitrary degrees on a smooth Hermitian surface of degree $q+1$ under the assumption that the curves have a parametrization given by…
Let \[ \mathcal{E}_A=\{x\in\mathbb{R}^n:x^{\top}A^{-1}x\le 1\},\qquad n\ge2, \] where $A$ is real symmetric positive definite. We study full-dimensional parallelepipeds whose $2^n$ vertices lie on $\partial\mathcal{E}_A$. First we show that…
PhD dissertation consists in three lines of investigation involving rational elliptic surfaces, namely 1) a study of conic bundles on these surfaces; 2) an investigation of the possible intersection numbers of two sections and 3) a theorem…
A rectangular parallelepiped is called a cuboid (standing box). It is called perfect if its edges, face diagonals and body diagonal all have integer length. Euler gave an example where only the body diagonal failed to be an integer (Euler…
This paper is a continuation of an earlier one, and completes a classification of the configurations of points in a plane lattice that determine angles that are rational multiples of ${\pi}$. We give a complete and explicit description of…
A fixed set of vertices in the plane may have multiple planar straight-line triangulations in which the degree of each vertex is the same. As such, the degree information does not completely determine the triangulation. We show that even if…
Given $n$ lines in general position in the plane, how many bounded triangular faces can the arrangement have? We construct a straight-line affine arrangement of $19$ lines satisfying the conditions of the iterative construction by…
Icosahedron and dodecahedron can be dissected into tetrahedral tiles projected from 3D-facets of the Delone polytopes representing the deep and shallow holes of the root lattice D_6. The six fundamental tiles of tetrahedra of edge lengths 1…
We obtain a recursive formula for the number of rational degree $d$ curves in $\mathbb{CP}^2$ that pass through $3d+1-m$ generic points and that have an $m$-fold singular point. The special case of counting curves with a triple point was…
Every regular map on a closed surface gives rise to generally six regular maps, its "Petrie relatives", that are obtained through iteration of the duality and Petrie operations (taking duals and Petrie-duals). It is shown that the skeletal…
We estimate from below the number of lines meeting each of given 4 disjoint smooth closed curves in a given cyclic order in the real projective 3-space and in a given linear order in the Euclidean 3-space. Similarly, we estimate the number…
It is well known that, among closed spherical Seifert three-manifolds, only lens spaces and prism manifolds admit several Seifert fibrations which are not equivalent up to diffeomorphism. Moreover the former admit infinitely many…
We prove that a face of a cube can be optimally partitioned into connected 193 sets on which the cut locus, or ridge tree, is constant up to isomorphism as a labeled graph. These are 60 connected open sets, curves bounding them, and…
An $N$-tiling of triangle $ABC$ by triangle $T$ (the `tile') is a way of writing $ABC$ as a union of $N$ copies of $T$ overlapping only at their boundaries. Let the tile $T$ have angles $(\alpha,\beta,\gamma)$, and sides $(a,b,c)$. This…
We analyze polyhedra composed of hexagons and triangles with three faces around each vertex, and their 3-regular planar graphs of edges and vertices, which we call "trihexes". Trihexes are analogous to fullerenes, which are 3-regular planar…