相关论文: On angles formed by $N$ points of the Euclidean an…
The aim of this paper is to survey and extend results concerning bounds of the Euclidean minima of abelian number fields. In particular, we give upper bounds for the Euclidean minima of abelian number fields of prime power conductor.
This note initiates an investigation of packing links into a region of Euclidean space to achieve a maximal density subject to geometric constraints. The upper bounds obtained apply only to the class of homotopically essential links and…
Complete hyperbolicity of small Euclidean balls with respect to a C^1-smooth almost complex structure standard at origin is improved to give a complete hyperbolicity of strictly pseudoconvex domains. More precise (and lower) regularity…
We study closed geodesics on hyperbolic surfaces, and give bounds for their angles of intersection and self-intersection, and for the sides of the polygons that they form, depending only on the lengths of the geodesics
There are three complete plane geometries of constant curvature: spherical, Euclidean and hyperbolic geometry. We explain how a closed oriented surface can carry a geometry which locally looks like one of these. Focussing on the hyperbolic…
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…
In this paper we obtain a new lower bound on the Erd\H{o}s distinct distances problem in the plane over prime fields. More precisely, we show that for any set $A\subset \mathbb{F}_p^2$ with $|A|\le p^{7/6}$, the number of distinct distances…
Combining $2$-descent techniques with Riemann-Roch and B\'ezout's theorems, we give an upper bound on the number of rational points of bounded height on elliptic and hyperelliptic curves over function fields of characteristic $\neq 2$. We…
Solution of Helmholtz equation with impedance boundary condition on finite interval is equivalently reformulated as steady state of initial boundary value problem for first order hyperbolic system of partial differential equations.…
We study the sup-norm and mean-square-norm problems for Eisenstein series on certain arithmetic hyperbolic orbifolds, producing sharp exponents for the modular surface and Picard 3-fold. The methods involve bounds for Epstein zeta…
A graph is called (generically) rigid in R^d if, for any choice of sufficiently generic edge lengths, it can be embedded in R^d in a finite number of distinct ways, modulo rigid transformations. Here, we deal with the problem of determining…
We consider here a generalization of a well known discrete dynamical system produced by the bisection of reflection angles that are constructed recursively between two lines in the Euclidean plane. It is shown that similar properties of…
We provide an explicit lower bound for the sytole in principal congruence covers of compact quaternionic hyperbolic manifolds. We also prove the optimality of this lower bound.
Consider the planar restricted $(N+1)$-body problem with trajectories of the $N(\ge 2)$ primaries forming a collision-free periodic solution of the $N$-body problem, for any positive energy $h$ and directions $\theta_{\pm} \in [0, 2\pi)$,…
The purpose of the present paper is to prove existence of super-exponentially many compact orientable hyperbolic arithmetic $n$-manifolds that are geometric boundaries of compact orientable hyperbolic $(n+1)$-manifolds, for any $n \geq 2$,…
The hexagon is the least-perimeter tile in the Euclidean plane. On hyperbolic surfaces, the isoperimetric problem differs for every given area. Cox conjectured that a regular $k$-gonal tile with 120-degree angles is isoperimetric for its…
The continuous point symmetry algebra of the hyperbolic Ernst equation is presented. In a second step the corresponding group transformations are considered. Accordingly, the solutions of the hyperbolic Ernst equation that are invariant…
We discuss non-Euclidean deterministic and stochastic algorithms for optimization problems with strongly and uniformly convex objectives. We provide accuracy bounds for the performance of these algorithms and design methods which are…
We determine the maximal hyperplane sections of the regular $n$-simplex, if the distance of the hyperplane to the centroid is fairly large, i.e. larger than the distance of the centroid to the midpoint of edges. Similar results for the…
The Illumination Problem may be phrased as the problem of covering a convex body in Euclidean $n$-space by a minimum number of translates of its interior. By a probabilistic argument, we show that, arbitrarily close to the Euclidean ball,…