vix.ing · top · new · best · stats · spec

Lattice paths in Young diagrams

2023/05/31 by Thomas Waring, Waring, Thomas K.
Mathematics · #05A17 #05A19 (Primary) #05C38 (Secondary) #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Combinatorics (math.CO) #FOS: Mathematics #Random Matrices and Applications

paper · pdf · doi:10.48550/arxiv.2305.19606

openalex publication_date 2023/05/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Fill each box in a Young diagram with the number of paths from the bottom of its column to the end of its row, using steps north and east. Then, any square sub-matrix of this array starting on the south-east boundary has determinant one. We provide a - to our knowledge - new bijective argument for this result. Using the same ideas, we prove further identities involving these numbers which correspond to an integral orthonormal basis of the inner product space with Gram matrix given by the array in question. This provides an explicit answer to a question (listed as unsolved) raised in Exercise 6.27 c) of Stanley's Enumerative Combinatorics.

Related