English
Related papers

Related papers: Hyperbolic lattice point counting in unbounded ran…

200 papers

We consider the problem of counting the number of rational points of bounded height in the zero-loci of Brauer group elements on semi-simple algebraic groups over number fields. We obtain asymptotic formulae for the counting problem for…

Number Theory · Mathematics 2018-10-09 Daniel Loughran , Ramin Takloo-Bighash , Sho Tanimoto

This paper derives central limit theorems (CLTs) for general linear spectral statistics (LSS) of three important multi-spiked Hermitian random matrix ensembles. The first is the most common spiked scenario, proposed by Johnstone, which is a…

Statistics Theory · Mathematics 2014-06-05 Damien Passemier , Matthew R. Mckay , Yang Chen

We develop a notion of {\em inner rank} as a tool for obtaining lower bounds on the rank of matrix multiplication tensors. We use it to give a short proof that the border rank (and therefore rank) of the tensor associated with $n\times n$…

Computational Complexity · Computer Science 2019-05-15 Joel Friedman

We consider matrix quantum mechanics with multiple bosonic matrices, including those obtained from dimensional reduction of Yang-Mills theories. Using the matrix bootstrap, we study simple observables like $\langle \mathop{tr} X^2 \rangle$…

High Energy Physics - Theory · Physics 2025-09-22 Henry W. Lin , Zechuan Zheng

Let $k$ be a finite field extension of the function field $\bfF_p(T)$ and $\bar{k}$ its algebraic closure. We count points in projective space $\Bbb P ^{n-1}(\bar{k})$ with given height and of fixed degree $d$ over the field $k$. If…

Number Theory · Mathematics 2014-02-26 Jeffrey Lin Thunder , Martin Widmer

We give a general lower bound on the rank of matrices of the form $\rho(h) - I$ with $\rho : G \rightarrow GL({\mathbb F}^n)$ an irreducible representation of a finite group $G$. The main tool in the proof is a (strengthening) of a…

Group Theory · Mathematics 2025-12-23 Zeev Dvir

Counting integer solutions of linear constraints has found interesting applications in various fields. It is equivalent to the problem of counting lattice points inside a polytope. However, state-of-the-art algorithms for this problem…

Data Structures and Algorithms · Computer Science 2023-12-15 Cunjing Ge

We develop tractable convex relaxations for rank-constrained quadratic optimization problems over $n \times m$ matrices, a setting for which tractable relaxations are typically only available when the objective or constraints admit spectral…

Optimization and Control · Mathematics 2026-05-22 Ryan Cory-Wright , Jean Pauphilet

We provide an asymptotic estimate for the number of rational points of bounded height on a non-singular conic over the rationals. The estimate is uniform in the coefficients of the underlying quadratic form.

Number Theory · Mathematics 2018-07-17 Efthymios Sofos

We study upper bounds on the number of lattice points for convex bodies having their centroid at the origin. For the family of simplices as well as in the planar case we obtain best possible results. For arbitrary convex bodies we provide…

Metric Geometry · Mathematics 2015-05-26 Sören Lennart Berg , Martin Henk

Let $A$ be a $n\times n$ complex Hermitian matrix and let $\lambda(A)=(\lambda_1,\ldots,\lambda_n)\in \mathbb{R}^n$ denote the eigenvalues of $A$, counting multiplicities and arranged in non-increasing order. Motivated by problems arising…

Functional Analysis · Mathematics 2021-04-15 Pedro Massey , Demetrio Stojanoff , Sebastian Zarate

The work contains a detailed study of the scaling limit of a certain critical, integrable inhomogeneous six-vertex model subject to twisted boundary conditions. It is based on a numerical analysis of the Bethe ansatz equations as well as…

Mathematical Physics · Physics 2021-03-17 Vladimir V. Bazhanov , Gleb A. Kotousov , Sergii M. Koval , Sergei L. Lukyanov

A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…

Optimization and Control · Mathematics 2016-10-27 Sander Gribling , David de Laat , Monique Laurent

It is well known that the orbit of a lattice in hyperbolic $n$-space is uniformly distributed when projected radially onto the unit sphere. In the present work, we consider the fine-scale statistics of the projected lattice points, and…

Dynamical Systems · Mathematics 2015-09-03 Jens Marklof , Ilya Vinogradov

The lattice gauge theory technique for non-perturbative calculations in QCD is reviewed. The extraction of the continuum limit of lattice results is discussed with particular examples appropriate to hadron spectroscopy (the light hadrons…

High Energy Physics - Phenomenology · Physics 2007-05-23 C. Michael

We obtain an asymptotic formula for the number of integer $2\times 2$ matrices that have determinant $\Delta$ and whose absolute values of the entries are at most $H$. The result holds uniformly for a large range of $\Delta$ with respect to…

Number Theory · Mathematics 2025-02-13 Muhammad Afifurrahman

We prove sharp upper bounds for the number of resonances in boxes of size 1 at high frequency for the Laplacian on finite volume surfaces with hyperbolic cusps. As a corollary, we obtain a Weyl asymptotic for the number of resonances in…

Spectral Theory · Mathematics 2017-12-25 Yannick Bonthonneau

A vertical 2-sum of a two-coatom lattice $L$ and a two-atom lattice $U$ is obtained by removing the top of $L$ and the bottom of $U$, and identifying the coatoms of $L$ with the atoms of $U$. This operation creates one or two nonisomorphic…

Combinatorics · Mathematics 2020-07-08 Jukka Kohonen

We consider the matrix representation of the Eisenstein numbers and in this context we discuss the theory of the Pseudo Hyperbolic Functions. We develop a geometrical interpretation and show the usefulness of the method in Physical problems…

Mathematical Physics · Physics 2010-03-16 G. Dattoli , E. Sabia , M. Del Franco

Matrix rank and inertia optimization problems are a class of discontinuous optimization problems in which the decision variables are matrices running over certain matrix sets, while the ranks and inertias of the variable matrices are taken…

Optimization and Control · Mathematics 2013-01-15 Yongge Tian