Related papers: Counting all regular octahedrons in {0,1,...,n}^3
The lists of facets -- $298,592$ in $86$ orbits -- and of extreme rays -- $242,695,427$ in $9,003$ orbits -- of the hypermetric cone $HYP_8$ are computed. The first generalization considered is the hypermetric polytope $HYPP_n$ for which we…
The polygon retrieval problem on points is the problem of preprocessing a set of $n$ points on the plane, so that given a polygon query, the subset of points lying inside it can be reported efficiently. It is of great interest in areas such…
We classify rotary (orientably-regular) maps whose underlying graphs are multicycles. For the multicycle $\mathrm{C}_n^{(\lambda)}$ of length $n$ and edge-multiplicity $\lambda$, we determine all rotary embeddings for $n\geqslant 3$ and…
This paper proves explicit formulas for the number of dissections of a convex regular polygon modulo the action of the cyclic and dihedral groups. The formulas are obtained by making use of the Cauchy-Frobenius Lemma as well as bijections…
In this paper we study the rotation and spatial inversion symmetry of regular tetrahedron. We obtain the representation matrix, multiplication table,the order of all group elements, all possible combinations of generator elements, the…
In this paper, we present the implicit equations for one special class of real-valued spherical harmonics with octahedral symmetry. Based on this representation, we construct the rotationally invariant measure of deviation from the…
In this case study in ``fully automated enumeration'', we illustrate how to take full advantage of symbolic computation by developing (what we call) `symbolic-dynamical-programming' algorithms for computing many terms of `hard to compute…
We present a new algorithm for computing the straight skeleton of a polygon. For a polygon with $n$ vertices, among which $r$ are reflex vertices, we give a deterministic algorithm that reduces the straight skeleton computation to a…
We consider the set of all graphs on n labeled vertices with prescribed degrees D=(d_1, ..., d_n). For a wide class of tame degree sequences D we prove a computationally efficient asymptotic formula approximating the number of graphs within…
We provide a simple way to add, multiply, invert, and take traces and norms of algebraic integers of a number field using integral matrices. With formulas for the integral bases of the ring of integers of at least a significant proportion…
The octonions are one of the four normed division algebras, together with the real, complex and quaternion number systems. The latter three hold a primary place in random matrix theory, where in applications to quantum physics they are…
We show how to enumerate words in $1^{m_1} \dots n^{m_n}$ that avoid the increasing consecutive pattern $12 \dots r$ for any $r \geq 2$. Our approach yields an $O(n^{s+1})$ algorithm to enumerate words in $1^s \dots n^s$, avoiding the…
We derive an asymptotic formula for the number of connected 3-uniform hypergraphs with vertex set $[N]$ and $M$ edges for $M=N/2+R$ as long as $R$ satisfies $R = o(N)$ and $R=\omega(N^{1/3}\ln^{2} N)$. This almost completely fills the gap…
The idea of standardised co-ordinates in three-dimensional affine space is defined, by way of the Standard tetrahedron. By performing an affine map on a general tetrahedron, we may replace the study of a general tetrahedron over a specific…
We have performed a complete enumeration of non-isotopic triples of mutually orthogonal $k\times n$ Latin rectangles for $k\leq n \leq 7$. Here we will present a census of such triples, classified by various properties, including the order…
This work is a follow-up of the article [Proc.\ London Math.\ Soc.\ 119(2):358--378, 2019], where the authors solved the problem of counting labelled 4-regular planar graphs. In this paper, we obtain a precise asymptotic estimate for the…
We consider here 6-regular plane graphs whose faces have size 1, 2 or 3. In Section 2 a practical enumeration method is given that allowed us to enumerate them up to 53 vertices. Subsequently, in Section 3 we enumerate all possible symmetry…
A graph is called homogeneously traceable if every vertex is an endpoint of a Hamilton path. In 1979 Chartrand, Gould and Kapoor proved that for every integer $n\ge 9,$ there exists a homogeneously traceable nonhamiltonian graph of order…
It is natural to expect the following loosely stated approximation principle to hold: a numerical approximation solution should be in some sense as smooth as its target exact solution in order to have optimal convergence. For piecewise…
In this paper we prove that it is possible to inscribe a regular crosspolytope (multidimensional octahedron) into a smooth convex body in $\mathbb R^d$, where $d$ is an odd prime power. Some generalizations of this statement are also…