{
  "schema_version": 1,
  "problem_number": "OWR-16164-020",
  "title": "On a Determinant of Teufl and Wagner Related to Set Partitions: Divisibility by the Catalan Power of det A",
  "author": {
    "name": "Alper Ferudun",
    "affiliation": "Mercury Software GmbH",
    "url": "https://github.com/AlperTheKing"
  },
  "abstract": "Teufl and Wagner posed the following problem (Problem 1 of their contribution to Oberwolfach Report 23/2018, pp. 1457–1458). Let A = (a_ij) be an n × n matrix of indeterminates, and let T = T(A) be the matrix, indexed by the set partitions of an n-set, whose entry (P, Q) is the sum of the weights of the transitions from P to Q; a transition is a set of edges between two copies X, Y of the n-set which completes spanning trees of the blocks of P in X to a forest all of whose components meet Y and induce Q on Y. Is det T always divisible by (det A)^(C_n), where C_n is the n-th Catalan number? The report states det T = (det A)^(B_n) for n ≤ 3 (B_n the Bell number) and det T = (det A)^14 per A for n = 4, an experimental factorisation for n = 5 and experimental evidence for n = 6. We prove that the answer is yes for every n: in Z[a_ij] one has det T = (det A)^(C_n) R_n, where R_n is the determinant of T(A) on an invariant subspace K of dimension B_n − C_n which does not depend on A, and the map induced by T(A) on the quotient, which has the non-crossing partitions as a basis, has determinant exactly (det A)^(C_n). The proof uses the Grassmann-algebra representation of forests of Caracciolo, Sokal and Sportiello, in which T(A) becomes an integral operator G(A) with G(−A^T) G(A) = (−1)^n (det A)^2. These authors announced, without proof, that the image of the representation has the non-crossing partitions as a basis; we did not find their proof in print (the source file of their preprint contains a draft) and give one for the case needed. The subspace K, the dimension and the planar basis of the quotient and the integrality of the projection are already contained in the work of Kenyon and Wilson on boundary partitions in trees, together with the meander determinant of Di Francesco, Golinelli and Guitter. The note adds the determinant on the quotient, hence the divisibility, the factorisation over Z[a_ij], a proof of the formula for n = 4, and the exactness of the exponent C_n for 4 ≤ n ≤ 8 (computer-assisted for n ≥ 5). A second proof, found by one of the independent verification runs, uses the tree pairing of Kenyon and Wilson and the matrix-tree theorem. Factors of R_5 and R_6 are only tested; exactness for n ≥ 9 and a description of R_n remain open. The wording of the UnsolvedMath record OWR-16164-020 mixes in the title of the next problem of the report. A literature search found no answer, which is not a proof of novelty; the divisibility is close to the published structure theory and may be known to specialists. This is an unrefereed note.",
  "result_type": "COMPLETE_PROOF",
  "categories": [
    "math.CO",
    "math-ph"
  ],
  "keywords": [
    "set partitions",
    "transfer matrix",
    "spanning forests",
    "determinant",
    "Catalan numbers",
    "non-crossing partitions",
    "Grassmann algebra",
    "Berezin integral",
    "matrix-tree theorem",
    "permanent",
    "electrical networks",
    "complete proof",
    "Oberwolfach Reports problems",
    "UnsolvedMath",
    "OWR-16164-020",
    "math.CO",
    "math-ph",
    "open mathematics"
  ],
  "manuscript_version_date": "2026-10-11",
  "publication_date": "2026-10-11",
  "publication_date_kind": "first public online release",
  "version": "1.0",
  "date_modified": "2026-10-11",
  "presentation_revision_only": false,
  "doi_archived_file_version": "1.0",
  "status": "unrefereed preprint",
  "canonical_url": "https://eulersolve.org/papers/owr-16164-020/",
  "pdf_url": "https://eulersolve.org/papers/owr-16164-020/paper.pdf?v=bfa3aec9938a",
  "doi": "10.5281/zenodo.23298482",
  "zenodo_record_url": "https://zenodo.org/records/23298482",
  "license": "https://creativecommons.org/licenses/by/4.0/",
  "scope_caveat": "Answers Problem 1 of E. Teufl and S. Wagner (Oberwolfach Report 23/2018, pp. 1457–1458) in the affirmative for every n. The Grassmann-algebra representation of forests is due to Caracciolo, Jacobsen, Saleur, Sokal and Sportiello; the statement that its image has the non-crossing partitions as a basis was announced without proof by Caracciolo, Sokal and Sportiello (2007) and is proved in the note for the case needed, not claimed as new; the subspace K and the structure of the quotient are due to Kenyon and Wilson. The exactness of the exponent for 5 ≤ n ≤ 8 is computer-assisted; exactness for n ≥ 9 and the cofactor are open. The journal versions of the cited papers were not compared, and a paper of Caracciolo, Sokal and Sportiello of 2017 was not accessible to us. The divisibility is close to the published structure theory and may be known to specialists.",
  "files": {
    "paper.pdf": {
      "sha256": "bfa3aec9938a2a28aebac8e905abff2e132080e753f845e746485f66d16be677"
    },
    "source.zip": {
      "sha256": "16860febb2a757d94feed7e23bec6cb85b0c121bc46091d6bae5af75be23b153"
    },
    "verification_report.md": {
      "sha256": "306b991a5f7ce017a404bbd748185a1c8f150f2151b820d01676e8f6af7f53bf"
    }
  },
  "ai_use_disclosure": "AI-assisted tools supported research, computation, proof development, and manuscript preparation. The author remains responsible for all claims and the final text."
}