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

推荐订阅源

V
Visual Studio Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
博客园 - 聂微东
博客园 - 【当耐特】
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
C
Check Point Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
美团技术团队
WordPress大学
WordPress大学
Last Week in AI
Last Week in AI
Y
Y Combinator Blog
IT之家
IT之家
T
Tailwind CSS Blog
月光博客
月光博客
Vercel News
Vercel News
V
V2EX
Engineering at Meta
Engineering at Meta
B
Blog
Stack Overflow Blog
Stack Overflow Blog
A
About on SuperTechFans
Hugging Face - Blog
Hugging Face - Blog
人人都是产品经理
人人都是产品经理
腾讯CDC
I
InfoQ

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
Pal's permanent conjecture: proof for block uniform matrices
[Submitted on 24 May 2026 (v1), last revised 12 Sep 2026 (this v · 2026-05-25 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:Consider a symmetric function $\mathcal{C}(x,y)$ on $[0,1]\times[0,1]$ which is twice continuously differentiable up to the boundary, and which satisfies $ \mathcal{C}(x,y)=\mathcal{C}(1-x,1-y)$. Let $A^{(n)} = \big(a^{(n)}_{i,j}\, :\, i,j \in [n]\big)$ be the matrix with entries $a^{(n)}_{i,j}\, =\, \exp(-\mathcal{C}(i/n,j/n))$. Soumik Pal conjectured the asymptotics $$\operatorname{perm}\big(A^{(n)}\big)/n!\sim \exp\big(n \Lambda[\mathcal{C}]\big)/ \sqrt{\mathcal{D}[\mathcal{C}]}$$ as $n \to \infty$ for known functionals that arise naturally in the context of entropy regularized optimal transport. The functional $\Lambda[\mathcal{C}]$ is the known large deviation rate function, already proved rigorously by Sumit Mukherjee. It is $\int_{0}^1 \int_0^{1} (\alpha(x)+\beta(y))\, dx\, dy$ where $\alpha(x)+\beta(y)$ is chosen such that $\rho(x,y) := \exp(-\mathcal{C}(x,y)-\alpha(x)-\beta(y))$ has uniform marginals. The algebraic term $\mathcal{D}[c]$ is given by Peter McCullagh's formula for doubly stochastic matrices: $\operatorname{det}_F(I+J-T^*T)$, the Fredholm determinant, where $I$ is the identity on $L^2([0,1])$, $Jf(x) \equiv \int_{0}^1 f(z)\, dz$ (for all $x$) and $Tf(x) = \int_0^1 \rho(x,y) f(y)\, dy$. We prove the conjecture for functions $\mathcal C$ that are constant on blocks, exploiting a well-known Ross Pinsky's combinatorial decomposition of permutations in blocks.

Submission history

From: Shannon Starr [view email]
[v1] Sun, 24 May 2026 22:02:13 UTC (17 KB)
[v2] Sat, 12 Sep 2026 13:29:12 UTC (29 KB)