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

推荐订阅源

博客园_首页
B
Blog RSS Feed
Microsoft Azure Blog
Microsoft Azure Blog
J
Java Code Geeks
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
Google DeepMind News
Google DeepMind News
F
Fortinet All Blogs
V
V2EX
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Engineering at Meta
Engineering at Meta
月光博客
月光博客
阮一峰的网络日志
阮一峰的网络日志
M
MIT News - Artificial intelligence
IT之家
IT之家
博客园 - 【当耐特】
U
Unit 42
云风的 BLOG
云风的 BLOG
L
LangChain Blog
小众软件
小众软件
Microsoft Security Blog
Microsoft Security Blog
B
Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
宝玉的分享
宝玉的分享
N
Netflix TechBlog - Medium

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
The general Brannan coefficient conjecture II: Meijer-fun...
[Submitted on 10 Jun 2026 (v1), last revised 17 Jul 2026 (this v · 2026-06-11 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:The coefficients $A_n(\alpha,\beta,\omega)$ in the Maclaurin expansion $(1+\omega z)^{\alpha}(1-z)^{-\beta}=\sum_{n=0}^{\infty} A_n(\alpha,\beta,\omega)z^n$ are considered for $|\omega|=1$ and $\alpha,\beta\in(0,1]$. D. A. Brannan conjectured in a 1973 paper that $|A_n(\alpha,\beta,\omega)|\le A_n(\alpha,\beta,1)$ for every positive odd integer $n$. The present author recently established the conjecture outside a small neighbourhood of $\omega=-1$. The remaining range is treated here by combining compound Laplace integral representations with two types of local approximation: a Meijer $G$ function approximation for $n|\arg(-\omega)|$ bounded, and a modified Watson approximation for the complementary range. The resulting lower bounds reduce the problem to numerical positivity checks for explicit functions on compact parameter sets. These computations verify the inequality for all $\alpha,\beta\in(0,1]$ and all odd integers $n\ge5$, and hence, together with Brannan's result for $n=3$, complete the proof of his conjecture.

Submission history

From: T. M. Dunster [view email]
[v1] Wed, 10 Jun 2026 03:33:22 UTC (2,476 KB)
[v2] Fri, 17 Jul 2026 00:41:54 UTC (2,463 KB)