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

推荐订阅源

H
Help Net Security
大猫的无限游戏
大猫的无限游戏
雷峰网
雷峰网
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
博客园 - 聂微东
V
Visual Studio Blog
爱范儿
爱范儿
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
美团技术团队
有赞技术团队
有赞技术团队
云风的 BLOG
云风的 BLOG
Google DeepMind News
Google DeepMind News
Blog — PlanetScale
Blog — PlanetScale
The Cloudflare Blog
Engineering at Meta
Engineering at Meta
博客园 - 三生石上(FineUI控件)
WordPress大学
WordPress大学
Vercel News
Vercel News
F
Fortinet All Blogs
Last Week in AI
Last Week in AI
M
MIT News - Artificial intelligence
小众软件
小众软件
月光博客
月光博客
A
About on SuperTechFans

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
Weak and strong $q$-analogs of the Laguerre--Pólya class
[Submitted on 16 Jun 2026] · 2026-06-17 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:For $0<q<1$ we compare two natural $q$-analogs of the Laguerre--Pólya class. The first one is a coefficient-side class, defined as the inverse image of the classical Laguerre--Pólya class under the normalized $q$-Borel transform \[
\Bq\left(\sum_{k\ge 0}a_k\frac{z^k}{k!}\right)
=\sum_{k\ge 0}a_k\frac{q^{k(k-1)/2}(1-q)^k}{(q;q)_k}z^k . \] The second one is a zero-side class, defined as the locally uniform closure of real polynomials whose nonzero zeros are logarithmically $q$-separated on each side of the origin. We prove that the normalized $q$-Borel transform maps the classical Laguerre--Pólya class, and its type-I subclass, into themselves. This yields a $q$-Jensen-polynomial criterion and shows that the coefficient-side class strictly contains the classical Laguerre--Pólya class. On the zero side, we prove a genus-zero product representation. The logarithmic separation condition prevents zeros escaping to infinity from producing a residual exponential factor; consequently no nonconstant exponential factor can occur. For every $q\in(0,1)$ we obtain the strict chains \[
\qLPs\subsetneq \LP\subsetneq \qLPw,
\qquad
\qLPIs\subsetneq \LPI\subsetneq \qLPIw . \]

Submission history

From: Boris Shapiro [view email]
[v1] Tue, 16 Jun 2026 12:35:45 UTC (10 KB)