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

推荐订阅源

V
Visual Studio Blog
J
Java Code Geeks
H
Hackread – Cybersecurity News, Data Breaches, AI and More
D
Docker
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
博客园 - 聂微东
MyScale Blog
MyScale Blog
H
Help Net Security
Last Week in AI
Last Week in AI
T
The Blog of Author Tim Ferriss
M
MIT News - Artificial intelligence
大猫的无限游戏
大猫的无限游戏
酷 壳 – CoolShell
酷 壳 – CoolShell
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
P
Proofpoint News Feed
博客园 - 叶小钗
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Y
Y Combinator Blog
Recent Announcements
Recent Announcements
F
Fortinet All Blogs
Martin Fowler
Martin Fowler
Microsoft Security Blog
Microsoft Security Blog
T
Tailwind CSS Blog
aimingoo的专栏
aimingoo的专栏

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
Complex spectrum of the partial theta function
[Submitted on 28 May 2026 (v1), last revised 29 May 2026 (this v · 2026-05-29 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:We study the complex spectrum of the partial theta function \[
\Theta(q,x)=\sum_{j=0}^{\infty}q^{j(j+1)/2}x^j,
\qquad |q|<1, \] where a spectral value is a parameter for which \(\Theta(q,\cdot)\) has a multiple zero. Since the function is defined here only for \(|q|<1\), all spectral values are strictly inside the unit disk; boundary points on \(|q|=1\) occur only as accumulation points of the spectrum. The paper combines two complementary points of view. Near the unit circle we prove that every point of \(|q|=1\) is an accumulation point of the spectrum; the proof uses explicit spectral factors of truncations, the Jacobi triple product, and a boundary-window lifting argument near roots of unity. Inside a fixed subdisk, illustrated for \(|q|\leq 0.8\), the true spectrum is locally finite and must be separated carefully from the much larger branch loci of truncations and Jensen polynomials. We give a truncation-seeded Newton procedure which produces a discrete list of candidate spectral values, explain the caustic/escaping-root mechanism in finite approximants, and record numerical monodromy experiments using a radial convention: for a spectral point \(q_*\), roots are labelled at the point \(0.1q_*/|q_*|\) on the small circle and then continued along the straight radial segment to \(q_*\). This convention gives a coherent set of collision labels in the disk, treats negative real spectral values from the base point \(-0.1\), and leads to a preliminary rational-direction heuristic for radial monodromy.

Submission history

From: Boris Shapiro [view email]
[v1] Thu, 28 May 2026 14:24:37 UTC (206 KB)
[v2] Fri, 29 May 2026 07:10:02 UTC (206 KB)