Related papers: Hyperbolic lattice point counting in unbounded ran…
We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…
We prove an asymptotic formula for the number of fixed rank matrices with integer coefficients over a number field K/Q and bounded norm. As an application, we derive an approximate Rogers integral formula for discrete sets of module…
We study the spectral properties of matrices of long-range percolation model. These are N\times N random real symmetric matrices H=\{H(i,j)\}_{i,j} whose elements are independent random variables taking zero value with probability…
We establish an asymptotic formula for the number of lattice points in the sets \[ \mathbf S_{h_1, h_2, h_3}(\lambda): =\{x\in\mathbb Z_+^3:\lfloor h_1(x_1)\rfloor+\lfloor h_2(x_2)\rfloor+\lfloor h_3(x_3)\rfloor=\lambda\} \quad…
The set of matrices of given positive semidefinite rank is semialgebraic. In this paper we study the geometry of this set, and in small cases we describe its boundary. For general values of positive semidefinite rank we provide a conjecture…
We present a new proof of the well known formula for the rank of the inclusion matrix by constructing a $k\mathcal{S}_n$-module spanned by the columns of this matrix and calculating its dimension.
Most recent results in matrix completion assume that the matrix under consideration is low-rank or that the columns are in a union of low-rank subspaces. In real-world settings, however, the linear structure underlying these models is…
We consider a local average in the hyperbolic lattice point counting problem for the Picard group $\Gamma$ acting on the three-dimensional hyperbolic space. Compared to the pointwise case, we improve the bounds on the remainder in the…
We investigate the Whitney numbers of the first kind of rank-metric lattices, which are closely linked to the open problem of enumerating rank-metric codes having prescribed parameters. We apply methods from the theory of hyperovals and…
We relate the singularities of a scheme $X$ to the asymptotics of the number of points of $X$ over finite rings. This gives a partial answer to a question of Mustata. We use this result to count representations of arithmetic lattices. More…
We consider the problem of estimating a rank-one nonsymmetric matrix under additive white Gaussian noise. The matrix to estimate can be written as the outer product of two vectors and we look at the special case in which both vectors are…
Non-asymptotic theory of random matrices strives to investigate the spectral properties of random matrices, which are valid with high probability for matrices of a large fixed size. Results obtained in this framework find their applications…
Matrix completion algorithms recover a low rank matrix from a small fraction of the entries, each entry contaminated with additive errors. In practice, the singular vectors and singular values of the low rank matrix play a pivotal role for…
We estimate the size of the spectral gap at zero for some Hermitian block matrices. Included are quasi-definite matrices, quasi-semidefinite matrices (the closure of the set of the quasi-definite matrices) and some related block matrices…
We prove asymptotic upper bounds on the number of $d$-partitions (paving matroids of fixed rank) and partial Steiner systems (sparse paving matroids of fixed rank), using a mixture of entropy counting, sparse encoding, and the probabilistic…
We give asymptotic estimates of the variance of the number of integer points in translated thin annuli in any dimension.
In this paper, we obtain asymptotic formulas for an infinite class of rank generating functions. As an application, we solve a conjecture of Andrews and Lewis on inequalities between certain ranks.
A hyperbolic lattice is called \textit{$1.2$-reflective} if the subgroup of its automorphism group generated by all $1$- and $2$-reflections is of finite index. The main result of this article is a complete classification of…
In a previous paper {GN2} an effective solution of the lattice point counting problem in general domains in semisimple S-algebraic groups and affine symmetric varieties was established. The method relies on the mean ergodic theorem for the…
We establish sharp bounds on the mixing rates of a class of two dimensional non-uniformly hyperbolic symplectic maps. This provides a primer on how to investigate such questions in a concrete example and, at the same time, it solves a…