Deposits of clastic carbonate-dominated (calciclastic) sedimentary slope systems in the rock record have been identified mostly as linearly-consistent carbonate apron deposits, even though most ancient clastic carbonate slope deposits fit the submarine fan systems better. Calciclastic submarine fans are consequently rarely described and are poorly understood. Subsequently, very little is known especially in mud-dominated calciclastic submarine fan systems. Presented in this study are a sedimentological core and petrographic characterisation of samples from eleven boreholes from the Lower Carboniferous of Bowland Basin (Northwest England) that reveals a >250 m thick calciturbidite complex deposited in a calciclastic submarine fan setting. Seven facies are recognised from core and thin section characterisation and are grouped into three carbonate turbidite sequences. They include: 1) Calciturbidites, comprising mostly of highto low-density, wavy-laminated bioclast-rich facies; 2) low-density densite mudstones which are characterised by planar laminated and unlaminated muddominated facies; and 3) Calcidebrites which are muddy or hyper-concentrated debrisflow deposits occurring as poorly-sorted, chaotic, mud-supported floatstones. These

Phd by thesis

Analytic Combinatorics is a self-contained treatment of the mathematics underlying the analysis of discrete structures, which has emerged over the past several decades as an essential tool in the understanding of properties of computer programs and scientific models with applications in physics, biology and chemistry. Thorough treatment of a large number of classical applications is an essential aspect of the presentation. Written by the leaders in the field of analytic combinatorics, this text is certain to become the definitive reference on the topic. The text is complemented with exercises, examples, appendices and notes to aid understanding therefore, it can be used as the basis for an advanced undergraduate or a graduate course on the subject, or for self-study.

Analytic Combinatorics

R J Baxter 1982 London: Academic xii + 486 pp price £43.60 Over the past few years there has been a growing belief that all the twodimensional lattice statistical models will eventually be solved and that it will be Professor Baxter who solves them. Baxter has inherited the mantle of Onsager who started the process by solving exactly the two-dimensional Ising model in 1944.

Exactly Solved Models in Statistical Mechanics

We study a certain random groeth model in two dimensions closely related to the one-dimensional totally asymmetric exclusion process. The results show that the shape fluctuations, appropriately scaled, converges in distribution to the Tracy-Widom largest eigenvalue distribution for the Gaussian Unitary Ensemble.

Shape Fluctuations and Random Matrices

Consider a bounded planar domain D, an instance h of the Gaussian free field on D, with Dirichlet energy (2π)−1∫
 D
 ∇h(z)⋅∇h(z)dz, and a constant 0≤γ<2. The Liouville quantum gravity measure on D is the weak limit as e→0 of the measures $$\varepsilon^{\gamma^2/2} e^{\gamma h_\varepsilon(z)}dz,$$
 where dz is Lebesgue measure on D and h
 e
 (z) denotes the mean value of h on the circle of radius e centered at z. Given a random (or deterministic) subset X of D one can define the scaling dimension of X using either Lebesgue measure or this random measure. We derive a general quadratic relation between these two dimensions, which we view as a probabilistic formulation of the Knizhnik, Polyakov, Zamolodchikov (Mod. Phys. Lett. A, 3:819–826, 1988) relation from conformal field theory. We also present a boundary analog of KPZ (for subsets of ∂D). We discuss the connection between discrete and continuum quantum gravity and provide a framework for understanding Euclidean scaling exponents via quantum gravity.

Liouville quantum gravity and KPZ

We extend Schaeffer's bijection between rooted quadrangulations and well-labeled trees to the general case of Eulerian planar maps with prescribed face valences to obtain a bijection with a new class of labeled trees, which we call mobiles. Our bijection covers all the classes of maps previously enumerated by either the two-matrix model used by physicists or by the bijection with blossom trees used by combinatorists. Our bijection reduces the enumeration of maps to that, much simpler, of mobiles and moreover keeps track of the geodesic distance within the initial maps via the mobiles' labels. Generating functions for mobiles are shown to obey systems of algebraic recursion relations.

/pdf/planar-maps-as-labeled-mobiles-4huj2n7gur.pdf

Planar Maps as Labeled Mobiles

Geodesic distance in planar graphs

Census of planar maps: From the one-matrix model solution to a combinatorial proof

We consider quadrangulations with a boundary and derive explicit expressions for the generating functions of these maps with either a marked vertex at a prescribed distance from the boundary, or two boundary vertices at a prescribed mutual distance in the map. For large maps, this yields explicit formulae for the bulk–boundary and boundary–boundary correlators in the various encountered scaling regimes: a small boundary, a dense boundary and a critical boundary regime. The critical boundary regime is characterized by a one-parameter family of scaling functions interpolating between the Brownian map and the Brownian continuum random tree. We discuss the cases of both generic and self-avoiding boundaries, which are shown to share the same universal scaling limit. We finally address the question of the bulk–loop distance statistics in the context of planar quadrangulations equipped with a self-avoiding loop. Here again, a new family of scaling functions describing critical loops is discovered.

Distance statistics in quadrangulations with a boundary, or with a self-avoiding loop

We present an unexpected connection between two map enumeration problems. The first one consists in counting planar maps with a boundary of prescribed length. The second one consists in counting planar maps with two points at a prescribed distance. We show that, in the general class of maps with controlled face degrees, the solution for both problems is actually encoded into the same quantity, respectively via its power series expansion and its continued fraction expansion. We then use known techniques for tackling the first problem in order to solve the second. This novel viewpoint provides a constructive approach for computing the so-called distance-dependent two-point function of general planar maps. We prove and extend some previously predicted exact formulas, which we identify in terms of particular Schur functions.

http://ipht.cea.fr/Pisp/jeremie.bouttier/files/2010-12-16-eindhoven.pdf

Jérémie Bouttier

Papers

Planar Maps as Labeled Mobiles

Geodesic distance in planar graphs

Census of planar maps: From the one-matrix model solution to a combinatorial proof

Distance statistics in quadrangulations with a boundary, or with a self-avoiding loop

Planar Maps and Continued Fractions