549 research outputs found
Asymptotic enumeration of non-crossing partitions on surfaces
We generalize the notion of non-crossing partition on a disk to general surfaces
with boundary. For this, we consider a surface S and introduce the number CS(n) of noncrossing partitions of a set of n points laying on the boundary of SPostprint (author's final draft
Dynamic programming for graphs on surfaces
We provide a framework for the design and analysis of dynamic
programming algorithms for surface-embedded graphs on n vertices
and branchwidth at most k. Our technique applies to general families
of problems where standard dynamic programming runs in 2O(k·log k).
Our approach combines tools from topological graph theory and
analytic combinatorics.Postprint (updated version
A unified fluctuation formula for one-cut -ensembles of random matrices
Using a Coulomb gas approach, we compute the generating function of the
covariances of power traces for one-cut -ensembles of random matrices in
the limit of large matrix size. This formula depends only on the support of the
spectral density, and is therefore universal for a large class of models. This
allows us to derive a closed-form expression for the limiting covariances of an
arbitrary one-cut -ensemble. As particular cases of the main result we
consider the classical -Gaussian, -Wishart and -Jacobi
ensembles, for which we derive previously available results as well as new ones
within a unified simple framework. We also discuss the connections between the
problem of trace fluctuations for the Gaussian Unitary Ensemble and the
enumeration of planar maps.Comment: 16 pages, 4 figures, 3 tables. Revised version where references have
been added and typos correcte
Dynamic Programming for Graphs on Surfaces
We provide a framework for the design and analysis of dynamic programming
algorithms for surface-embedded graphs on n vertices and branchwidth at most k.
Our technique applies to general families of problems where standard dynamic
programming runs in 2^{O(k log k)} n steps. Our approach combines tools from
topological graph theory and analytic combinatorics. In particular, we
introduce a new type of branch decomposition called "surface cut
decomposition", generalizing sphere cut decompositions of planar graphs
introduced by Seymour and Thomas, which has nice combinatorial properties.
Namely, the number of partial solutions that can be arranged on a surface cut
decomposition can be upper-bounded by the number of non-crossing partitions on
surfaces with boundary. It follows that partial solutions can be represented by
a single-exponential (in the branchwidth k) number of configurations. This
proves that, when applied on surface cut decompositions, dynamic programming
runs in 2^{O(k)} n steps. That way, we considerably extend the class of
problems that can be solved in running times with a single-exponential
dependence on branchwidth and unify/improve most previous results in this
direction.Comment: 28 pages, 3 figure
The geometry of dynamical triangulations
We discuss the geometry of dynamical triangulations associated with
3-dimensional and 4-dimensional simplicial quantum gravity. We provide
analytical expressions for the canonical partition function in both cases, and
study its large volume behavior. In the space of the coupling constants of the
theory, we characterize the infinite volume line and the associated critical
points. The results of this analysis are found to be in excellent agreement
with the MonteCarlo simulations of simplicial quantum gravity. In particular,
we provide an analytical proof that simply-connected dynamically triangulated
4-manifolds undergo a higher order phase transition at a value of the inverse
gravitational coupling given by 1.387, and that the nature of this transition
can be concealed by a bystable behavior. A similar analysis in the
3-dimensional case characterizes a value of the critical coupling (3.845) at
which hysteresis effects are present.Comment: 166 pages, Revtex (latex) fil
Instantons, Topological Strings and Enumerative Geometry
We review and elaborate on certain aspects of the connections between
instanton counting in maximally supersymmetric gauge theories and the
computation of enumerative invariants of smooth varieties. We study in detail
three instances of gauge theories in six, four and two dimensions which
naturally arise in the context of topological string theory on certain
non-compact threefolds. We describe how the instanton counting in these gauge
theories are related to the computation of the entropy of supersymmetric black
holes, and how these results are related to wall-crossing properties of
enumerative invariants such as Donaldson-Thomas and Gromov-Witten invariants.
Some features of moduli spaces of torsion-free sheaves and the computation of
their Euler characteristics are also elucidated.Comment: 61 pages; v2: Typos corrected, reference added; v3: References added
and updated; Invited article for the special issue "Nonlinear and
Noncommutative Mathematics: New Developments and Applications in Quantum
Physics" of Advances in Mathematical Physic
- …