Related papers: Primitive Euler brick generator
Postulating that spacetime is discrete, we assume that physical space is described by a 3-dimensional cubic lattice.The corresponding symmetry group of rotations has order 24 and motivates the introduction of a cubic shaped graph with 27…
E727 in the Enestrom index. This is a translation from the Latin original "Accuratior evolutio problematis de linea brevissima in superficie quacunque ducenda" (1779). Given a surface $pdx+qdy+rdz=0$, Euler wants to develop equations that…
A triangulation of a surface is \emph{irreducible} if there is no edge whose contraction produces another triangulation of the surface. We prove that every irreducible triangulation of a surface with Euler genus $g\geq1$ has at most $13g-4$…
A $d$-dimensional brick is a set $I_1\times \cdots \times I_d$ where each $I_i$ is an interval. Given a brick $B$, a brick partition of $B$ is a partition of $B$ into bricks. A brick partition $\mathcal{P}_d$ of a $d$-dimensional brick is…
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,…
We construct an initial data for two-dimensional Euler equation in a disk for which the gradient of vorticity exhibits double exponential growth in time for all times. This estimate is known to be sharp - the double exponential growth is…
A Pythagorean triple is a triple of positive integers $(x,y,z)$ such that $x^2+y^2=z^2$. If $x,y$ are coprime and $x$ is odd, then it is called a primitive Pythagorean triple. Berggren showed that every primitive Pythagorean triple can be…
The basis number of a graph $G$ is the smallest integer $k$ such that $G$ admits a basis $B$ for its cycle space, where each edge of $G$ belongs to at most $k$ members of $B$. In this note, we show that every non-planar graph that can be…
Substantial efforts have been made to compute or estimate the minimum number $c(G)$ of cycles needed to partition the edges of an Eulerian graph. We give an equivalent characterization of Eulerian graphs of treewidth $2$ and with maximum…
A set $\mathbb{Y}$ of elements (vertices or edges) in space is said to be a $generator$ of a metric space if each element of the space is recognized by its distances from the elements of $\mathbb{Y}$, uniquely. The generator with minimum…
We prove that every minimal brick on n vertices has at least n/9 vertices of degree at most 4.
It is well-known that pythagorean triples can be represented by points of the unit circle with rational coordinates. These points form an abelian group, and we describe its structure. This structural description yields, almost immediately,…
The classical Apollonius' problem is to construct circles that are tangent to three given circles in a plane. This problem was posed by Apollonius of Perga in his work "Tangencies". The Sylvester problem, which was introduced by the English…
We report a small advance on a question raised by Robertson, Schweitzer, and Wagon in [RSW02]. They constructed a genus-13 polyhedron built from bricks without corners, and asked whether every genus-0 such polyhedron must have a corner. A…
Given an initial family of sets, we may take unions, intersections and complements of the sets contained in this family in order to form a new collection of sets; our construction process is done recursively until we obtain the last family.…
We show that the space of Euclid's parameters for Pythagorean triples is endowed with a natural symplectic structure and that it emerges as a spinor space of the Clifford algebra $\mathbb{R}_{2,1}$, whose minimal version may be…
Let $\alpha(n)$ be the least number $k$ for which there exists a simple graph with $k$ vertices having precisely $n \geq 3$ spanning trees. Similarly, define $\beta(n)$ as the least number $k$ for which there exists a simple graph with $k$…
This is an English translation from the Latin original of Leonhard Euler's ``Solutio facilior problematis Diophantei circa triangulum, in quo rectae ex angulis latera opposita bisecantes rationaliter exprimantur''. In this paper, Euler…
A proper Euler's magic matrix is an integer $n\times n$ matrix $M\in\mathbb Z^{n\times n}$ such that $M\cdot M^t=\gamma\cdot I$ for some nonzero constant $\gamma$, the sum of the squares of the entries along each of the two main diagonals…
Beineke, Harary and Ringel discovered a formula for the minimum genus of a torus in which the $n$-dimensional hypercube graph can be embedded. We give a new proof of the formula by building this surface as a union of certain faces in the…