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

推荐订阅源

云风的 BLOG
云风的 BLOG
V
Visual Studio Blog
人人都是产品经理
人人都是产品经理
The GitHub Blog
The GitHub Blog
月光博客
月光博客
T
Tailwind CSS Blog
小众软件
小众软件
Y
Y Combinator Blog
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
P
Proofpoint News Feed
B
Blog RSS Feed
博客园 - 司徒正美
A
About on SuperTechFans
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
博客园 - 聂微东
Microsoft Security Blog
Microsoft Security Blog
Recent Announcements
Recent Announcements
博客园 - Franky
U
Unit 42
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Microsoft Azure Blog
Microsoft Azure Blog
T
The Blog of Author Tim Ferriss
GbyAI
GbyAI
Apple Machine Learning Research
Apple Machine Learning Research

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
An explicit formula for Koornwinder moments and Rains' po...
Younggwang Cho, Donghyun Kim, Jang Soo Kim, Hojoon Lee, Jing Liu · 2026-06-12 · via math updates on arXiv.org

The asymmetric simple exclusion process (ASEP) is an important particle model with deep connections to orthogonal polynomials. Motivated by this connection, Corteel and Williams introduced the Koornwinder moments $M^{Z}_λ$ at $ t=q $, which generalize the moments of Askey--Wilson polynomials. They showed that the partition function of the two-species ASEP is equal to $M^{Z}_λ$ for a one-row partition $ λ$. In this paper, we investigate a conjecture of Rains on the positivity of the minimal numerator of the Koornwinder moment $M^{Z}_λ$. We derive the first explicit formula for this moment, thereby obtaining a precise formulation of the conjecture by determining the minimal denominator of $M^{Z}_λ$. We also propose a generalization of the conjecture for the more general Koornwinder moments $M^{Z}_{λ,μ}$ indexed by two partitions at special parameter values. We prove the generalized Rains' conjecture in two special cases: $(ξ,q)=(1,0)$ and $(ξ,q)=(1,1)$. For $(ξ,q)=(1,0)$, we construct a lattice path model and obtain a combinatorial formula for $M^{Z}_{λ,μ}$ in terms of non-intersecting lattice paths. For $(ξ,q)=(1,1)$, we establish an explicit product formula for $M^{Z}_{λ,μ}$ and give a combinatorial interpretation using lecture hall tableaux.