Christian Krattenthaler
It is shown that the descending plane partitions of Andrews can be geometrically realized as cyclically symmetric rhombus tilings of a certain hexagon where an equilateral triangle of side length 2 has been removed from its centre. Thus, the lattice structure for descending plane partitions, as introduced by Mills, Robbins and Rumsey, allows for an elegant visualization.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We compute the number of rhombus tilings of a hexagon with side lengths a,b,c,a,b,c which contain the central rhombus and the number of rhombus tilings of a hexagon with side lengths a,b,c,a,b,c which contain the `almost central` rhombus above the centre.
We compute the number of rhombus tilings of a hexagon with sides $N,M,N,N,M,N$, which contain a fixed rhombus on the symmetry axis that cuts through the sides of length $M$.
We compute the number of rhombus tilings of a hexagon with sides $N,M,N,N,M,N$, which contain a fixed rhombus on the symmetry axis. A special case solves a problem posed by Jim Propp.
We compute the number of rhombus tilings of a hexagon with side lengths N,M,N,N,M,N, with N and M having the same parity, which contain a particular rhombus next to the center of the hexagon. The special case N=M of one of our results solves a problem posed by Propp. In the proofs, Hankel determinants featuring Bernoulli numbers play an important role.
A rhombus tiling of a hexagon is said to be centered if it contains the central lozenge. We compute the number of vertically symmetric rhombus tilings of a hexagon with side lengths $a, b, a, a, b, a$ which are centered. When $a$ is odd and $b$ is even, this shows that the probability that a random vertically symmetric rhombus tiling of a $a, b, a, a, b, a$ hexagon is centered is exactly the same as the probability that a random rhombus tiling of a $a, b, a, a, b, a$ hexagon is centered. This also leads to a factorization theorem for the number of all rhombus tilings of a hexagon which are cen…
We compute the number of rhombus tilings of a hexagon with sides n, n, N, n, n, N, where two triangles on the symmetry axis touching in one vertex are removed. The case of the common vertex being the center of the hexagon solves a problem posed by Propp.
We state, discuss, provide evidence for, and prove in special cases the conjecture that the probability that a random tiling by rhombi of a hexagon with side lengths $2n+a,2n+b,2n+c,2n+a,2n+b,2n+c$ contains the (horizontal) rhombus with coordinates $(2n+x,2n+y)$ is equal to ${1/3} + g_{a,b,c,x,y}(n) {\binom {2n}{n}}^3 / \binom {6n}{3n}$, where $g_{a,b,c,x,y}(n)$ is a rational function in $n$. Several specific instances of this "1/3-phenomenon" are made explicit.
We compute the number of all rhombus tilings of a hexagon with sides $a,b+1,c,a+1,b,c+1$, of which the central triangle is removed, provided $a,b,c$ have the same parity. The result is a product of four numbers, each of which counts the number of plane partitions inside a given box. The proof uses nonintersecting lattice paths and a new identity for Schur functions, which is proved by means of the minor summation formula of Ishikawa and Wakayama. A symmetric generalization of this identity is stated as a conjecture.
We compute the number of rhombus tilings of a hexagon with sides $a+2,b+2,c+2,a+2,b+2,c+2$ with three fixed tiles touching the border. The particular case $a=b=c$ solves a problem posed by Propp. Our result can also be viewed as the enumeration of plane partitions having $a+2$ rows and $b+2$ columns, with largest entry $\le c+2$, with a given number of entries $c+2$ in the first row, a given number of entries 0 in the last column and a given bottom-left entry.
Propp conjectured that the number of lozenge tilings of a semiregular hexagon of sides $2n-1$, $2n-1$ and $2n$ which contain the central unit rhombus is precisely one third of the total number of lozenge tilings. Motivated by this, we consider the more general situation of a semiregular hexagon of sides $a$, $a$ and $b$. We prove explicit formulas for the number of lozenge tilings of these hexagons containing the central unit rhombus, and obtain Propp's conjecture as a corollary of our results.
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-para…
Trimer covers in the triangular grid: twenty mostly open problems
本文将三角网格铺砌研究从二聚体推广到三聚体，引入苯环区域并提出二十个大多未解决的精确计数问题。
We prove that a Schur function of rectangular shape $(M^n)$ whose variables are specialized to $x_1,x_1^{-1},...,x_n,x_n^{-1}$ factorizes into a product of two odd orthogonal characters of rectangular shape, one of which is evaluated at $-x_1,...,-x_n$, if $M$ is even, while it factorizes into a product of a symplectic character and an even orthogonal character, both of rectangular shape, if $M$ is odd. It is furthermore shown that the first factorization implies a factorization theorem for rhombus tilings of a hexagon, which has an equivalent formulation in terms of plane partitions. A simila…
The rhombus tilings of a simply connected domain of the Euclidean plane are known to form a flip-connected space (a flip is the elementary operation on rhombus tilings which rotates 180° a hexagon made of three rhombi). Motivated by the study of a quasicrystal growth model, we are here interested in better understanding how "tight" rhombus tiling spaces are flip-connected. We introduce a lower bound (Hamming-distance) on the minimal number of flips to link two tilings (flip-distance), and we investigate whether it is sharp. The answer depends on the number n of different edge directions in the…
We give another proof for the (-1)-enumeration of self-complementary plane partitions with at least one odd side-length by specializing a certain Schur function identity. The proof is analogous to Stanley's proof for the ordinary enumeration. In addition, we obtain enumerations of 180-degree symmetric rhombus tilings of hexagons with a barrier of arbitrary length along the central line.
Consider a semi-regular hexagon on the triangular lattice (that is, the lattice consisting of unit equilateral triangles, drawn so that one family of lines is vertical). Rhombus (or lozenge) tilings of this region may be represented in at least two very different ways: as families of non-intersecting lattice paths; or alternatively as perfect matchings of a certain sub-graph of the hexagonal lattice. In this article we show how the lattice path representation of tilings may be utilised in order to calculate the entries of the inverse Kasteleyn matrix that arises from interpreting tilings as pe…
In the paper [J. Combin. Theory Ser. A 43 (1986), 103--113], Stanley gives formulas for the number of plane partitions in each of ten symmetry classes. This paper together with results by Andrews [J. Combin. Theory Ser. A 66 (1994), 28-39] and Stembridge [Adv. Math 111 (1995), 227-243] completes the project of proving all ten formulas. We enumerate cyclically symmetric, self-complementary plane partitions. We first convert plane partitions to tilings of a hexagon in the plane by rhombuses, or equivalently to matchings in a certain planar graph. We can then use the permanent-determinant method …
Consider the unit triangular lattice in the plane with origin $O$, drawn so that one of the sets of lattice lines is vertical. Let $l$ and $l'$ denote respectively the vertical and horizontal lines that intersect $O$. Suppose the plane contains a pair of triangular holes of side length two, distributed symmetrically with respect to $l$ and $l'$, and oriented so that both holes point toward $O$. Unit rhombus tilings of three different regions of the plane are considered, namely: tilings of the entire plane; tilings of the half plane that lies to the left of $l$ (where $l$ is considered a free b…
We show that there is the same number of (n,l)-alternating sign trapezoids as there is of column strict shifted plane partitions of class l-1 with at most n parts in the top row, thereby proving a result that was conjectured independently by Behrend and Aigner. The first objects generalize alternating sign triangles, which have recently been introduced by Ayyer, Behrend and the author who showed that they are counted by the same formula as alternating sign matrices. Column strict shifted plane partitions of a fixed class were introduced in a slightly different form by Andrews, and they essenti…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。