A curious family of binomial determinants that count rhombus tilings of a holey hexagon
From MaRDI portal
Publication:2000656
Abstract: We evaluate a curious determinant, first mentioned by George Andrews in 1980 in the context of descending plane partitions. Our strategy is to combine the famous Desnanot-Jacobi-Dodgson identity with automated proof techniques. More precisely, we follow the holonomic ansatz that was proposed by Doron Zeilberger in 2007. We derive a compact and nice formula for Andrews's determinant, and use it to solve a challenge problem that we posed in a previous paper. By noting that Andrews's determinant is a special case of a two-parameter family of determinants, we find closed forms for several one-parameter subfamilies. The interest in these determinants arises because they count cyclically symmetric rhombus tilings of a hexagon with several triangular holes inside.
Recommendations
- Enumerating some symmetry classes of rhombus tilings of holey hexagons
- The number of rhombus tilings of a ``punctured hexagon and the minor summation formula
- Binomial determinants for tiling problems yield to the holonomic ansatz
- scientific article; zbMATH DE number 1944620
- Tiling enumeration of hexagons with off-central holes
- Descending plane partitions and rhombus tilings of a hexagon with a triangular hole
- A factorization theorem for lozenge tilings of a hexagon with triangular holes
- scientific article; zbMATH DE number 1741011
- A tiling interpretation of the \(q\)-binomial coefficients
- Enumeration of lozenge tilings of punctured hexagons
Cites work
- scientific article; zbMATH DE number 3687387 (Why is no real title available?)
- scientific article; zbMATH DE number 1380572 (Why is no real title available?)
- A curious family of binomial determinants that count rhombus tilings of a holey hexagon
- Advanced computer algebra for determinants
- Advanced determinant calculus
- Advanced determinant calculus: a complement
- Binomial determinants, paths, and hook length formulae
- Descending plane partitions and rhombus tilings of a hexagon with a triangular hole
- Determinants through the looking glass
- Enumeration of Lozenge tilings of hexagons with a central triangular hole
- On the Vector Representations of Induced Matroids
- Plane partitions. III: The weak Macdonald conjecture
- Proof of George Andrews's and David Robbins's \(q\)-TSPP conjecture
- The holonomic ansatz. II: Automatic discovery(!) and proof(!!) of holonomic determinant evaluations
Cited in
(10)- The number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis. I
- scientific article; zbMATH DE number 1944620 (Why is no real title available?)
- A non-automatic (!) application of Gosper's algorithm evaluates a determinant from tiling enumeration
- Binomial determinants for tiling problems yield to the holonomic ansatz
- Advanced computer algebra for determinants
- Determinant evaluations inspired by Di Francesco's determinant for twenty-vertex configurations
- A curious family of binomial determinants that count rhombus tilings of a holey hexagon
- The number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis. II
- Descending plane partitions and rhombus tilings of a hexagon with a triangular hole
- The holonomic ansatz. II: Automatic discovery(!) and proof(!!) of holonomic determinant evaluations
This page was built for publication: A curious family of binomial determinants that count rhombus tilings of a holey hexagon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000656)
