Related papers: Primitive Euler brick generator
The investigation of the relation among the distances of an arbitrary point in the Euclidean space $\mathbb{R}^n$ to the vertices of a regular $n$-simplex in that space has led us to the study of simplices having a regular facet. Calling an…
Given n points in Euclidean space E^d, we propose an algebraic algorithm to compute the best fitting (d-1)-cylinder. This algorithm computes the unknown direction of the axis of the cylinder. The location of the axis and the radius of the…
In this note we will present how Euler's investigations on various different subjects lead to certain properties of the Legendre polynomials. More precisely, we will show that the generating function and the difference equation for the…
If $S=\{v_1,\ldots, v_k\}$ is an ordered subset of vertices of a connected graph $G$ and $e$ is an edge of $G$, then the vector $r_G(e|S) = (d_G(v_1,e), \ldots, d_G(v_k,e))$ is the edge metric $S$-representation of $e$. If the vertices of…
We establish recurrences formulas of the order of the classical groups that allow us to find a generalization of Euler's angles for classical groups and the invariant measures of these groups. We find the generating function for the SU(2)…
Consider two elements in the tangent bundle of the Euclidean plane $(x,X),(y,Y)\in T{\mathbb R}^2$. In this work we address the problem of characterizing the paths of bounded curvature and minimal length starting at $x$, finishing at $y$…
In the projective planes $\mathrm{PG}(2,q)$, we collect the smallest known sizes of complete arcs for the regions \begin{align*} &\mbox{all } q\le160001,~~ q \mbox{ prime power};\\ &Q_{4}=\{34 \mbox{ sporadic }q'\mbox{s in the interval…
In a Maker-Breaker game on a graph $G$, Breaker and Maker alternately claim edges of $G$. Maker wins if, after all edges have been claimed, the graph induced by his edges has some desired property. We consider four Maker-Breaker games…
In two papers, Little and Sellers introduced an exciting new combinatorial method for proving partition identities which is not directly bijective. Instead, they consider various sets of weighted tilings of a $1 \times \infty$ board with…
An Euler tour of a hypergraph is a closed walk that traverses every edge exactly once; if a hypergraph admits such a walk, then it is called eulerian. Although this notion is one of the progenitors of graph theory --- dating back to the…
A folklore proof of Euclid's theorem on the infinitude of primes uses the Euler product and the irrationality of $\zeta(2) = \pi^2/6$. A quantified form of Euclid's Theorem is Bertrand's postulate $p_{n+1} < 2p_n$. By quantifying the…
E731 in the Enestrom index. Originally published as "Solutio problematis ob singularia calculi artificia memorabilis", Memoires de l'academie des sciences de St-Petersbourg 2 (1810), 3-9. For $z$ the distance from the origin, and $v$ a…
We classify the minimum volume smooth complex hyperbolic surfaces that admit smooth toroidal compactifications, and we explicitly construct their compactifications. There are five such surfaces and they are all arithmetic, i.e., they are…
The family of snarks -- connected bridgeless cubic graphs that cannot be 3-edge-coloured -- is well-known as a potential source of counterexamples to several important and long-standing conjectures in graph theory. These include the cycle…
We give an explicit formula for Euler characteristics of line bundles on the Hilbert scheme of points on $\mathbb{P}^1\times\mathbb{P}^1$. Combined with structural results of Ellingsrud, G\"ottsche, and Lehn, this determines the Euler…
Pythagorean triples are the positive integer solutions to the Pythagoras equation for right triangles, a2+b2 = c2. They have been studied for many years, many centuries in fact. In this short paper we present a method for computing…
We show that a problem of deleting a minimum number of vertices from a graph to obtain a graph embeddable on a surface of a given Euler genus is solvable in time $2^{C_g \cdot k^2 \log k} n^{O(1)}$, where $k$ is the size of the deletion…
We determine the rational integers x,y,z such that x^3+y^9=z^2 and gcd(x,y,z)=1. First we determine a finite set of curves of genus 10 such that any primitive solution to x^3+y^9=z^2 corresponds to a rational point on one of those curves.…
Let $F$ be a field and let $E$ be an \'etale algebra over $F$, that is, a finite product of finite separable field extensions $E = F_1 \times \dots \times F_r$. The classical primitive element theorem asserts that if $r = 1$, then $E$ is…
The ternary Goldbach conjecture states that every odd number n>=7 is the sum of three primes. The estimation of sums of the form \sum_{p\leq x} e(\alpha p), \alpha = a/q + O(1/q^2), has been a central part of the main approach to the…