arXiv subjects
Publications and source records attributed to Christoph Richard.
We derive area limit laws for the various symmetry classes of staircase polygons on the square lattice, in a uniform ensemble where, for fixed perimeter, each polygon occurs with the same probability. This complements a previous study by Leroux and Rassart, where explicit expressions for the area and perimeter generating functions of these classes have been derived.
We analyse q-functional equations arising from tree-like combinatorial structures, which are counted by size, internal path length, and certain generalisations thereof. The corresponding counting parameters are labelled by a positive integer k. We show the existence of a joint limit distribution for these parameters in the limit of infinite size, if the size generating function has a square root as dominant singularity. The limit distribution coincides with that of integrals of k-th powers of the standard Brownian excursion. Our approach yields a recursion for the moments of the limit distribution. It can be used to analyse asymptotic expansions of the moments, and it admits an extension to other types of singularity.
Delone sets of finite local complexity in Euclidean space are investigated. We show that such a set has patch counting and topological entropy 0 if it has uniform cluster frequencies and is pure point diffractive. We also note that the patch counting entropy is 0 whenever the repetitivity function satisfies a certain growth restriction.
We study randomly coloured graphs embedded into Euclidean space, whose vertex sets are infinite, uniformly discrete subsets of finite local complexity. We construct the appropriate ergodic dynamical systems, explicitly characterise ergodic measures, and prove an ergodic theorem. For covariant operators of finite range defined on those graphs, we show the existence and self-averaging of the integrated density of states, as well as the non-randomness of the spectrum. Our main result establishes Lifshits tails at the lower spectral edge of the graph Laplacian on bond percolation subgraphs, for sufficiently small probabilities. Among other assumptions, its proof requires exponential decay of the cluster-size distribution for percolation on rather general graphs.
We consider staircase polygons, counted by perimeter and sums of k-th powers of their diagonal lengths, k being a positive integer. We derive limit distributions for these parameters in the limit of large perimeter and compare the results to Monte-Carlo simulations of self-avoiding polygons. We also analyse staircase polygons, counted by width and sums of powers of their column heights, and we apply our methods to related models of directed walks.
We present cut and project formalism based on measures and continuous weight functions of sufficiently fast decay. The emerging measures are strongly almost periodic. The corresponding dynamical systems are compact groups and homomorphic images of the underlying torus. In particular, they are strictly ergodic with pure point spectrum and continuous eigenfunctions. Their diffraction can be calculated explicitly. Our results cover and extend corresponding earlier results on dense Dirac combs and continuous weight functions with compact support. They also mark a clear difference in terms of factor maps between the case of continuous and non-continuous weight functions.
Regular model sets, describing the point positions of ideal quasicrystallographic tilings, are mathematical models of quasicrystals. An important result in mathematical diffraction theory of regular model sets, which are defined on locally compact Abelian groups, is the pure pointedness of the diffraction spectrum. We derive an extension of this result, valid for dense point sets in Euclidean space, which is motivated by the study of quasicrystallographic random tilings.
We numerically investigate the area statistics of the outer boundary of planar random loops, on the square and triangular lattices. Our Monte Carlo simulations suggest that the underlying limit distribution is the Airy distribution, which was recently found to appear also as area distribution in the model of self-avoiding loops.
We enumerate all ternary length-l square-free words, which are words avoiding squares of words up to length l, for l<=24. We analyse the singular behaviour of the corresponding generating functions. This leads to new upper entropy bounds for ternary square-free words. We then consider ternary square-free words with fixed letter densities, thereby proving exponential growth for certain ensembles with various letter densities. We derive consequences for the free energy and entropy of ternary square-free words.
We construct integrable boundary conditions for sl(2) coset models with central charges c=3/2-12/(m(m+2)) and m=3,4,... The associated cylinder partition functions are generating functions for the branching functions but these boundary conditions manifestly break the superconformal symmetry. We show that there are additional integrable boundary conditions, satisfying the boundary Yang-Baxter equation, which respect the superconformal symmetry and lead to generating functions for the superconformal characters in both Ramond and Neveu-Schwarz sectors. We also present general formulas for the cylinder partition functions. This involves an alternative derivation of the superconformal Verlinde formula recently proposed by Nepomechie.
Exactly solvable two-dimensional polygon models, counted by perimeter and area, are described by $q$-algebraic functional equations. We provide techniques to extract the scaling behaviour of these models up to arbitrary order and apply them to some examples. These are then used to analyze the unsolved model of self-avoiding polygons, where we numerically confirm predictions about its scaling function and its first two corrections to scaling.
We apply a framework for the description of random tilings without height representation, which was proposed recently, to the special case of quasicrystalline random tilings. Several important examples are discussed, thereby demonstrating the consistency of this alternative description with the conventional one. We also clarify the latter by deriving a group theoretic criterion for the validity of the first random tiling hypothesis.
We introduce a concept for random tilings which, comprising the conventional one, is also applicable to tiling ensembles without height representation. In particular, we focus on the random tiling entropy as a function of the tile densities. In this context, and under rather mild assumptions, we prove a generalization of the first random tiling hypothesis which connects the maximum of the entropy with the symmetry of the ensemble. Explicit examples are obtained through the re-interpretation of several exactly solvable models. This also leads to a counterexample to the analogue of the second random tiling hypothesis about the form of the entropy function near its maximum.