Related papers: Primitive Euler brick generator
The sister of Eisenstein-Picard modular group was described in [8]. In this paper we give a similar definition of the sister of the Euclidean-Picard modular group and find its generators by using a geometric method.
We construct compact arbitrary Euler characteristic orientable and non-orientable minimal surfaces in the Berger spheres. Besides we show an interesting family of surfaces that are minimal in every Berger sphere, characterizing them by this…
Let ${\mathbf U}_q^-$ be the negative half of a quantum group of finite type. We construct the canonical basis of ${\mathbf U}_q^-$ by applying the folding theory of quantum groups, and piecewise linear parametrization of canonical basis.…
We present a method to construct a large family of Lagrangian surfaces in complex Euclidean plane by using Legendre curves in the 3-sphere and in the anti de Sitter 3-space or, equivalently, by using spherical and hyperbolic curves,…
A connected graph G with at least two vertices is matching covered if each of its edges lies in a perfect matching. We say that an edge e in a matching covered graph G is removable if G-e is matching covered. A pair {e; f} of edges of a…
We will calculate completely the Grothendieck rings, in the sense of first order logic, of o-minimal expansions of ordered abelian groups by introducing the notion of the bounded Euler characteristic.
This is a translation of Leonhard Euler's ``De quadratis magicis'' . It is E795 in the Enestrom index. This paper studies how to construct magic squares with certain numbers of cells, in particular 9, 16, 25 and 36. It considers some…
A graph $G$ of order $n$ is called edge-pancyclic if, for every integer $k$ with $3 \leq k \leq n$, every edge of $G$ lies in a cycle of length $k$. Determining the minimum size $f(n)$ of a simple edge-pancyclic graph with $n$ vertices…
Graphs that are critical (minimal excluded minors) for embeddability in surfaces are studied. In Part I we consider the structure of graphs with a 2-vertex-cut that are critical with respect to the Euler genus. A general theorem describing…
Every regular polygon can be regarded as a member of a well-defined 'family' of related regular polygons. These families arise naturally in the study of piecewise rotations such as outer billiards. In some cases they exist on all scales and…
The Euler characteristic $\chi =|V|-|E|$ and the total length $\mathcal{L}$ are the most important topological and geometrical characteristics of a metric graph. Here, $|V|$ and $|E|$ denote the number of vertices and edges of a graph. The…
The Euclidean dimension a graph $G$ is defined to be the smallest integer $d$ such that the vertices of $G$ can be located in $\mathbb{R}^d$ in such a way that two vertices are unit distance apart if and only if they are adjacent in $G$. In…
A new way of constructing fusion bases (i.e., the set of inequalities governing fusion rules) out of fusion elementary couplings is presented. It relies on a polytope reinterpretation of the problem: the elementary couplings are associated…
Primal and dual algorithms are developed for solving the $n$-dimensional convex optimization problem of finding the Euclidean ball of minimum radius that covers $m$ given Euclidean balls, each with a given center and radius. Each algorithm…
Tilings of a surface of negative Euler characteristic by n-gons with n\ge 7 is a finite problem. We develop the algorithm for finding all the tilings for fixed number of tiles and present the calculation for tilings of surfaces of small…
If $\alpha\in\r$, an $\alpha$-stationary surface in Euclidean space is a surface $\Sigma$ whose mean curvature $H$ satisfies $H(p)=\alpha |p|^{-2} \langle\nu,p\rangle$, $p\in\Sigma$. These surfaces generalize in dimension two a classical…
We present a formal version of the numbers of vertices, edges, and faces for infinite planar regular triangular meshes of degree r>6. These numbers are defined via Euler summation of sequences obtained from iterated expansions of a convex…
The Heilbronn triangle problem asks for the placement of $n$ points in a unit square that maximizes the smallest area of a triangle formed by any three of those points. In $1972$, Schmidt considered a natural generalization of this problem.…
We prove the existence of Ulrich sheaves on the Hilbert scheme of two points on a polarized K3 surface or an abelian surface. The construction proceeds by descending Ulrich bundles on the surface to the symmetric square and lifting them to…
We study $\mathbb{S}_n$-equivariant weight-graded and topological Euler characteristics of the universal Picard stack $\mathrm{Pic}_{g, n}^d \to \mathcal{M}_{g, n}$ of degree-$d$ line bundles over $\mathcal{M}_{g, n}$. We prove that in the…