Related papers: Hyperbolic lattice point counting in unbounded ran…

For families of knots and links given in Conway notation we compute lower maximal and upper minimal bound of hyperbolic volume by using source links and augmented links.

We prove noncoherence of certain families of lattices in the isometry group of the hyperbolic n-space for n greater than 3. For instance, every nonuniform arithmetic lattice in SO(n,1) is noncoherent, provided that n is at least 6.

In many machine learning and data related applications, it is required to have the knowledge of approximate ranks of large data matrices at hand. In this paper, we present two computationally inexpensive techniques to estimate the…

Euclidean lattices occupy a central position in number theory, the geometry of numbers, and modern cryptography. In the present article, the theory of Euclidean lattices is employed to investigate normed $\mathbb{Z}$-modules of finite rank.…

In this short note we collect together known results on the use of Random Matrix Theory in lattice statistical mechanics. The purpose here is two fold. Firstly the RMT analysis provides an intrinsic characterization of integrability, and…

We establish effective counting and equidistribution results for lattice points in families of domains in hyperbolic spaces, of any dimension and over any field. The domains we focus on are defined as product sets with respect to the…

Representing data in hyperbolic space can effectively capture latent hierarchical relationships. With the goal of enabling accurate classification of points in hyperbolic space while respecting their hyperbolic geometry, we introduce…

We present a classification of the hyperbolic Kac-Moody (HKM) superalgebras. The HKM superalgebras of rank larger or equal than 3 are finite in number (213) and limited in rank (6). The Dynkin-Kac diagrams and the corresponding simple root…

Let $G$ be $\SO(n,1)$ or $\SU(n,1)$ and let $\Gamma\subset G$ denote an arithmetic lattice. The hyperbolic manifold $\Gamma\backslash \calH$ comes with a natural family of covers, coming from the congruence subgroups of $\Gamma$. In many…

We derive a series of results on random walks on a d-dimensional hypercubic lattice (lattice paths). We introduce the notions of terse and simple paths corresponding to the path having no backtracking parts (spikes). These paths label…

In this work we study the asymptotic distribution of eigenvalues in one-dimensional open sets. The method of proof is rather elementary, based on the Dirichlet lattice points problem, which enable us to consider sets with infinite measure.…

We use classical Fourier analysis along with tools from the spectral theory of Automorphic forms to derive an asymptotic formula with a strong error term for the number of integer solutions $(a, b, c, d)$ inside the expanding box $[-X,X]^4$…

For a locally compact second countable group G and a lattice subgroup Gamma, we give an explicit quantitative solution of the lattice point counting problem in general domains in G, provided that i) G has finite upper local dimension, and…

In this paper we show error bounds for randomly subsampled rank-1 lattices. We pay particular attention to the ratio of the size of the subset to the size of the initial lattice, which is decisive for the computational complexity. In the…

This paper studies the performance of the spectral method in the estimation and uncertainty quantification of the unobserved preference scores of compared entities in a general and more realistic setup. Specifically, the comparison graph…

We sharpen to nearly optimal the known asymptotic and explicit bounds for the number of $\mathbb{F}_q$-rational points on a geometrically irreducible hypersurface over a (large) finite field. The proof involves a Bertini-type probabilistic…

First, we extend the results of approximate matrix multiplication from the Frobenius norm to the spectral norm. Second, We develop a class of fast approximate generalized linear regression algorithms with respect to the spectral norm.…

Let $\mathbf{Q}=(Q_1,\ldots,Q_n)$ be a random vector drawn from the uniform distribution on the set of all $n!$ permutations of $\{1,2,\ldots,n\}$. Let $\mathbf{Z}=(Z_1,\ldots,Z_n)$, where $Z_j$ is the mean zero variance one random variable…

The spectral and localization properties of $\mathcal{PT}$-symmetric optical superlattices, either infinitely extended or truncated at one side, are theoretically investigated, and the criteria that ensure a real energy spectrum are…

The theory of finite-rank perturbations allows for the determination of spectral information for broad classes of operators using the tools of analytic function theory. In this work, finite-rank perturbations are applied to powers of the…