Related papers: Binomial Determinants for Tiling Problems Yield to…
Defant, Li, Propp, and Young recently resolved two enumerative conjectures of Propp concerning the tilings of regions in the hexagonal grid called benzels using two types of prototiles called stones and bones (with varying constraints on…
S.~Elnitsky (1997) gave an elegant bijection between rhombic tilings of $2n$-gons and commutation classes of reduced words in the symmetric group on $n$ letters. P.~Magyar (1998) found an important construction of the Bott-Samelson…
We consider polygonal tilings of certain regions and use these to give intuitive definitions of tiling-based perimeter and area. We apply these definitions to rhombic tilings of Elnitsky polygons, computing sharp bounds and average values…
This paper considers the properties of Tribonacci numbers on identities, matrices, and determinants. In the first front part, we obtain several symmetric identities of Tribonacci numbers by a matrix-based approach and binomial inversion…
In this paper we evaluate some Toeplitz-type determinants. Let $n>1$ be an integer. We prove the following two basic identities: \begin{align*} \det{[j-k+\delta_{jk}]_{1\leq j,k\leq n}}&=1+\frac{n^2(n^2-1)}{12}, \\…
Kronecker coefficients encode the tensor products of complex irreducible representations of symmetric groups. Their stability properties have been considered recently by several authors (Vallejo, Pak and Panova, Stembridge). We describe a…
The symmetrized Slater determinants of orthogonal polynomials with respect to a non-negative Borel measure are shown to be represented by constant multiple of Hankel determinants of two other families of polynomials, and they can also be…
Can you decide if there is a coincidence in the numbers counting two different combinatorial objects? For example, can you decide if two regions in $\mathbb{R}^3$ have the same number of domino tilings? There are two versions of the…
We study tilings of polygons $R$ with arbitrary convex polygonal tiles. Such tilings come in continuous families obtained by moving tile edges parallel to themselves (keeping edge directions fixed). We study how the tile shapes and areas…
We propose the first algebraic determinantal formula to enumerate tilings of a centro-symmetric octagon of any size by rhombi. This result uses the Gessel-Viennot technique and generalizes to any octagon a formula given by Elnitsky in a…
We consider spaces of modular forms attached to definite orthogonal groups of low even rank and nontrivial level, equipped with Hecke operators defined by Kneser neighbours. After reviewing algorithms to compute with these spaces, we…
We consider a wide class of determinants whose entries are moments of the so-called semiclassical functionals and we show that they are tau functions for an appropriate isomonodromic family which depends on the parameters of the symbols for…
We introduce a new method for studying gap probabilities in a class of discrete determinantal point processes with double contour integral kernels. This class of point processes includes uniform measures of domino and lozenge tilings as…
In this paper we study algorithms for tiling problems. We show that the conditions $(T1)$ and $(T2)$ of Coven and Meyerowitz, conjectured to be necessary and sufficient for a finite set $A$ to tile the integers, can be checked in time…
This paper is intended to give closed formulae for binomial determinants with consecutive or almost consecutive rows or columns, as well as calculating the generator of left nullspaces defined by some binomial matrices. In the meantime, we…
Ilse Fischer and the second author introduced in [Algebr. Comb. 7 (2024), no. 5, 1319-1345] a two parameter family of polynomials defined as sums over totally symmetric plane partitions and connected to alternating sign matrices and…
Determinantal polynomials play a crucial role in semidefinite programming problems. Helton-Vinnikov proved that real zero (RZ) bivariate polynomials are determinantal. However, it leads to a challenging problem to compute such a…
In this note, we explore certain determinantal descriptions of the Robbins numbers. Techniques used for this include continued fractions, Riordan arrays and series inversion. Proven and conjectured representations involve the determinants…
We solve and generalize an open problem posted by James Propp (Problem 16 in New Perspectives in Geometric Combinatorics, Cambridge University Press, 1999) on the number of tilings of quasi-hexagonal regions on the square lattice with every…
We discuss asymptotic properties of a family of discrete probability measures which may be used to model particle configurations with a wall on a set of discrete nodes. The correlations are shown to be determinantal and are expressed in…