Abstract. We introduce a general model of dimer coverings of certain plane bipartite graphs, which we call rail yard graphs (RYG). The transfer matrices used to compute the partition function are shown to be isomorphic to certain operators arising in the so-called boson-fermion correspondence. This allows to reformulate the RYG dimer model as a Schur process, i.e. as a random sequence of integer partitions subject to some interlacing conditions.Beyond the computation of the partition function, we provide an explicit expression for all correlation functions or, equivalently, for the inverse Kasteleyn matrix of the RYG dimer model. This expression, which is amenable to asymptotic analysis, follows from an exact combinatorial description of the operators localizing dimers in the transfer-matrix formalism, and then a suitable application of Wick's theorem.Plane partitions, domino tilings of the Aztec diamond, pyramid partitions, and steep tilings arise as particular cases of the RYG dimer model. For the Aztec diamond, we provide new derivations of the edge-probability generating function, of the biased creation rate, of the inverse Kasteleyn matrix and of the arctic circle theorem.

We establish a correspondence between the dimer model on a bipartite graph and a circle pattern with the combinatorics of that graph, which holds for graphs that are either planar or embedded on the torus. The set of positive face weights on the graph gives a set of global coordinates on the space of circle patterns with embedded dual. Under this correspondence, which extends the previously known isoradial case, the urban renewal (local move for dimer models) is equivalent to the Miquel move (local move for circle patterns). As a consequence the Miquel dynamics on circle patterns is governed by the octahedron recurrence. As special cases of these circle pattern embeddings, we recover harmonic embeddings for resistor networks and s-embeddings for the Ising model.

We enumerate total cyclic orders on {1, . . . , n} where we prescribe the relative cyclic order of consecutive triples (i, i + 1, i + 2), these integers being taken modulo n. In some cases, the problem reduces to the enumeration of descent classes of permutations, which is done via the boustrophedon construction. In other cases, we solve the question by introducing multidimensional versions of the boustrophedon. In particular we find new interpretations for the Euler up/down numbers and the Entringer numbers. arXiv:1706.03386v2 [math.CO]

In this article, we prove that for any probability distribution µ on N one can construct a two-sided stationary version of the infinite-bin model -an interacting particle system introduced by Foss and Konstantopouloswith move distribution µ. Using this result, we obtain a new formula for the speed of the front of infinite-bin models, as a series of positive terms. This implies that the growth rate C(p) of the longest path in a Barak-Erdős graph of parameter p is analytic on (0, 1].

We provide a new description of the scaling limit of dimer fluctuations in homogeneous Aztec diamonds via the intrinsic conformal structure of a Lorentz-minimal surface in R 2+1 . This surface naturally appears as the limit of the graphs of origami maps associated to symmetric t-embeddings (Coulomb gauges) of Aztec diamonds, fitting the framework of [6,7].