Skip to content
DraconiticResearch
Search Sources API
186,541 studies31 sourcesUpdated 17 min ago
PreprintarXiv licencearXiv

Pfaffian Positivity for Convex Kernels and Optimal Matching Bounds

Abstract

We show that for all positive, nonincreasing, convex functions f : (0, ∞) → (0,∞) and for any collection of n points xi ∈ ℝ with x1 < x2 < … < xn and n even, the Pfaffian of the skew matrix defined by f(xj − xi) above the diagonal is positive. More generally, we establish coefficientwise nonnegativity for Pfaffians arising from interval decompositions, which also yields quantitative lower bounds for singly and doubly bordered Pfaffians. Choosing f(r) = r−2 proves the three nonvanishing assertions in the conjecture of Albouy and Moeckel. Further, we show that the rainbow bound (the product over the nested matching {1,n}, {2,n−1}, … {n/2, n/2 + 1}) is the unique single-matching product that bounds Pf(Af(x)) below uniformly over x and f positive, nonincreasing, convex.

Related

  1. Riesz kernels of hyperbolic polynomials: positivity, admissible exponents and Jordan rigidity
    Dongsheng Wei
    arXivPreprintarXiv licenceFull textAlgebra & number theoryAnalysis & PDEsarXiv
  2. Two q-Deformations of Narayana Polynomials: Rogers Moments, Hankel Positivity, and q-Narayana Kernels
    Jiang Zeng
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  3. Endpoint gradient bounds for centered convex maximal operators and probability kernels
    Zhouyu Long
    arXivPreprintarXiv licenceFull textAnalysis & PDEsProbabilityarXiv
  4. Convexity of inverse spectral Green kernels and nondegeneracy of Robin centers in convex domains
    Xiuda Liang, Wenjie Wang
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  5. A second-order structure- and positivity-preserving convex limiting method for the Vlasov equations
    Katharina Kormann, Murtazo Nazarov, Junjie Wen
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
BibTeX
@misc{johnson2026pfaffian,
  title = {{Pfaffian Positivity for Convex Kernels and Optimal Matching Bounds}},
  author = {William Johnson},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.24371},
  eprint = {2610.24371},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.24371},
}
RIS
TY  - UNPB
TI  - Pfaffian Positivity for Convex Kernels and Optimal Matching Bounds
AU  - William Johnson
PY  - 2026
DA  - 2026/10/17
PB  - arXiv
DO  - 10.48550/arxiv.2610.24371
UR  - https://arxiv.org/abs/2610.24371
AB  - We show that for all positive, nonincreasing, convex functions f : (0, ∞) → (0,∞) and for any collection of n points x_i ∈ ℝ with x_1 < x_2 < … < x_n and n even, the Pfaffian of the skew matrix defined by f(x_j − x_i) above the diagonal is positive. More generally, we establish coefficientwise nonnegativity for Pfaffians arising from interval decompositions, which also yields quantitative lower bounds for singly and doubly bordered Pfaffians. Choosing f(r) = r^−2 proves the three nonvanishing assertions in the conjecture of Albouy and Moeckel. Further, we show that the rainbow bound (the product over the nested matching {1,n}, {2,n−1}, … {n/2, n/2 + 1}) is the unique single-matching product that bounds Pf(A_f(x)) below uniformly over x and f positive, nonincreasing, convex.
ER  -