Totally Non-Negative Pfaffian (TNNP)

• TNNP are even-order, real skew-symmetric matrices whose principal Pfaffians are nonnegative, underpinning key combinatorial and integrable system applications.
• They are constructed from combinatorial frameworks such as planar graph matchings, chord diagrams, and Dyck paths, often linked to Catalan number enumerations.
• TNNP bridges algebraic and analytic theories by ensuring non-singular soliton solutions in the BKP hierarchy through its inherent positivity properties.

A totally non-negative Pfaffian (TNNP) is a real skew-symmetric matrix of even order for which every principal Pfaffian, computed on any even-cardinality subset of indices, is non-negative. TNNPs have arisen as a natural algebraic and combinatorial generalization of totally non-negative determinants, especially in the context of integrable systems, matching and enumeration theory, and the theory of soliton solutions for the BKP (B-type Kadomtsev–Petviashvili) equation. The study of TNNPs involves connections with planar graph matchings, chord diagrams, non-crossing Dyck paths, the totally non-negative Grassmannian, and Schur Q–functions. TNNPs guarantee nonsingular, real, and resonance-rich web soliton solutions in the BKP hierarchy, unifying deep algebraic properties with combinatorial constructions (Chang, 11 Jan 2026, Chang, 2023, Chang, 2024).

1. Definition and Basic Properties

Let $A$ be a real skew-symmetric matrix of size $2n \times 2n$, i.e., $A^T = -A$. For any even-cardinality index subset $$I = \{i_1 < i_2 < \dots < i_{2m}\} \subset \{1, \dots, 2n\}$$, $A_I$ denotes the $2m \times 2m$ principal submatrix. The Pfaffian of $A_I$ is

$$\operatorname{Pf}(A_I) = \sum_{\sigma \in M(I)}\epsilon(\sigma) a_{\sigma_1,\sigma_2} a_{\sigma_3,\sigma_4} \cdots a_{\sigma_{2m-1},\sigma_{2m}},$$

where $M(I)$ is the set of perfect matchings (pair partitions) on $I$ subject to the standard Pfaffian order constraints and $\epsilon(\sigma)$ is the matching sign. A matrix $A$ is said to be a totally non-negative Pfaffian (TNNP) if $\operatorname{Pf}(A_I) \geq 0$ for every even-cardinality $I$ (including $I=\varnothing$, for which $\operatorname{Pf}(\varnothing)=1$ by convention).

Pfaffian analogues of the Plücker relations hold, but they are necessary rather than sufficient for total non-negativity. A key structural identity for sub-Pfaffians is the three-term expansion, a condensation analogue: $$\operatorname{Pf}(A_{I})\operatorname{Pf}(A_{I \cup \{p, q, r, s\}}) = \operatorname{Pf}(A_{I \cup \{p, q\}})\operatorname{Pf}(A_{I \cup \{r, s\}}) - \operatorname{Pf}(A_{I \cup \{p, r\}})\operatorname{Pf}(A_{I \cup \{q, s\}}) + \operatorname{Pf}(A_{I \cup \{p, s\}})\operatorname{Pf}(A_{I \cup \{q, r\}}).$$ This identity facilitates inductive proofs and links TNNP structure to combinatorial recurrences (Chang, 11 Jan 2026).

2. Combinatorial and Algebraic Characterizations

Several canonical constructions lead to TNNP matrices:

Perfect Matchings on Planar Graphs: For a planar graph $G$ with $2n$ labeled boundary vertices, define $a_{ij} = M(G \setminus \{a_i, a_j\})$ for $i < j$ ($M(H)$ is the number of perfect matchings of $H$). The resulting skew-symmetric matrix $A = [a_{ij}]$ is TNNP, as every principal Pfaffian corresponds to a matching count in a graph with distinguished boundary vertices removed (Kuo–Ciucu condensation theorem) (Chang, 11 Jan 2026).

Chord Diagrams: Non-crossing chord diagrams on $2N$ points correspond to planar graphs; their enumeration is counted by the Catalan numbers $C(N)$. The associated Pfaffian matrix, constructed via the matching recipe above, is TNNP.

Dyck Paths: For arbitrary weakly increasing integers $a_1 \leq \dots \leq a_{2n}$, $C(a_1, \dots, a_{2n})$ denotes the number of non-intersecting families of Dyck paths connecting $(2a_i,0)$. Stanley’s theorem gives

$$C(a_1, \dots, a_{2n}) = \operatorname{Pf}([C(a_j - a_i)]_{1 \leq i < j \leq 2n}),$$

making the Catalan-matrix TNNP, as all minors are non-negative (Chang, 11 Jan 2026).

Plücker-Type Grassmannian Constructions: For soliton $\tau$-functions in the BKP hierarchy, TNNP arises from the correspondence $A = S^TJ S$, where $S$ is a rectangular matrix (combinatorially encoding Plücker coordinates), $J$ canonical skew-diagonal. Totally non-negative minors of $S$ guarantee TNNP (Chang, 2024). The full structure is encoded in the totally non-negative Grassmannian and, in square-size cases, in the real orthogonal Grassmannian (Chang, 2023).

Construction	Matrix Size & Interpretation	Guarantee for TNNP
Planar matching	$2n \times 2n$, boundary matchings	Every sub-Pfaffian $\geq 0$
Non-crossing chords	$2N \times 2N$, Catalan combinations	Catalan-matrix TNNP
Dyck path enumeration	$2n \times 2n$, path families	Stanley’s theorem, TNNP
Grassmannian/Plücker	$m \times m$, $\operatorname{rank} \leq 2r$	Minor-positivity, TNNP

3. Factorization and Tridiagonal Canonical Forms

Every invertible skew-symmetric matrix $A$ admits a block tridiagonal factorization, $A = LDL^T$, with $L$ unit lower-triangular and $D$ block-diagonal with $2 \times 2$ skew blocks. The entries of $D$ and $L$ can be expressed recursively in terms of principal Pfaffians: $$d_{2k-1,2k} = \frac{\operatorname{Pf}(A_{1,\dots,2k})}{\operatorname{Pf}(A_{1,\dots,2k-2})}$$ Total non-negativity is preserved if all $d_{2k-1,2k} \geq 0$ and $L$ is a 0–1 double-echalon lower-triangular matrix with all minors non-negative (specifically, it must avoid the $3 \times 3$ sub-pattern $[1\,1\,0;\,1\,1\,1;\,0\,1\,1]$) (Chang, 11 Jan 2026).

Elementary extension: Appending two new rows and columns to a TNNP via block diagonal $D$ with positive new $d$ preserves TNNP status.

Block–form and Cauchy–Binet type transformations further show that post- or pre-multiplying building blocks of TNNPs with totally non-negative matrices preserves total non-negativity (Chang, 2024).

4. TNNP in the BKP Hierarchy and Schur Q–Functions

TNNP structure is central for the construction of nonsingular soliton solutions to the BKP equation and its reductions (e.g., Sawada–Kotera). In this context, the $\tau$-function is expressed as a sum over Pfaffians: $$\tau(t) = \sum_{m=0}^n \sum_{I \subset [2n],\,|I|=2m} \operatorname{Pf}(A_I)\, \left(\tfrac12\right)^m \prod_{i<j\in I} \frac{p_i - p_j}{p_i + p_j} \exp\left(\sum_{k \in I} \xi(p_k; t)\right)$$ with $\xi(p;t) = p x + p^3 y + p^5 t$ and $|p_1|^2 > |p_2|^2 > \dots > |p_{2n}|^2$. If $A$ is TNNP, every term of $\tau$ is strictly positive, so the soliton field $\phi = 2 \partial_x^2 \ln \tau$ is real, non-singular, and exhibits rich line soliton and resonance patterns (Chang, 11 Jan 2026, Chang, 2023, Chang, 2024).

For the BKP $\tau$-function written in terms of Schur Q–functions, TNNP is achieved when all parameters in the Q–function expansion are chosen non-negative (by Stembridge's theorem, if $$c_{2k+1} = \frac{1}{2k+1} \sum_{r=1}^m a_r^{2k+1}, a_r > 0$$, then all Q–functions and hence associated Pfaffian minors are non-negative) (Chang, 2024).

The soliton combinatorics and their cell-decomposition in the plane correspond to positroid cells in the totally non-negative Grassmannian, with spectral data and combinatorial parameters governing the interaction webs.

5. Explicit Examples

Planar Matching (4×4): For the square graph $G$ with boundary vertices $1,2,3,4$, the skew-symmetric matrix $A$ built from $M(G \setminus \{a_i,a_j\})$ yields $$A = \begin{pmatrix} 0 & 0 & 1 & 1 \ 0 & 0 & 1 & 1 \ -1 & -1 & 0 & 0 \ -1 & -1 & 0 & 0 \end{pmatrix}$$, with $\operatorname{Pf}(A) = 2$ and all sub-Pfaffians non-negative (Chang, 11 Jan 2026).

Dyck Path/Catalan Matrix (n=2): For $a_1=0, a_2=1, a_3=1, a_4=2$, the matrix of Catalan numbers gives $$C = \begin{pmatrix} 0 & 1 & 1 & 2 \ -1 & 0 & 1 & 1 \ -1 & -1 & 0 & 1 \ -2 & -1 & -1 & 0 \end{pmatrix}$$, with $\operatorname{Pf}(C)=5$; all minors correspond to Dyck path enumeration and are non-negative.

Tridiagonal Factorization (L D L$^T$): For $D$ comprising $2 \times 2$ blocks $\left[\begin{smallmatrix}0&2\-2&0\end{smallmatrix}\right],\left[\begin{smallmatrix}0&3\-3&0\end{smallmatrix}\right]$ and $L$ a standard lower-triangular double-echalon, $A = L D L^T$ has $\operatorname{Pf}(A) = 6$ and all minors non-negative (Chang, 11 Jan 2026).

Grassmannian Example (N=2, M=4): For $$A = \begin{pmatrix}1 & 0 & -c & -d\ 0 & 1 & a & b\end{pmatrix}$$ with $a,b,c,d > 0$, $ad-bc \ge 0$, all $2 \times 2$ minors and the expanded $\tau$-function contributions are non-negative (Chang, 2023).

Example	Matrix/Structure	Key Feature
Planar 4-cycle	$4 \times 4$, perfect matching	$\operatorname{Pf}(A)=2\ge0$
Catalan/Dyck	$4 \times 4$, Dyck path counts	All minors count non-crossing paths
Tridiagonal $LDL^T$	$4 \times 4$, block-diagonal D	Factorization preserves TNNP
Grassmannian $2 \times 4$	$2 \times 4$, T-cell	Plücker minors $\geq 0$

6. Role in Soliton Resonances and Web Structure

TNNP matrices are essential in the analytic and geometric theory of BKP soliton $\tau$-functions. The all-positive structure of Pfaffian terms ensures that, in every region of the $(x, y)$-plane, a single exponential term dominates, preserving positivity and preventing singularities in the resulting field solution. At interfaces—soliton lines and resonance junctions—TNNP determines the web structure and ensures correct combinatorial additivity of spectral data.

Resonance conditions (triangle relations) in web solitons arise exactly when multiple terms in the expansion contribute comparably, and their locations, orientations, and weights are controlled by the cell structure in the relevant totally non-negative Grassmannian (Chang, 2023, Chang, 2024). The same combinatorial data governs soliton interactions in the Sawada–Kotera reduction.

Total non-negativity for Pfaffians is thus the precise BKP analogue of total non-negativity for determinants in the KP-case, controlling both analytic regularity and the enumerative/combinatorial features of the soliton web.

7. Connections and Generalizations

The theory of TNNPs unifies aspects of algebraic combinatorics, integrable systems, and real algebraic geometry. It generalizes total non-negativity from determinants and Grassmannians ($\det A_I \geq 0$) to the skew-symmetric Pfaffian and isotropic/orthogonal Grassmannians. The block-factorization and minor-summation principles underpin both the analytic theory (ensuring regularity of solutions) and the combinatorial classification of resonance types (T-, Y-, O-, P-type webs).

The methodology extends to skew Schur Q–functions, with total non-negativity in Q–coefficients ensuring TNNP status. Prototypical small cases illustrate all principal phenomena—enumerative, algebraic, and geometric—and provide a testbed for conjectural extensions, such as positivity under other transformations or quantization.

TNNP stands as a central structure in the combinatorial and analytic theory of BKP and related integrable systems (Chang, 11 Jan 2026, Chang, 2023, Chang, 2024).