Skip to content
DraconiticResearch
Search Sources API
201,818 studies31 sourcesUpdated 32 min ago
PreprintCC BY 4.0arXiv

Pal's permanent conjecture: proof for block uniform matrices

Abstract

Consider a symmetric function π’ž(x,y) on [0,1]Γ—[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) = (a(n)i,j : i,j ∈ [n]) be the matrix with entries a(n)i,j = exp(βˆ’π’ž(i/n,j/n)). Soumik Pal conjectured the asymptotics perm(A(n))/n!∼ exp(n Ξ›[π’ž])/ √(π’Ÿ[π’ž]) as n β†’ ∞ for known functionals that arise naturally in the context of entropy regularized optimal transport. The functional Ξ›[π’ž] is the known large deviation rate function, already proved rigorously by Sumit Mukherjee. It is ∫01 ∫01 (Ξ±(x)+Ξ²(y)) dx dy where Ξ±(x)+Ξ²(y) is chosen such that ρ(x,y) := exp(βˆ’π’ž(x,y)βˆ’Ξ±(x)βˆ’Ξ²(y)) has uniform marginals. The algebraic term π’Ÿ[c] is given by Peter McCullagh's formula for doubly stochastic matrices: detF(I+Jβˆ’T*T), the Fredholm determinant, where I is the identity on L2([0,1]), Jf(x) ≑ ∫01 f(z) dz (for all x) and Tf(x) = ∫01 ρ(x,y) f(y) dy. We prove the conjecture for functions π’ž that are constant on blocks, exploiting a well-known Ross Pinsky's combinatorial decomposition of permutations in blocks.

Related

  1. Proof of a conjecture of Johnston on binary matrices with low discrepancy
    Shalom Eliahou
    HALPreprintCC BY-NC-ND 4.0Full textGeneral mathematicsHAL
  2. A proof of the interlacing conjecture for the singular values of Sylvester-Kac matrices
    Fuying Tang, Shuo Shi
    arXivPreprintarXiv licenceFull textAlgebra & number theoryAnalysis & PDEsarXiv
  3. On the lower bound of the refined Bessis--Moussa--Villani conjecture: proof of the cases S_{6,3} and S_{7,3} for 3x3 matrices
    Daniel HΓ€gele
    arXivPreprintarXiv licenceFull textAlgebra & number theoryAnalysis & PDEsarXiv
  4. A Note on the Drazin Inverse of 2 Γ— 2 Block Triangular Matrices
    Ziyang Pan, Zhiping Xiong, Yingying Qin
    AxiomsPeer-reviewedCC BY 4.0General mathematicsCrossref
  5. R-transforms for non-Hermitian block random matrices: a spherical integral approach
    Pierre Bousseyroux
    arXivPreprintarXiv licenceFull textMathematical physicsProbabilityarXiv
BibTeX
@misc{ottolini2026pals,
  title = {{Pal's permanent conjecture: proof for block uniform matrices}},
  author = {Andrea Ottolini and Shannon Starr},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2605.25274},
  eprint = {2605.25274},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2605.25274},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Pal's permanent conjecture: proof for block uniform matrices
AU  - Andrea Ottolini
AU  - Shannon Starr
PY  - 2026
DA  - 2026/09/21
PB  - arXiv
DO  - 10.48550/arxiv.2605.25274
UR  - https://arxiv.org/abs/2605.25274
AB  - Consider a symmetric function π’ž(x,y) on [0,1]Γ—[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) = (a^(n)_i,j : i,j ∈ [n]) be the matrix with entries a^(n)_i,j = exp(βˆ’π’ž(i/n,j/n)). Soumik Pal conjectured the asymptotics perm(A^(n))/n!∼ exp(n Ξ›[π’ž])/ √(π’Ÿ[π’ž]) as n β†’ ∞ for known functionals that arise naturally in the context of entropy regularized optimal transport. The functional Ξ›[π’ž] is the known large deviation rate function, already proved rigorously by Sumit Mukherjee. It is ∫_0^1 ∫_0^1 (Ξ±(x)+Ξ²(y)) dx dy where Ξ±(x)+Ξ²(y) is chosen such that ρ(x,y) := exp(βˆ’π’ž(x,y)βˆ’Ξ±(x)βˆ’Ξ²(y)) has uniform marginals. The algebraic term π’Ÿ[c] is given by Peter McCullagh's formula for doubly stochastic matrices: det_F(I+Jβˆ’T^*T), the Fredholm determinant, where I is the identity on L^2([0,1]), Jf(x) ≑ ∫_0^1 f(z) dz (for all x) and Tf(x) = ∫_0^1 ρ(x,y) f(y) dy. We prove the conjecture for functions π’ž that are constant on blocks, exploiting a well-known Ross Pinsky's combinatorial decomposition of permutations in blocks.
ER  -