Related papers: Solid angles associated to Minkowski reduced bases
A lattice is called well-rounded if its minimal vectors span the corresponding Euclidean space. In this paper we completely describe well-rounded full-rank sublattices of ${\mathbb Z}^2$, as well as their determinant and minima sets. We…
We study lattice points on hyperbolic circles centred at Heegner points of class number one. Our main result is that, on a density one subset of radii tending to infinity, the angles of such points equidistribute on the unit circle. To…
In the first paper of this series, we constructed a family of lattices in dimensions 2^{n+1} for positive integers n, and proved that the associated lattice packings of spheres equal or exceed the previous records for several values of n.…
The present paper establishes upper and lower bounds on the speed of approximation in a wide range of natural Diophantine approximation problems. The upper and lower bounds coincide in many cases, giving rise to optimal results in…
The unitarity of the 4D lattice theory of gravity in the case of the Minkowski signature is proved. The proof is valid only for lattices that conserve the number of degrees of freedom during time evolution. The Euclidean signature and the…
General results on convex bodies are reviewed and used to derive an exact closed-form parametric formula for the Minkowski sum boundary of $m$ arbitrary ellipsoids in $N$-dimensional Euclidean space. Expressions for the principal curvatures…
Spacetimes obtained by dimensional reduction along lattices containing a lightlike direction can admit semigroup extensions of their isometry groups. We show by concrete examples that such a semigroup can exhibit a natural order, which in…
A new lower bound on the average reconstruction error variance of multidimensional sampling and reconstruction is presented. It applies to sampling on arbitrary lattices in arbitrary dimensions, assuming a stochastic process with constant,…
We present a new proof of the Willmore inequality for an arbitrary bounded domain $\Omega\subset\mathbb{R}^{n}$ with smooth boundary. Our proof is based on a parametric geometric inequality involving the electrostatic potential for the…
We study the breaking of rotational symmetry on the lattice for irreducible tensor operators and practical methods for suppressing this breaking. We illustrate the features of the general problem using an $\alpha$ cluster model for…
We investigate a variational problem in the Lorentz-Minkowski space $\l^3$ whose critical points are spacelike surfaces with constant mean curvature and making constant contact angle with a given support surface along its common boundary.…
We show that the presence of a lightish scalar resonance, $\sigma$, that mixes with the composite Goldstone-Higgs boson can relax the typical bounds found in this class of models. This mechanism, inbred in models with a walking dynamics…
A classical theorem of Minkowski and Hlawka states that there exists a lattice in R^n with packing density at least 2^{1-n}. Buser and Sarnak proved the analogue of this result in the context of complex abelian varieties. Here we give an…
Let $M^n$ be an $n$-dimensional closed minimal submanifold immersed in the unit sphere $\mathbb{S}^{n+m}$. Denote by $S$ and $\rho^{\perp}$ the squared norm of the second fundamental form and the normal scalar curvature of $M^n$,…
We study lattice points in d-dimensional spheres, and count their number in thin spherical segments. We found an upper bound depending only on the radius of the sphere and opening angle of the segment. To obtain this bound we slice the…
We show that the number of lattice directions in which a d-dimensional convex body in R^d has minimum width is at most 3^d-1, with equality only for the regular cross-polytope. This is deduced from a sharpened version of the 3^d-theorem due…
A lattice reduction is an algorithm that transforms the given basis of the lattice to another lattice basis such that problems like finding a shortest vector and closest vector become easier to solve. We define a class of bases called…
We show that a large fraction of the data-structure lower bounds known today in fact follow by reduction from the communication complexity of lopsided (asymmetric) set disjointness. This includes lower bounds for: * high-dimensional…
We explore the breaking of rotational symmetry on the lattice for bound state energies and practical methods for suppressing this breaking. We demonstrate the general problems associated with lattice discretization errors and finite-volume…
Results are obtained for two minimization problems: $$I_k(c)=\inf \{\lambda_k(\Omega): \Omega\ \textup{open, convex in}\ \mathbb{R}^m,\ \mathcal{T}(\Omega)= c \},$$ and $$J_k(c)=\inf\{\lambda_k(\Omega): \Omega\ \textup{quasi-open in}\…