Robert Davis, Greg Simay
Integer compositions, integer partitions, Fibonacci numbers, and generalizations of these have recently been shown to be interconnected via two-toned tilings of horizontal grids. In this article, we present refinements of two-toned tilings, describe functions which analyze them, and apply these to generalizations of integer compositions and partitions which interpolate between the two.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
On two-toned tilings and $(m,n)$-words
该研究在组合数学领域，建立了$(m,n)$-字集合与对应长度带状双色铺砌集合的显式双射，为两类组合对象的等价研究提供了对应关系。
Combinatorics of a fractal tiling family
本文研究二元初始瓦片经有限递归平铺生成自相似分形的组合计数问题，利用伯恩赛德引理证明特定2x2初始矩阵下恰有232个真正不同的分形，并给出3x3对称情形的部分结果。
Enumeration of tilings is the mathematical study concerning the total number of coverings of regions by similar pieces without gaps or overlaps. Enumeration of tilings has become a vibrant subfield of combinatorics with connections and applications to diverse mathematical areas. In 1999, James Propp published his well-known list of 32 open problems in the field. The list has got much attention from experts around the world. After two decades, most of the problems on the list have been solved and generalized. In this paper, we propose a set of new tiling problems. This survey paper contributes …
We study the space of all tilings which can be obtained using the Robinson tiles (this is a two-dimensional subshift of finite type). We prove that it has a unique minimal subshift, and describe it by means of a substitution. This description allows to compute its cohomology groups, and prove that it is a model set.
The article 'A "regular" pentagonal tiling of the plane' by P. L. Bowers and K. Stephenson defines a conformal pentagonal tiling. This is a tiling of the plane with remarkable combinatorial and geometric properties. However, it doesn't have finite local complexity in any usual sense, and therefore we cannot study it with the usual tiling theory. The appeal of the tiling is that all the tiles are conformally regular pentagons. But conformal maps are not allowable under finite local complexity. On the other hand, the tiling can be described completely by its combinatorial data, which rather auto…
Recently, Kenyon and Wilson introduced Dyck tilings, which are certain tilings of the region between two Dyck paths. The enumeration of Dyck tilings is related with hook formulas for forests and the combinatorics of Hermite polynomials. The first goal of this work is to give an alternative point of view on Dyck tilings by making use of the weak order and the Bruhat order on permutations. Then we introduce two natural generalizations: $k$-Dyck tilings and symmetric Dyck tilings. We are led to consider Stirling permutations, and define an analog of the Bruhat order on them. We show that certain …
The combinatorics of tilings of a hexagon of integer side-length $n$ by 120 degree - 60 degree diamonds of side-length 1 has a long history, both directly (as a problem of interest in thermodynamic models) and indirectly (through the equivalence to plane partitions). Formulae as products of factorials have been conjectured and, one by one, proven for the number of such tilings under each of the symmetries of the hexagon. However, when this note was written the entry for the number of distinct such tilings in the Online Encyclopedia of Integer Sequences (OEIS) consisted of little more than a ta…
We generalize Aztec diamond theorem (N. Elkies, G. Kuperberg, M. Larsen, and J. Propp, Alternating-sign matrices and domino tilings, Journal Algebraic Combinatoric, 1992) by showing that the numbers of tilings of a certain family of regions in the square lattice with southwest-to-northeast diagonals drawn in are given by powers of 2. We present a proof for the generalization by using a bijection between domino tilings and non-intersecting lattice paths.
Major Index on Catalan Combinatorics
本文研究了 $r$-Dyck 路径等 Catalan 组合对象上的逆序数和 major index 统计量，并证明了它们与 Dyck 路径上的对应统计量具有等分布性。
We prove that the partition function for tripartite double-dimer configurations of a planar bipartite graph satisfies a recurrence related to the Desnanot-Jacobi identity from linear algebra. A similar identity for the dimer partition function was established nearly 20 years ago by Kuo and has applications to random tiling theory and the theory of cluster algebras. This work was motivated in part by the potential for applications in these areas. Additionally, we discuss an application to Donaldson-Thomas and Pandharipande-Thomas theory which will be the subject of a forthcoming paper. The proo…
Torsors and tilings from toric toggling
本文研究圈图独立集切换的环面类比，用网格编码轨道，通过交换双射构造蛇群与衔尾蛇群的torsors，并刻画圆柱与环面的平行四边形铺砌。
Introducing irrational enumeration: analytic combinatorics for objects of irrational size
本文提出了一种用于处理无理大小对象的分析组合学方法，通过生成函数和奇点分析技术，研究了多种无理数相关的组合结构的渐进行为。
Partitioning a set into similar, if not, identical, parts is a fundamental research topic in combinatorics. The question of partitioning the integers in various ways has been considered throughout history. Given a set $\{x_1, \ldots, x_n\}$ of integers where $x_1<\cdots<x_n$, let the {\it gap sequence} of this set be the nondecreasing sequence $d_1, \ldots, d_{n-1}$ where $\{d_1, \ldots, d_{n-1}\}$ equals $\{x_{i+1}-x_i:i\in\{1,\ldots, n-1\}\}$ as a multiset. This paper addresses the following question, which was explicitly asked by Nakamigawa: can the set of integers be partitioned into sets …
Promotion and rowmotion in rational Catalan combinatorics
本文研究了促进与行运动在有理Catalan组合学中的等价性，通过扩展双射与RSK类对应关系，揭示了 generalized Dyck paths 上的双射性质。
Metaheuristic Generation of Brane Tilings
本文提出利用模拟退火的组合优化方法，显式构造几何一致的膜铺砌，以高效生成规范理论，并推导出含26个量子场的新实例。
We study the compositions of an integer n whose part sizes do not exceed a fixed integer k. We use the methods of analytic combinatorics to obtain precise asymptotic formulas for the number of such compositions, the total number of parts among all such compositions, the expected number of parts in such a composition, the total number of times a particular part size appears among all such compositions, and the expected multiplicity of a given part size in such a composition. Along the way we also obtain recurrences and generating functions for calculating several of these quantities. Our result…
A cluster of results on amplituhedron tiles
本文研究了amplituhedron瓷砖的性质，提出了一种新的瓷砖类型，并展示了其与簇代数的联系。
Approximately Sampling Elements with Fixed Rank in Graded Posets
针对分级偏序集中通常为#P-完全的固定秩计数问题，提出基于balanced bias的带偏Markov chains近似均匀采样方法，在期望多项式时间内生成任意固定秩样本，并首次实现受限整数划分的高效均匀采样。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。