相关论文: Edge Effects on Local Statistics in Lattice Dimers…
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…
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…
The distribution of monomers along a linear polymer grafted on a hard wall is modelled by determining the probability distribution of occupied vertices of Dyck and ballot path models of adsorbing linear polymers. For example, the…
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.…
Numerical approaches to Anderson localization face the problem of having to treat large localization lengths while being restricted to finite system sizes. We show that by finite-size scaling of the probability distribution of the local…
We consider uniform random domino tilings of the restricted Aztec diamond which is obtained by cutting off an upper triangular part of the Aztec diamond by a horizontal line. The restriction line asymptotically touches the arctic circle…
In this paper, new probability bounds are derived for algebraic lattice codes. This is done by using the Dedekind zeta functions of the algebraic number fields involved in the lattice constructions. In particular, it is shown how to upper…
Tight-binding 1D random system with long-range correlations is studied numerically using the localisation criterium, which represents the number of sites, covered by the wave function. At low degrees of disorder the signs of a mobility…
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\"oder…
We study $k$-tilings ($k$-tuples of domino tilings) of the Aztec diamond of rank $m$. We assign a weight to each $k$-tiling, depending on the number of dominos of certain types and the number of "interactions" between the tilings. Employing…
We study the edge states in graphene in the presence of a magnetic field perpendicular to the plane of the lattice. Most of the works done so far discuss the edge states in either zigzag or armchair edge graphene considering an isotropic…
A modular or distributive lattice is `diamond-colored' if its order diagram edges are colored in such a way that, within any diamond of edges, parallel edges have the same color. Such lattices arise naturally in combinatorial representation…
We investigate symmetric edge polytopes generated by Erd\H{o}s--R\'enyi random graphs in a high-dimensional regime. These objects provide a natural and largely unexplored model of random lattice polytopes, in which geometric properties are…
Estimating the number of vertices of a two dimensional projection, called a shadow, of a polytope is a fundamental tool for understanding the performance of the shadow simplex method for linear programming among other applications. We prove…
From the striped coats of zebras to the ripples in windblown sand, the natural world abounds with locally banded patterns. Such patterns have been of great interest throughout history, and, in the last twenty years, scientists in a wide…
A $d$-dimensional binary Markov random field on a lattice torus is considered. As the size $n$ of the lattice tends to infinity, potentials $a=a(n)$ and $b=b(n)$ depend on $n$. Precise bounds for the probability for local configurations to…
We study random domino tilings of the Aztec diamond with different weights for horizontal and vertical dominoes. A domino tiling of an Aztec diamond can also be described by a particle system which is a determinantal process. We give a…
The problem of counting tilings of a plane region using specified tiles can often be recast as the problem of counting (perfect) matchings of some subgraph of an Aztec diamond graph A_n, or more generally calculating the sum of the weights…
The paper concerns lattice triangulations, that is, triangulations of the integer points in a polygon in $\mathbb{R}^2$ whose vertices are also integer points. Lattice triangulations have been studied extensively both as geometric objects…
We use computational method to investigate the number of ways to pack dimers on \emph{odd-by-odd} lattices. In this case, there is always a single vacancy in the lattices. We show that the dimer configuration numbers on $(2k+1) \times…