Related papers: Counting all regular octahedrons in {0,1,...,n}^3
An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). It is a long unsolved problem to determine whether every polyhedron…
This paper presents some algorithmic techniques to compute explicitly the noetherian operators associated to a class of ideals and modules over a polynomial ring. The procedures we include in this work can be easily encoded in computer…
It is well-known that every isosceles tetrahedron (disphenoid) admits infinitely many simple closed geodesics on its surface. They can be naturally enumerated by pairs of co-prime integers $n > m > 1$ with two additional cases $(1,0)$ and…
We introduce and study arithmetic polygons. We show that these arithmetic polygons are connected to triples of square pyramidal numbers. For every odd $N\geq3$, we prove that there is at least one arithmetic polygon with $N$ sides. We also…
We discuss the problem of embedding graphs in the plane with restrictions on the vertex mapping. In particular, we introduce a technique for drawing planar graphs with a fixed vertex mapping that bounds the number of times edges bend. An…
A closed plane meander of order n is a closed self-avoiding loop intersecting an infinite line 2n times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm, based on…
We introduce a family of piecewise isometries $f_s$ parametrized by $s \in [0,1)$ on the surface of a regular tetrahedron, which we call the tetrahedral twists. This family of maps is similar to the PETs constructed by Patrick Hooper. We…
A $0,1$ matrix is said to be regular if all of its rows and columns have the same number of ones. We prove that for infinitely many integers $k$, there exists a square regular $0,1$ matrix with binary rank $k$, such that the Boolean rank of…
We geometrically prove that in a d-dimensional cube with edges of length n, the number of particular d-dimensional tetrahedrons are given by Eulerian numbers. These tetrahedrons tassellate the cube, In this way the sum of the cubes are the…
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…
Problems on repeated geometric patterns in finite point sets in Euclidean space are extensively studied in the literature of combinatorial and computational geometry. Such problems trace their inspiration to Erd\H{o}s' original work on that…
In "Unsolved Problems in Number Theory" problem D22 Richard Guy asked for the existence of simplices with integer lengths, areas, volumes... In dimension two this is well known, these triangles are called Heron triangles. Here I will…
We count the number of rational elliptic curves of bounded naive height that have a rational $N$-isogeny, for $N \in \{2,3,4,5,6,8,9,12,16,18\}$. For some $N$, this is done by generalizing a method of Harron and Snowden. For the remaining…
In this paper, we compute the spectral norms of the matrices related with integer squences and we give some example related with Fibonacci, Lucas, Pell and Perrin numbers.
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. A special case solves a problem posed by Jim Propp.
We introduce the multi-width of a lattice polytope and use this to classify and count all lattice tetrahedra with multi-width $(1,w_2,w_3)$. The approach used in this classification can be extended into a computer algorithm to classify…
In this paper, we develop a systematic approach to enumerate curves with a certain number of nodes and one further singularity which maybe more degenerate. As a result, we obtain an explicit formula for the number of curves in a…
We prove an integral formula for continuous paths of rectangles inscribed in a piecewise smooth loop. We then use this integral formula to show that (with a very mild genericity hypothesis) the number of rectangle coincidences, informally…
We classify all sets of nonzero vectors in $\mathbb{R}^3$ such that the angle formed by each pair is a rational multiple of $\pi$. The special case of four-element subsets lets us classify all tetrahedra whose dihedral angles are multiples…
Three--dimensional colored triangulations are gluings of tetrahedra whose faces carry the colors 0, 1, 2, 3 and in which the attaching maps between tetrahedra are defined using the colors. This framework makes it possible to generalize the…