中文
相关论文

相关论文: A reciprocity theorem for domino tilings

200 篇论文

The theme of this article is a "reciprocity" between bounded up-down paths and bounded alternating sequences. Roughly speaking, this ``reciprocity" manifests itself by the fact that the extension of the sequence of numbers of paths of…

组合数学 · 数学 2024-07-30 Johann Cigler , Christian Krattenthaler

We consider tilings of a rectangle which is n units wide and m units long by non-overlapping 1 X 1 squares and s X s squares. Bivariate generating functions are computed with the Transfer Matrix Method for moderately large but fixed widths…

组合数学 · 数学 2016-09-14 Richard J. Mathar

We show that given any tiling of Euclidean space, any geometric patterns of points, we can find a patch of tiles (of arbitrarily large size) so that copies of this patch appear in the tiling nearly centered on a scaled and translated…

动力系统 · 数学 2008-09-09 Rafael de la Llave , Alistair Windsor

We consider three-dimensional domino tilings of cylinders $\mathcal{D} \times [0,N] \subset \mathbb{R}^3$, where $\mathcal{D} \subset \mathbb{R}^2$ is a balanced quadriculated disk and $N \in \mathbb{N}$. A flip is a local move in the space…

组合数学 · 数学 2025-02-03 Raphael de Marreiros

We continue the exploration of a question of dice relabeling posed by Gallian and Rusin: Given $n$ dice, each labeled 1 through $m$, how many ways are there to relabel the dice without changing the frequencies of the possible sums? We…

组合数学 · 数学 2024-12-10 Yikai Chao , Josh Gabel , Carlye Larson , George David Nasr

There is a natural generalization of domino tilings to tilings of a polygon by hexagons, or, dually, configurations of oriented curves that meet in triples. We show exactly when two such tilings can be connected by a series of moves…

组合数学 · 数学 2016-09-13 Dylan P. Thurston

We consider the problem of comparing t-structures under the derived McKay correspondence and for tilting equivalences. We relate the t-structures using certain natural torsion theories. As an application, we give a criterion for rationality…

代数几何 · 数学 2015-12-17 Morgan Brown , Ian Shipman

Let $\mathcal{T}_n$ be the set of ribbon $L$-shaped $n$-ominoes for some $n\ge 4$ even, and let $\mathcal{T}_n^+$ be $\mathcal{T}_n$ with an extra $2\times 2$ square. We investigate signed tilings of rectangles by $\mathcal{T}_n$ and…

组合数学 · 数学 2016-03-01 Kenneth Gill , Viorel Nitica

We fix $n$ and say a square in the two-dimensional grid indexed by $(x,y)$ has color $c$ if $x+y \equiv c \pmod{n}$. A {\it ribbon tile} of order $n$ is a connected polyomino containing exactly one square of each color. We show that the set…

组合数学 · 数学 2007-05-23 Scott Sheffield

We consider the subgroup of the abelian sandpile group of the grid graph consisting of configurations of sand that are symmetric with respect to central vertical and horizontal axes. We show that the size of this group is (i) the number of…

组合数学 · 数学 2014-06-03 Laura Florescu , Daniela Morar , David Perkinson , Nick Salter , Tianyuan Xu

Let $m,k$ be fixed positive integers. Determining the generating function for the number of tilings of an $m\times n$ rectangle by $k\times 1$ rectangles is a long-standing open problem to which the answer is only known in certain special…

组合数学 · 数学 2022-08-09 Mudit Aggarwal , Samrith Ram

Let $A$ be a hereditary algebra over an algebraically closed field $k$ and $A^{(m)}$ be the $m$-replicated algebra of $A$. Given an $A^{(m)}$-module $T$, we denote by $\delta (T)$ the number of non isomorphic indecomposable summands of $T$.…

表示论 · 数学 2013-01-24 Shunhua Zhang

This short note reports a master theorem on tight asymptotic solutions to divide-and-conquer recurrences with more than one recursive term: for example, T(n) = 1/4 T(n/16) + 1/3 T(3n/5) + 4 T(n/100) + 10 T(n/300) + n^2.

综合文献 · 计算机科学 2007-05-23 Ming-Yang Kao

We prove a general theorem that gives a linear recurrence for tuples of paths in every cylindrical network. This can be seen as a cylindrical analog of the Lindstr\"om-Gessel-Viennot theorem. We illustrate the result by applying it to Schur…

组合数学 · 数学 2018-05-04 Pavel Galashin , Pavlo Pylyavskyy

Given a nonnegative integer $m$ and a finite collection ${\mathcal A}$ of linear forms on ${\mathbb Q}^d$, the arrangement of affine hyperplanes in ${\mathbb Q}^d$ defined by the equations $\alpha(x) = k$ for $\alpha \in {\mathcal A}$ and…

组合数学 · 数学 2007-05-23 Christos A. Athanasiadis

The manuscript studies configurations of non-overlapping non-bonding dominoes on finite rectangular boards of unit squares characterized by row and column number. The non-bonding dominoes are defined here by the requirement that any domino…

组合数学 · 数学 2024-04-30 Richard J. Mathar

We introduce a family of planar regions, called Aztec diamonds, and study the ways in which these regions can be tiled by dominoes. Our main result is a generating function that not only gives the number of domino tilings of the Aztec…

组合数学 · 数学 2008-02-03 Noam Elkies , Greg Kuperberg , Michael Larsen , James Propp

This article is dedicated to domino tilings of square grids. In each of these grids domino tilings are represented using linear-recurrent sequences. For different grids are determined new dependencies.

历史与综述 · 数学 2017-08-01 Valcho Milchev , Tsvetelina Karamfilova

We conjecture an explicit formula for the higher dimensional Dirichlet character; the formula is based on the K-theory of the so-called noncommutative tori. It is proved, that our conjecture is true for the two-dimensional and…

算子代数 · 数学 2011-08-23 Igor Nikolaev

In this paper, we prove that if a finite number of rectangles, every of which has at least one integer side, perfectly tile a big rectangle then there exists a strategy which reduces the number of these tiles (rectangles) without violating…

历史与综述 · 数学 2011-11-30 Sultan Hussain , Usman Ali