Related papers: Permutations with fixed pattern densities

We perform Transition matrix Monte Carlo simulations to evaluate the entropy of rhombus tilings with fixed polygonal boundaries and 2D-fold rotational symmetry. We estimate the large-size limit of this entropy for D=4 to 10. We confirm…

We study proportions of consecutive occurrences of permutations of a given size. Specifically, the feasible limits of such proportions on large permutations form a region, called feasible region. We show that this feasible region is a…

We consider the hydrodynamic behavior of some conservative particle systems with degenerate jump rates without exclusive constraints. More precisely, we study the particle systems without restrictions on the total number of particles per…

We study a model of spatial random permutations over a discrete set of points. Formally, a permutation $\sigma$ is sampled proportionally to the weight $\exp\{-\alpha \sum_x V(\sigma(x)-x)\},$ where $\alpha>0$ is the temperature and $V$ is…

We prove that it is decidable if a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple permutations: every sufficiently long simple permutation contains…

We investigate dynamical properties of the set of permutations of $\mathbb{Z}^d$ with restricted movement, i.e., permutations $\pi $ of $\mathbb{Z}^d$ such that $\pi (\mathbf{n})-\mathbf{n}$ lies, for every $\mathbf{n}\in \mathbb{Z}^d$, in…

A family of m independent identically distributed random variables indexed by a chemical potential \phi\in[0,\gamma] represents piles of particles. As \phi increases to \gamma, the mean number of particles per site converges to a maximal…

We find sufficient conditions for bounded density shifts to have a unique measure of maximal entropy. We also prove that every measure of maximal entropy of a bounded density shift is fully supported. As a consequence of this, we obtain…

The massive Schwinger model is studied, using a density matrix renormalisation group approach to the staggered lattice Hamiltonian version of the model. Lattice sizes up to 256 sites are calculated, and the estimates in the continuum limit…

We study the local limit of the fixed-point forest, a tree structure associated to a simple sorting algorithm on permutations. This local limit can be viewed as an infinite random tree that can be constructed from a Poisson point process…

We study scaling limits of a family of planar random growth processes in which clusters grow by the successive aggregation of small particles. In these models, clusters are encoded as a composition of conformal maps and the location of each…

We prove upper bounds on the rate, called "mixing rate", at which the von Neumann entropy of the expected density operator of a given ensemble of states changes under non-local unitary evolution. For an ensemble consisting of two states,…

This paper derives new bounds on the difference of the entropies of two discrete random variables in terms of the local and total variation distances between their probability mass functions. The derivation of the bounds relies on maximal…

We discuss some aspects of the continuum limit of some lattice models, in particular the $2D$ $O(N)$ models. The continuum limit is taken either in an infinite volume or in a box whose size is a fixed fraction of the infinite volume…

We establish a novel bijective encoding that represents permutations as forests of decorated (or enriched) trees. This allows us to prove local convergence of uniform random permutations from substitution-closed classes satisfying a…

We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…

We study occurrences of patterns on clusters of size n in random fields on Z^d. We prove that for a given pattern, there is a constant a>0 such that the probability that this pattern occurs at most an times on a cluster of size n is…

We derive theorems which outline explicit mechanisms by which anomalous scaling for the probability density function of the sum of many correlated random variables asymptotically prevails. The results characterize general anomalous scaling…

We define the limiting density of a minor-closed family of simple graphs F to be the smallest number k such that every n-vertex graph in F has at most kn(1+o(1)) edges, and we investigate the set of numbers that can be limiting densities.…

We consider a family of growth models defined using conformal maps in which the local growth rate is determined by $|\Phi_n'|^{-\eta}$, where $\Phi_n$ is the aggregate map for $n$ particles. We establish a scaling limit result in which…