Harald Helfgott
We compute the probability of any local pattern at an arbitrary position in a random dimer configuration in a square grid with an Aztec-diamond boundary.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Round Aztec windows, a dual of the Aztec diamond theorem and a curious symmetry of the correlation of diagonal slits
本文研究了Aztec矩形和环面Aztec钻石中特定孔洞形状的多米诺平铺数量，证明了其平铺数和完美匹配数可由简单乘积公式表示，并揭示了斜对角裂缝关联的对称性。
Perfect t-embeddings and the octahedron equation of the two-periodic Aztec diamond
本文研究双周期阿兹特克钻石中完美t-嵌入与八面体方程的关系，证明t-嵌入和折纸映射的位置可由八面体方程在平坦初始条件下的解的密度函数之和表示。
Fluctuations in the Aztec diamonds via a space-like maximal surface in Minkowski 3-space
本文通过三维 Minkowski 空间中类空极大曲面的内蕴共形结构，为均匀 Aztec 钻石中二聚体涨落的标度极限提供了新描述，并验证了其与折纸映射图的联系及新框架的契合性。
We study random domino tilings of a Double Aztec diamond, a region consisting of two overlapping Aztec diamonds. The random tilings give rise to two discrete determinantal point processes called the K-and L-particle processes. The correlation kernel of the K-particles was derived in Adler, Johansson and van Moerbeke (2011), who used it to study the limit process of the K-particles with different weights for horizontal and vertical dominos. Let the size of both, the Double Aztec diamond and the overlap, tend to infinity such that the two arctic ellipses just touch; then they show that the fluct…
We consider asymtotics of a domino tiling model on a class of domains which we call rectangular Aztec diamonds. We prove the Law of Large Numbers for the corresponding height functions and provide explicit formulas for the limit. For a special class of examples, the explicit parametrization of the frozen boundary is given. It turns out to be an algebraic curve with very special properties. Moreover, we establish the convergence of the fluctuations to the Gaussian Free Field in appropriate coordinates. Our main tool is a recently developed moment method for discrete particle systems.
We get four quartered Aztec diamonds by dividing an Aztec diamond region by two zigzag cuts passing its center. W. Jockusch and J. Propp (in an unpublished work) found that the number of tilings of quartered Aztec diamonds is given by simple product formulas. In this paper we present a simple proof for this result.
Based on a bijection between domino tilings of an Aztec diamond and non-intersecting lattice paths, a simple proof of the Aztec diamond theorem is given in terms of Hankel determinants of the large and small Schröder numbers.
Discrete and continuous non-intersecting random processes have given rise to critical "infinite dimensional diffusions", like the Airy process, the Pearcey process and variations thereof. It has been known that domino tilings of very large Aztec diamonds lead macroscopically to a disordered region within an inscribed ellipse (arctic circle in the homogeneous case), and a regular brick-like region outside the ellipse. The fluctuations near the ellipse, appropriately magnified and away from the boundary of the Aztec diamond, form an Airy process, run with time tangential to the boundary. This pa…
The expanded Aztec diamond is a generalized version of the Aztec diamond, with an arbitrary number of long columns and long rows in the middle. In this paper, we count the number of domino tilings of the expanded Aztec diamond. The exact number of domino tilings is given by recurrence relations of state matrices by virtue of the state matrix recursion algorithm, recently developed by the author to solve various two-dimensional regular lattice model enumeration problems.
Perfect t-embeddings of uniformly weighted Aztec diamonds and tower graphs
本文通过构造均匀加权阿兹特克钻石的完美t-嵌入，首次证明存在满足arXiv:2109.06272主定理全部条件的模型，并利用塔图的完美t-嵌入将其高度涨落与阿兹特克钻石等同起来。
The Aztec diamond of order $n$ is the union of lattice squares in the plane intersecting the square $|x|+|y|<n$. The Aztec diamond theorem states that the number of domino tilings of this shape is $2^{n(n+1)/2}$. It was first proved by Elkies, Kuperberg, Larsen and Propp in 1992. We give a new simple proof of this theorem.
We explore the connections between the well-studied Aztec Diamond graphs and a new family of graphs called the Half-Hexagons, discovered by Jonathan Novak. In particular, both families of graphs have very simple domino shuffling algorithms, which turn out to be intimately related. This connection allows us to prove an "arctic parabola" theorem for the Half-Hexagons as a corollary of the Arctic Circle theorem for the Aztec Diamond.
We say that two graphs are similar if their adjacency matrices are similar matrices. We show that the square grid $G_n$ of order $n$ is similar to the disjoint union of two copies of the quartered Aztec diamond $QAD_{n-1}$ of order $n-1$ with the path $P_n^{(2)}$ on $n$ vertices having edge weights equal to~2. Our proof is based on an explicit change of basis in the vector space on which the adjacency matrix acts. The arguments verifying that this change of basis works are combinatorial. In particular, this allows computing the number of spanning trees of quartered Aztec diamonds. We present a…
A Töplitz determinant whose entries are described by a q-analogue of the Narayana polynomials is evaluated by means of Laurent biorthogonal polynomials which allow of a combinatorial interpretation in terms of Schröder paths. As an application, a new proof is given to the Aztec diamond theorem by Elkies, Kuperberg, Larsen and Propp concerning domino tilings of the Aztec diamonds. The proof is based on the correspondence with non-intersecting Schröder paths developed by Eu and Fu.
We are counting the lattice rectangles that can be constructed inside several planar shapes and identify the corresponding sequences in the OEIS.
The author gave a proof of a generalization of the Aztec diamond theorem for a family of $4$-vertex regions on the square lattice with southwest-to-northeast diagonals drawn in (Electron. J. Combin., 2014) by using a bijection between tilings and non-intersecting lattice paths. In this paper, we use Kuo graphical condensation to give a new proof.
This note derives the characteristic polynomial of a graph that represents nonjump moves in a generalized game of checkers. The number of spanning trees is also determined.
In this paper we determine the interaction of diagonal defect clusters in regions of an Aztec rectangle that scale to arbitrary points on its symmetry axis (in earlier work we treated the case when this point was the center of the scaled Aztec rectangle). We use the resulting formulas to determine the asymptotics of the correlation of defects that are macroscopically separated from one another and feel the influence of the boundary. In several of the treated situations this seems not to be accomplishable by previous methods. Our applications include the case of two long neutral strings, which …
Random domino tilings of the Aztec diamond shape exhibit interesting features and some of the statistical properties seen in random matrix theory. As a statistical mechanical model it can be thought of as a dimer model or as a certain random surface. We consider the Aztec diamond with a two-periodic weighting which exhibits all three possible phases that occur in these types of models, often referred to as solid, liquid and gas. To analyze this model, we use entries of the inverse Kasteleyn matrix which give the probability of any configuration of dominoes. A formula for these entries, for thi…
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.
In this article we define a generalization of the domino shuffling algorithm for tilings of the Aztec diamond to the interacting $k$-tilings recently introduced by S. Corteel, A. Gitlin, and the first author. We describe the algorithm both in terms of dynamics on a system of colored particles and as operations on the dominos themselves.
We give a bijective proof of the Aztec diamond theorem, stating that there are $2^{n(n+1)/2}$ domino tilings of the Aztec diamond of order $n$. The proof in fact establishes a similar result for non-intersecting families of $n+1$ Schröder paths, with horizontal, diagonal or vertical steps, linking the grid points of two adjacent sides of an $n\times n$ square grid; these families are well known to be in bijection with tilings of the Aztec diamond. Our bijection is produced by an invertible "combing" algorithm, operating on families of paths without non-intersection condition, but instead with …
Symmetric Domino Tilings of Aztec Diamonds
该研究提出归纳求和公式来计算阿兹特克钻石不同对称类型的多米诺骨牌铺砌数，同时得到无约束情形的公式，证明基于作者新提出的图完美匹配计数技术。
The Gamma-disordered Aztec diamond
本研究通过引入Gamma变量的多参数随机边权族，证明了Aztec菱形模型中随机单分子度量在自由能层面无相变，并展示了其与混合可积聚合物的分布相等性，揭示了转折点波动特性。
Off-diagonally symmetric domino tilings of the Aztec diamond
本文引入了一种新的多米诺铺砌对称类，通过非相交格点路径和Stembridge的非相交格点路径Pfaffian公式变种，计算了Aztec菱形的反对角对称多米诺铺砌数量。
Some 2-adic conjectures concerning polyomino tilings of Aztec diamonds
本文研究不同骨牌集合铺砌阶为$n$的阿兹特克钻石的方式数，并关注该计数函数在模2的幂下的特殊规律。
We present a proof of a conjecture about the relationship between Baxter permutations and pairs of alternating sign matrices that are produced from domino tilings of Aztec diamonds. It is shown that if and only if a tiling corresponds to a pair of ASMs that are both permutation matrices, the larger permutation matrix corresponds to a Baxter permutation. There has been a thriving literature on both pattern-avoiding permutations of various kinds and tilings of regions using dominos or rhombuses as tiles. However, there have not as of yet been many links between these two areas of enumerative com…
The inverse Kasteleyn matrix of a bipartite graph holds much information about the perfect matchings of the system such as local statistics which can be used to compute local and global asymptotics. In this paper, we consider three different weightings of domino tilings of the Aztec diamond and show using recurrence relations, we can compute the inverse Kasteleyn matrix. These weights are the one-periodic weighting where the horizontal edges have one weight and the vertical edges have another weight, the q^{vol} weighting which corresponds to multiplying the product of tile weights by q if we …
Off-diagonally symmetric domino tilings of the Aztec diamond of odd order
研究奇数阶Aztec钻石的对角对称多米诺铺砌计数，通过边界缺陷和对角线上最大零点两种方法，证明对称性并推导Pfaffian公式，利用非相交格路方法和Stembridge公式进行证明。
The 1/4-phenomenon of placement probabilities of tilings in the Aztec diamond
研究Aztec钻石中多米诺骨牌随机铺砌的放置概率，证明其恒为1/4加上一个有理函数乘以仅与钻石大小相关的因子，得到更紧凑的显式计数公式，并应用于带任意位置2×2方孔的Aztec钻石铺砌计数。
We prove an asymptotic formula for the probability that, if one chooses a domino tiling of a large Aztec diamond at random according to the uniform distribution on such tilings, the tiling will contain a domino covering a given pair of adjacent lattice squares. This formula quantifies the effect of the diamond's boundary conditions on the behavior of typical tilings; in addition, it yields a new proof of the arctic circle theorem of Jockusch, Propp, and Shor. Our approach is to use the saddle point method to estimate certain weighted sums of squares of Krawtchouk polynomials (whose relevance t…
Fock's dimer model on the Aztec diamond
本文研究了Aztec钻石上具有Fock权重的二聚体模型，证明了逆Kasteleyn矩阵和配分函数的显式公式，并借此恢复和扩展了极限形状结果及谱曲线对应关系。
Domino Tilings of the Aztec Diamond in Random Environment and Schur Generating Functions
本文研究随机环境下Aztec钻石多米诺平铺的渐近行为，采用Schur生成函数方法分析两种权重分布情形下的高度函数涨落，并扩展了粒子系统的大数定律与中心极限定理。
Boundary dents, the arctic circle and the arctic ellipse
本文研究带边界单位方格缺陷的阿兹特克钻石多米诺铺法计数，证明缺陷固定时铺法比值趋于Delannoy数，并利用缺陷位置趋近边界时的渐近行为推导出北极曲线为内切圆。
The exact enumeration of pure dimer coverings on the square lattice was obtained by Kasteleyn, Temperley and Fisher in 1961. In this paper, we consider the monomer-dimer covering problem (allowing multiple monomers) which is an outstanding unsolved problem in lattice statistics. We have developed the state matrix recursion method that allows us to compute the number of monomer--dimer coverings and to know the partition function with monomer and dimer activities. This method proceeds with a recurrence relation of so-called state matrices of large size. The enumeration problem of pure dimer cove…
We introduce a family of domino tilings that includes tilings of the Aztec diamond and pyramid partitions as special cases. These tilings live in a strip of $\mathbb{Z}^2$ of the form $1 \leq x-y \leq 2\ell$ for some integer $\ell \geq 1$, and are parametrized by a binary word $w\in\{+,-\}^{2\ell}$ that encodes some periodicity conditions at infinity. Aztec diamond and pyramid partitions correspond respectively to $w=(+-)^\ell$ and to the limit case $w=+^\infty-^\infty$. For each word $w$ and for different types of boundary conditions, we obtain a nice product formula for the generating functi…
Colored vertex models and $k$-tilings of the Aztec diamond
本文利用彩色顶点模型计算 Aztec 钻石 $k$-铺砌的生成多项式，证明无相互作用铺砌与普通铺砌的双射，并求得相关北极曲线。
In earlier work, Jockusch, Propp, and Shor proved a theorem describing the limiting shape of the boundary between the uniformly tiled corners of a random tiling of an Aztec diamond and the more unpredictable `temperate zone' in the interior of the region. The so-called arctic circle theorem made precise a phenomenon observed in random tilings of large Aztec diamonds. Here we examine a related combinatorial model called groves. Created by Carroll and Speyer as combinatorial interpretations for Laurent polynomials given by the cube recurrence, groves have observable frozen regions which we descr…
We show how to count tilings of Aztec diamonds and hexagons with defects using determinants. In several cases these determinants can be evaluated in closed form. In particular, we obtain solutions to problems 1, 2, and 10 in James Propp's list of problems on enumeration of matchings.
In this paper, we continue the study of domino-tilings of Aztec diamonds. In particular, we look at certain ways of placing ``barriers'' in the Aztec diamond, with the constraint that no domino may cross a barrier. Remarkably, the number of constrained tilings is independent of the placement of the barriers. We do not know of a combinatorial explanation of this fact; our proof uses the Jacobi-Trudi identity.
On $λ$-determinants and tiling problems
本研究综述八面体递推、$\lambda$-行列式与铺砌问题的关联，给出任意矩阵$\lambda$-行列式的多米诺骨牌铺砌组合解释，并将Robbins-Rumsey公式重新解释为带一般测度的阿兹特克钻石铺砌的配分函数。
We use the subgraph replacement method to investigate new properties of the tilings of regions on the square lattice with diagonals drawn in. In particular, we show that the centrally symmetric tilings of a generalization of the Aztec diamond are always enumerated by a simple product formula. This result generalizes the previous work of Ciucu (1997) and Yang (1992) about symmetric tilings of the Aztec diamond. We also use our method to prove a closed-form product formula for the number of centrally symmetric tilings of a quasi-hexagon.
The arctic circle theorem of Jockusch, Propp, and Shor asserts that uniformly random domino tilings of an Aztec diamond of high order are frozen with asymptotically high probability outside the "arctic circle" inscribed within the diamond. A similar arctic circle phenomenon has been observed in the limiting behavior of random square Young tableaux. In this paper, we show that random domino tilings of the Aztec diamond are asymptotically related to random square Young tableaux in a more refined sense that looks also at the behavior inside the arctic circle. This is done by giving a new derivati…
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 diamond of order $n$ but also provides information about the orientation of the dominoes (vertical versus horizontal) and the accessibility of one tiling from another by means of local modifications. Several proofs of the formula are given. The problem turns out to have connections with the alternating sign matrices of Mills, Robbins, and Rumsey, as well as the s…
We consider the domino tilings of an Aztec diamond with a cut-off corner of macroscopic square shape and given size, and address the bulk properties of tilings as the size is varied. We observe that the free energy exhibits a third-order phase transition when the cut-off square, increasing in size, reaches the arctic ellipse---the phase separation curve of the original (unmodified) Aztec diamond. We obtain this result by studying the thermodynamic limit of certain nonlocal correlation function of the underlying six-vertex model with domain wall boundary conditions, the so-called emptiness form…
The multinomial dimer model
本文研究了双分子模型在任意维度下的大N极限，推导了极限形状的变分原理，并展示了在三维及以上维度中显式计算极限形状的首次尝试。
Motivated in part by Propp's intruded Aztec diamond regions, we consider hexagonal regions out of which two horizontal chains of triangular holes (called ferns) are removed, so that the chains are at the same height, and are attached to the boundary. By contrast with the intruded Aztec diamonds (whose number of domino tilings contain some large prime factors in their factorization), the number of lozenge tilings of our doubly-intruded hexagons turns out to be given by simple product formulas in which all factors are linear in the parameters. We present in fact $q$-versions of these formulas, w…
Random Domino Tilings and the Arctic Circle Theorem
研究多米诺铺砌的阿兹特丁字形区域，证明当n足够大时，中心区域形状接近半径为n/√2的完美圆，采用粒子系统理论方法。
Inspired by Propp's intruded Aztec diamond regions, we consider halved hexagons in which two aligned arrays of triangular holes have been removed from their boundaries. Unlike the intruded Aztec diamonds (whose numbers of domino tilings contain some large prime factors in their factorizations), the numbers of lozenge tilings of our doubly-intruded halved hexagons are given by simple product formulas in which all factors are linear in the parameters. In this paper, we present an extensive list of exact tiling enumerations of sixteen different types of doubly-intruded halved hexagons. We also pr…
We compute 2-enumerations of certain halved alternating sign matrices. In one case the enumeration equals the number of perfect matchings of a halved Aztec diamond. In the other case the enumeration equals the number of perfect matchings of a halved fortress graph. Our results prove three conjectures by Jim Propp.
We study random lozenge tilings of a certain shape in the plane called the Novak half-hexagon, and compute the correlation functions for this process. This model was introduced by Nordenstam and Young (2011) and has many intriguing similarities with a more well-studied model, domino tilings of the Aztec diamond. The most difficult step in the present paper is to compute the inverse of the matrix whose (i,j) entry is the binomial coefficient C(A, B_j - i) for indeterminate variables A and B_1, ..., B_n.
In this paper, we compute asymptotics for the determinant of the combinatorial Laplacian on a sequence of $d$-dimensional orthotope square lattices as the number of vertices in each dimension grows at the same rate. It is related to the number of spanning trees by the well-known matrix tree theorem. Asymptotics for $2$ and $3$ component rooted spanning forests in these graphs are also derived. Moreover, we express the number of spanning trees in a $2$-dimensional square lattice in terms of the one in a $2$-dimensional discrete torus and also in the quartered Aztec diamond. As a consequence, we…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。