Domino tilings, nonintersecting lattice paths and subclasses of Koutschan-Krattenthaler-Schlosser determinants

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Chen, Qipin, Chern, Shane, Yoshida, Atsuro
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912590400061440
author Chen, Qipin
Chern, Shane
Yoshida, Atsuro
author_facet Chen, Qipin
Chern, Shane
Yoshida, Atsuro
contents Koutschan, Krattenthaler and Schlosser recently considered a family of binomial determinants. In this work, we give combinatorial interpretations of two subclasses of these determinants in terms of domino tilings and nonintersecting lattice paths, thereby partially answering a question of theirs. Furthermore, the determinant evaluations established by Koutschan, Krattenthaler and Schlosser produce many product formulas for our weighted enumerations of domino tilings and nonintersecting lattice paths. However, there are still two enumerations left corresponding to conjectural formulas made by the three. We hereby prove the two conjectures using the principle of holonomic Ansatz plus the approach of modular reduction for creative telescoping, and hence fill the gap.
format Preprint
id arxiv_https___arxiv_org_abs_2507_15665
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Domino tilings, nonintersecting lattice paths and subclasses of Koutschan-Krattenthaler-Schlosser determinants
Chen, Qipin
Chern, Shane
Yoshida, Atsuro
Combinatorics
Symbolic Computation
Number Theory
Primary 15A15, Secondary 05A15, 05B45, 82B20
Koutschan, Krattenthaler and Schlosser recently considered a family of binomial determinants. In this work, we give combinatorial interpretations of two subclasses of these determinants in terms of domino tilings and nonintersecting lattice paths, thereby partially answering a question of theirs. Furthermore, the determinant evaluations established by Koutschan, Krattenthaler and Schlosser produce many product formulas for our weighted enumerations of domino tilings and nonintersecting lattice paths. However, there are still two enumerations left corresponding to conjectural formulas made by the three. We hereby prove the two conjectures using the principle of holonomic Ansatz plus the approach of modular reduction for creative telescoping, and hence fill the gap.
title Domino tilings, nonintersecting lattice paths and subclasses of Koutschan-Krattenthaler-Schlosser determinants
topic Combinatorics
Symbolic Computation
Number Theory
Primary 15A15, Secondary 05A15, 05B45, 82B20
url https://arxiv.org/abs/2507.15665