Pfaffian Positivity for Convex Kernels and Optimal Matching Bounds
William Johnson
Source abstract
We show that for all positive, nonincreasing, convex functions and for any collection of points with and even, the Pfaffian of the skew matrix defined by 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 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 ) is the unique single-matching product that bounds below uniformly over and positive, nonincreasing, convex.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.