Critical and Multicritical Semi-Random (1+d)-Dimensional Lattices and Hard Objects in d Dimensions

We investigate models of (1+d)-D Lorentzian semi-random lattices with one random (space-like) direction and d regular (time-like) ones. We prove a general inversion formula expressing the partition function of these models as the inverse of that of hard objects in d dimensions. This allows for an exact solution of a variety of new models including critical and multicritical generalized (1+1)-D Lorentzian surfaces, with fractal dimensions $d_F=k+1$, k=1,2,3,..., as well as a new model of (1+2)-D critical tetrahedral complexes, with fractal dimension $d_F=12/5$. Critical exponents and universal scaling functions follow from this solution. We finally establish a general connection between (1+d)-D Lorentzian lattices and directed-site lattice animals in (1+d) dimensions.Comment: 44 pages, 15 figures, tex, harvmac, epsf, references adde

Statistics of reduced words in locally free and braid groups: Abstract studies and application to ballistic growth model

We study numerically and analytically the average length of reduced (primitive) words in so-called locally free and braid groups. We consider the situations when the letters in the initial words are drawn either without or with correlations. In the latter case we show that the average length of the reduced word can be increased or lowered depending on the type of correlation. The ideas developed are used for analytical computation of the average number of peaks of the surface appearing in some specific ballistic growth modelComment: 29 pages, LaTeX, 7 separated Postscript figures (available on request), submitted to J. Phys. (A): Math. Ge

Integrability of graph combinatorics via random walks and heaps of dimers

We investigate the integrability of the discrete non-linear equation governing the dependence on geodesic distance of planar graphs with inner vertices of even valences. This equation follows from a bijection between graphs and blossom trees and is expressed in terms of generating functions for random walks. We construct explicitly an infinite set of conserved quantities for this equation, also involving suitable combinations of random walk generating functions. The proof of their conservation, i.e. their eventual independence on the geodesic distance, relies on the connection between random walks and heaps of dimers. The values of the conserved quantities are identified with generating functions for graphs with fixed numbers of external legs. Alternative equivalent choices for the set of conserved quantities are also discussed and some applications are presented.Comment: 38 pages, 15 figures, uses epsf, lanlmac and hyperbasic

Growth models, random matrices and Painleve transcendents

The Hammersley process relates to the statistical properties of the maximum length of all up/right paths connecting random points of a given density in the unit square from (0,0) to (1,1). This process can also be interpreted in terms of the height of the polynuclear growth model, or the length of the longest increasing subsequence in a random permutation. The cumulative distribution of the longest path length can be written in terms of an average over the unitary group. Versions of the Hammersley process in which the points are constrained to have certain symmetries of the square allow similar formulas. The derivation of these formulas is reviewed. Generalizing the original model to have point sources along two boundaries of the square, and appropriately scaling the parameters gives a model in the KPZ universality class. Following works of Baik and Rains, and Pr\"ahofer and Spohn, we review the calculation of the scaled cumulative distribution, in which a particular Painlev\'e II transcendent plays a prominent role.Comment: 27 pages, 5 figure

Chebyshev type lattice path weight polynomials by a constant term method

We prove a constant term theorem which is useful for finding weight polynomials for Ballot/Motzkin paths in a strip with a fixed number of arbitrary `decorated' weights as well as an arbitrary `background' weight. Our CT theorem, like Viennot's lattice path theorem from which it is derived primarily by a change of variable lemma, is expressed in terms of orthogonal polynomials which in our applications of interest often turn out to be non-classical. Hence we also present an efficient method for finding explicit closed form polynomial expressions for these non-classical orthogonal polynomials. Our method for finding the closed form polynomial expressions relies on simple combinatorial manipulations of Viennot's diagrammatic representation for orthogonal polynomials. In the course of the paper we also provide a new proof of Viennot's original orthogonal polynomial lattice path theorem. The new proof is of interest because it uses diagonalization of the transfer matrix, but gets around difficulties that have arisen in past attempts to use this approach. In particular we show how to sum over a set of implicitly defined zeros of a given orthogonal polynomial, either by using properties of residues or by using partial fractions. We conclude by applying the method to two lattice path problems important in the study of polymer physics as models of steric stabilization and sensitized flocculation.Comment: 27 pages, 14 figure

Solutions to the ultradiscrete Toda molecule equation expressed as minimum weight flows of planar graphs

We define a function by means of the minimum weight flow on a planar graph and prove that this function solves the ultradiscrete Toda molecule equation, its B\"acklund transformation and the two dimensional Toda molecule equation. The method we employ in the proof can be considered as fundamental to the integrability of ultradiscrete soliton equations.Comment: 14 pages, 10 figures Added citations in v

Entanglement in gapless resonating valence bond states

We study resonating-valence-bond (RVB) states on the square lattice of spins and of dimers, as well as SU(N)-invariant states that interpolate between the two. These states are ground states of gapless models, although the SU(2)-invariant spin RVB state is also believed to be a gapped liquid in its spinful sector. We show that the gapless behavior in spin and dimer RVB states is qualitatively similar by studying the R\'enyi entropy for splitting a torus into two cylinders, We compute this exactly for dimers, showing it behaves similarly to the familiar one-dimensional log term, although not identically. We extend the exact computation to an effective theory believed to interpolate among these states. By numerical calculations for the SU(2) RVB state and its SU(N)-invariant generalizations, we provide further support for this belief. We also show how the entanglement entropy behaves qualitatively differently for different values of the R\'enyi index $n$, with large values of $n$ proving a more sensitive probe here, by virtue of exhibiting a striking even/odd effect.Comment: 44 pages, 14 figures, published versio

Counting a black hole in Lorentzian product triangulations

We take a step toward a nonperturbative gravitational path integral for black-hole geometries by deriving an expression for the expansion rate of null geodesic congruences in the approach of causal dynamical triangulations. We propose to use the integrated expansion rate in building a quantum horizon finder in the sum over spacetime geometries. It takes the form of a counting formula for various types of discrete building blocks which differ in how they focus and defocus light rays. In the course of the derivation, we introduce the concept of a Lorentzian dynamical triangulation of product type, whose applicability goes beyond that of describing black-hole configurations.Comment: 42 pages, 11 figure

Series expansions of the percolation probability for directed square and honeycomb lattices

We have derived long series expansions of the percolation probability for site and bond percolation on directed square and honeycomb lattices. For the square bond problem we have extended the series from 41 terms to 54, for the square site problem from 16 terms to 37, and for the honeycomb bond problem from 13 terms to 36. Analysis of the series clearly shows that the critical exponent $\beta$ is the same for all the problems confirming expectations of universality. For the critical probability and exponent we find in the square bond case, $q_c = 0.3552994\pm 0.0000010$, $\beta = 0.27643\pm 0.00010$, in the square site case $q_c = 0.294515 \pm 0.000005$, $\beta = 0.2763 \pm 0.0003$, and in the honeycomb bond case $q_c = 0.177143 \pm 0.000002$, $\beta = 0.2763 \pm 0.0002$. In addition we have obtained accurate estimates for the critical amplitudes. In all cases we find that the leading correction to scaling term is analytic, i.e., the confluent exponent $\Delta = 1$.Comment: LaTex with epsf, 26 pages, 2 figures and 2 tables in Postscript format included (uufiled). LaTeX version of tables also included for the benefit of those without access to PS printers (note that the tables should be printed in landscape mode). Accepted by J. Phys.

Fluctuations of the one-dimensional asymmetric exclusion process using random matrix techniques

The studies of fluctuations of the one-dimensional Kardar-Parisi-Zhang universality class using the techniques from random matrix theory are reviewed from the point of view of the asymmetric simple exclusion process. We explain the basics of random matrix techniques, the connections to the polynuclear growth models and a method using the Green's function.Comment: 41 pages, 10 figures, minor corrections, references adde