Symmetric matrices, Catalan paths, and correlations

Kenyon and Pemantle (2014) gave a formula for the entries of a square matrix in terms of connected principal and almost-principal minors. Each entry is an explicit Laurent polynomial whose terms are the weights of domino tilings of a half Aztec diamond. They conjectured an analogue of this parametri...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete mathematics and theoretical computer science Vol. DMTCS Proceedings, 28th...
Main Authors:	Tsukerman, Emmanuel, Williams, Lauren, Sturmfels, Bernd
Format:	Journal Article Conference Proceeding
Language:	English
Published:	DMTCS 22.04.2020 Discrete Mathematics & Theoretical Computer Science
Subjects:	[math.math-co]mathematics [math]/combinatorics [math.co] Combinatorics Mathematics Combinatorics
ISSN:	1365-8050, 1462-7264, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	Kenyon and Pemantle (2014) gave a formula for the entries of a square matrix in terms of connected principal and almost-principal minors. Each entry is an explicit Laurent polynomial whose terms are the weights of domino tilings of a half Aztec diamond. They conjectured an analogue of this parametrization for symmetric matrices, where the Laurent monomials are indexed by Catalan paths. In this paper we prove the Kenyon-Pemantle conjecture, and apply this to a statistics problem pioneered by Joe (2006). Correlation matrices are represented by an explicit bijection from the cube to the elliptope.
ISSN:	1365-8050 1462-7264 1365-8050
DOI:	10.46298/dmtcs.6337