Related papers: Voronoi-Dickson Hypothesis on Perfect Forms and L-…

Nearly orthogonal lattices were formally defined in [4], where their applications to image compression were also discussed. The idea of ``near orthogonality" in $2$-dimensions goes back to the work of Gauss. In this paper, we focus on…

Let $G$ be a subgroup of $\mathrm{SL}(\mathbb{R}^{d+1})\ltimes\mathbb{R}^{d+1}$ obtained by adding a translation part to a torsion-free discrete subgroup of $\mathrm{SL}(\mathbb{R}^{d+1})$ dividing a convex cone in the sense of Benoist. We…

Let $S$ be a set of $n$ points in general position in $\mathbb{R}^d$. The order-$k$ Voronoi diagram of $S$, $V_k(S)$, is a subdivision of $\mathbb{R}^d$ into cells whose points have the same $k$ nearest points of $S$. Sibson, in his seminal…

In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [1-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph…

We present two methods to continuously and piecewise-linearly parametrize rank-3 lattices by vectors of $\RR^{13}$, which provides an efficient way to judge if two sets of parameters provide nearly identical lattices within their margins of…

Given a finite set of points in general position in the plane or sphere, we count the number of ways to separate those points using two types of circles: circles through three of the points, and circles through none of the points (up to an…

In 1961 Tullio Regge provided us with a beautiful lattice representation of Einstein's geometric theory of gravity. This Regge Calculus (RC) is strikingly different from the more usual finite difference and finite element discretizations of…

Polygonal chains are fundamental objects in many applications like pattern recognition and protein structure alignment. A well-known measure to characterize the similarity of two polygonal chains is the famous Fr\`{e}chet distance. In this…

Reduced-order models are essential tools to deal with parametric problems in the context of optimization, uncertainty quantification, or control and inverse problems. The set of parametric solutions lies in a low-dimensional manifold (with…

This is the continuation of the author's ArXiv presentation "On packing of Minkowski balls. I". In section 2 we investigate lattice packings of Minkowski balls and domains. By results of the proof of Minkowski conjecture about the critical…

We analyze the geometry of the tower of Lubin-Tate deformation spaces, which parametrize deformations of a one-dimensional formal module of height h together with level structure. According to the conjecture of Deligne-Carayol, these spaces…

This paper focuses on the metric properties of L\"uroth well approximable numbers, studying analogous of classical results, namely the Khintchine Theorem, the Jarn\'ik--Besicovitch Theorem, and the result of Dodson. A supplementary proof is…

In the context of nanowire heterostructures we perform a discrete to continuum limit of the corresponding free energy by means of $\Gamma$-convergence techniques. Nearest neighbours are identified by employing the notions of Voronoi…

The Voronoi Density Estimator (VDE) is an established density estimation technique that adapts to the local geometry of data. However, its applicability has been so far limited to problems in two and three dimensions. This is because…

We study and simulate N=2 supersymmetric Wess-Zumino models in one and two dimensions. For any choice of the lattice derivative, the theories can be made manifestly supersymmetric by adding appropriate improvement terms corresponding to…

Shape optimization is a challenging task in many engineering fields, since the numerical solutions of parametric system may be computationally expensive. This work presents a novel optimization procedure based on reduced order modeling,…

Lattice decoders constructed with neural networks are presented. Firstly, we show how the fundamental parallelotope is used as a compact set for the approximation by a neural lattice decoder. Secondly, we introduce the notion of…

For the Poisson equation posed in a domain containing a large number of polygonal perforations, we propose a low-dimensional coarse approximation space based on a coarse polygonal partitioning of the domain. Similarly to other multiscale…

The main goal of the article is testing a new classification algorithm. To this end we apply it to a relevant problem of describing the integrable cases of a subclass of two-dimensional lattices. By imposing the cut-off conditions…

A new algorithm for computing Hecke operators for SL(n,Z) was introduced by MacPherson, McConnell in 2020. The algorithm uses tempered perfect lattices, which are certain pairs of lattices together with a quadratic form. These generalize…