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

推荐订阅源

阮一峰的网络日志
阮一峰的网络日志
Apple Machine Learning Research
Apple Machine Learning Research
量子位
D
DataBreaches.Net
云风的 BLOG
云风的 BLOG
博客园 - 聂微东
博客园_首页
D
Docker
博客园 - 叶小钗
S
SegmentFault 最新的问题
大猫的无限游戏
大猫的无限游戏
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
J
Java Code Geeks
H
Hackread – Cybersecurity News, Data Breaches, AI and More
A
About on SuperTechFans
博客园 - 三生石上(FineUI控件)
F
Fortinet All Blogs
小众软件
小众软件
aimingoo的专栏
aimingoo的专栏
爱范儿
爱范儿
腾讯CDC
罗磊的独立博客
雷峰网
雷峰网
博客园 - Franky

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Lattice point counting problems on step-two nilpotent Lie...
[Submitted on 25 May 2026 (v1), last revised 26 May 2026 (this v · 2026-05-26 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:We develop the theory of lattice point counting on connected and simply connected nilpotent Lie groups of step-two, endowed with the parabolic type dilation and a family of homogeneous norms $ \mathcal{N}_{\alpha,M}(x, t)=\left(|M_1x|^\alpha + |M_2t|^{\alpha / 2}\right)^{1 / \alpha}$ adapted to the dilation structure, where $\alpha>0$ and $M_1,M_2$ are invertible matrices. With appropriate notions of lattices, the domains to be counted are balls associated to these norms, and explicit counting discrepancy estimates are deduced for all possible dimensions and all $\alpha>0$. The bounds are sharp when the group center is unidimensional and $\alpha=2$, in certain rational sense. Our study also generalizes and even quantitively improves previous results on Heisenberg groups obtained by Garg--Nevo--Taylor \cite[\textit{Ann. Inst. Fourier}, 2015]{GNT15}: (i) In dimension $5$, the exponent of logarithmic factor is lowered from $2/3$ to ${1}/{3}$ if $\alpha \in(3,4) $ or $\alpha=1$; and the factor $\log ^{2/3} R $ is dropped if $\alpha=4$ (i.e., the Cygan--Korányi norm case) or $\alpha\in(2,3]$. (ii) In dimension $3$, the estimation is upgraded from $O_\epsilon(R^{ 5/2+\epsilon})$ to $O(R^{2}\log^{ 1/2} R)$ for $\alpha=1$, and to $O(R^{{19}/{8}})$ for $\alpha\in (1,2)$; and the factor $\log R$ is removed for $\alpha>4$. Moreover, as a byproduct, we extend the lattice counting near Heisenberg spheres, recently considered by Campolongo--Taylor \cite[\textit{Matematica}, 2023]{CT23} and Srivastava--Taylor \cite[\textit{J. Fourier Anal. Appl.}, 2026]{ST26}, to the above step-two group setting with arbitrary dimensional group center, where some quantitive improvements are also attained. Our method relies upon Poisson's summation formulas, oscillatory integral estimates and asymptotic properties as well as recursion formulas of Bessel functions.

Submission history

From: Sheng-Chen Mao [view email]
[v1] Mon, 25 May 2026 17:01:32 UTC (44 KB)
[v2] Tue, 26 May 2026 09:10:23 UTC (44 KB)