惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

A
About on SuperTechFans
小众软件
小众软件
WordPress大学
WordPress大学
Microsoft Azure Blog
Microsoft Azure Blog
Recent Announcements
Recent Announcements
博客园 - 三生石上(FineUI控件)
博客园_首页
N
Netflix TechBlog - Medium
IT之家
IT之家
H
Help Net Security
博客园 - 聂微东
Google DeepMind News
Google DeepMind News
罗磊的独立博客
T
Tailwind CSS Blog
F
Fortinet All Blogs
Hugging Face - Blog
Hugging Face - Blog
MongoDB | Blog
MongoDB | Blog
V
V2EX
量子位
云风的 BLOG
云风的 BLOG
爱范儿
爱范儿
博客园 - 司徒正美
The Cloudflare Blog
Engineering at Meta
Engineering at Meta

math.PR updates on arXiv.org

Visibility in the Boolean Model on Harmonic Manifolds Global estimates on the Brenier map Geodesics and Wandering Exponents in Brochette First-Passage Percolation State-dependent inverse-subordinator time changes of regenerative processes: Excursion structure and multiscale occupation-time limits Randomly twisted transfer operators and singular values statistics Generalized Bessel-Dunkl diffusions An almost sure invariance principle for the Takagi-van der Waerden class functions Central limit theorems for high dimensional lattice polytopes: cosmological polytopes Convergence rate estimates for semigroups and heat kernels associated with resistance forms Second-order Poincaré inequalities and localization on the Poisson space Maximum Probability of Independence in Transitive Matroids On global solutions to the semidiscrete stochastic heat equation The Poisson Tail Conjecture for primes in short intervals A Complete Spectral Analysis of the CEV Operator with Applications to Arbitrage Holographic functions and neural networks From Betting to Empirical Bernstein LIL Concentration of General Stochastic Approximation Under Heavy-Tailed Markovian Noise Pointwise Generalization in Deep Neural Networks Bayesian Latent Space Models for Graphs Are Misspecified: Toward Robust Inference via Generalized Posteriors Wasserstein bounds for denoising diffusion probabilistic models via the Föllmer process A note on connections between the Föllmer process and the denoising diffusion probabilistic model Simple Approximation and Derivative Free Inference-Time Scaling for Diffusion Models via Sequential Monte Carlo on Path Measures Diffusion-Based Stochastic Operator Networks for Uncertainty Quantification in Stochastic Partial Differential Equations A Fourier perspective on the learning dynamics of neural networks: from sample complexities to mechanistic insights Propagation of Chaos in Contextual Flow Maps Dimension-Uniform Discretization Analysis of Preconditioned Annealed Langevin Dynamics for Multimodal Gaussian Mixtures $α$-TCAV: A Unified Framework for Testing with Concept Activation Vectors Scaling Laws from Sequential Feature Recovery: A Solvable Hierarchical Model On the Limits of Latent Reuse in Diffusion Models State-of-art minibatches via novel DPP kernels: discretization, wavelets, and rough objectives
Equidistribution of high traces of random matrices over f...
Ofir Gorodetsky, Valeriya Kovaleva · 2023-07-04 · via math.PR updates on arXiv.org

Let $g$ be a random matrix distributed according to uniform probability measure on the finite general linear group $\mathrm{GL}_n(\mathbb{F}_q)$. We show that $\mathrm{Tr}(g^k)$ equidistributes on $\mathbb{F}_q$ as $n \to \infty$ as long as $\log k=o(n^2)$ and that this range is sharp. We also show that nontrivial linear combinations of $\mathrm{Tr}(g^1),\ldots, \mathrm{Tr}(g^k)$ equidistribute as long as $\log k =o(n)$ and this range is sharp as well. Previously equidistribution of either a single trace or a linear combination of traces was only known for $k \le c_q n$, where $c_q$ depends on $q$, due to work of the first author and Rodgers. We reduce the problem to exhibiting cancellation in certain short character sums in function fields. For the equidistribution of $\mathrm{Tr}(g^k)$ we end up showing that certain explicit character sums modulo $T^{k+1}$ exhibit cancellation when averaged over monic polynomials of degree $n$ in $\mathbb{F}_q[T]$ as long as $\log k = o(n^2)$. This goes far beyond the classical range $\log k =o(n)$ due to Montgomery and Vaughan. To study these sums we build on the argument of Montgomery and Vaughan but exploit additional symmetry present in the considered sums.