Related papers: Primitive Euler brick generator

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…

The simplest atomic nucleus, deuteron, provides key insights into the strong nuclear interactions among quarks and gluons that shape the visible universe. We present the first attempt to calculate the internal structure of the deuteron by…

Lightness and sparsity are two natural parameters for Euclidean $(1+\varepsilon)$-spanners. Classical results show that, when the dimension $d\in \mathbb{N}$ and $\varepsilon>0$ are constant, every set $S$ of $n$ points in $d$-space admits…

We define the simplest log-euclidean geometry. This geometry exposes a difficulty hidden in Hilbert's list of axioms presented in his "Grundlagen der Geometrie". The list of axioms appears to be incomplete if the foundations of geometry are…

A finite simple graph is called a 2-graph if all of its unit spheres S(x) are cyclic graphs of length 4 or larger. A 2-graph G is Eulerian if all vertex degrees of G are even. An edge refinement of a graph splits an edge (a,b) to two edges…

For any positive integer $q$, the sequence of the Euler up/down numbers reduced modulo $q$ was proved to be ultimately periodic by Knuth and Buckholtz. Based on computer simulations, we state for each value of $q$ precise conjectures for…

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 consider the problem of computing the Euler characteristic of an abstract simplicial complex given by its vertices and facets. We show that this problem is #P-complete and present two new practical algorithms for computing Euler…

The purpose of this article is three-fold. First, we apply a general theorem from our earlier work to produce many new minimal doublings of the Clifford Torus in the round three-sphere. This construction generalizes and unifies prior…

Let $C_{k_1}, \ldots, C_{k_n}$ be cycles with $k_i\geq 2$ vertices ($1\le i\le n$). By attaching these $n$ cycles together in a linear order, we obtain a graph called a polygon chain. By attaching these $n$ cycles together in a cyclic…

The oddness of a cubic graph is the smallest number of odd circuits in a 2-factor of the graph. This invariant is widely considered to be one of the most important measures of uncolourability of cubic graphs and as such has been repeatedly…

Given $k\ge3$ and $1\leq \ell< k$, an $(\ell,k)$-cycle is one in which consecutive edges, each of size $k$, overlap in exactly $\ell$ vertices. We study the smallest number of edges in $k$-uniform $n$-vertex hypergraphs which do not contain…

In this paper we compute the gonality and the dimension of the Brill-Noether loci $W^1_d(C)$ for curves in a non primitive linear system of a simple abelian surface, adapting vector bundles techniques \`a la Lazarsfeld originally introduced…

We develop Teichmuller theoretical methods to construct new minimal surfaces in $\BE^3$ by adding handles and planar ends to existing minimal surfaces in $\BE^3$. We exhibit this method on an interesting class of minimal surfaces which are…

We propose a Law of Nature? Viz., Pure Regularity Occurs at Na\"ive Levels and Regularity has Affinity with Evenness. In a series of three papers, it was established that regular Euler graphs with only one type of (pure) cycles are…

We found a new formulation to the Euler-Lagrange equation of the Willmore functional for immersed surfaces in ${\R}^m$. This new formulation of Willmore equation appears to be of divergence form, moreover, the non-linearities are made of…

Every Euclidean domain $R$ has a minimal Euclidean function, $\phi_R$. A companion paper \cite{Graves} introduced a formula to compute $\phi_{\mathbb{Z}[i]}$. It is the first formula for a minimal Euclidean function for the ring of integers…

In this article, we construct traveling-rotating helical vortices with small cross-section to the 3D incompressible Euler equations in an infinite pipe, which tend asymptotically to singular helical vortex filament evolved by the binormal…

The Ulam sequence is defined as $a_1 =1, a_2 = 2$ and $a_n$ being the smallest integer that can be written as the sum of two distinct earlier elements in a unique way. This gives $$1, 2, 3, 4, 6, 8, 11, 13, 16, 18, 26, 28, 36, 38, 47,…

Axial algebras of Jordan type $\eta$ are commutative algebras generated by idempotents whose adjoint operators have the minimal polynomial dividing $(x-1)x(x-\eta)$, where $\eta\not\in\{0,1\}$ is fixed, with restrictive multiplication…