350 research outputs found
The construction of cubic and quartic planar maps with prescribed face degrees
AbstractIn this paper, the existence and availability of computer programs to constructively enumerate all simple connected cubic or quartic planar maps with prescribed number of vertices and face degrees is announced and results of the programs are presented. The underlying algorithms of the computer programs are described
The generating function of planar Eulerian orientations
37 pp.International audienceThe enumeration of planar maps equipped with an Eulerian orientation has attracted attention in both combinatorics and theoretical physics since at least 2000. The case of 4-valent maps is particularly interesting: these orientations are in bijection with properly 3-coloured quadrangulations, while in physics they correspond to configurations of the ice model.We solve both problems -- namely the enumeration of planarEulerian orientations and of 4-valent planar Eulerian orientations --by expressing the associated generating functions as the inverses (for the composition of series) of simple hypergeometric series. Using these expressions, we derive the asymptotic behaviour of the number of planar Eulerian orientations, thus proving earlier predictions of Kostov, Zinn-Justin, Elvey Price and Guttmann. This behaviour, , prevents the associated generating functions from being D-finite. Still, these generating functions are differentially algebraic, as they satisfy non-linear differential equations of order 2. Differential algebraicity has recently been proved for other map problems, in particular for maps equipped with a Potts model.Our solutions mix recursive and bijective ingredients. In particular, a preliminary bijection transforms our oriented maps into maps carrying a height function on their vertices.In the 4-valent case, we also observe an unexpected connection with theenumeration of maps equipped with a spanning tree that is internallyinactive in the sense of Tutte. This connection remains to beexplained combinatorially
Census of Planar Maps: From the One-Matrix Model Solution to a Combinatorial Proof
We consider the problem of enumeration of planar maps and revisit its
one-matrix model solution in the light of recent combinatorial techniques
involving conjugated trees. We adapt and generalize these techniques so as to
give an alternative and purely combinatorial solution to the problem of
counting arbitrary planar maps with prescribed vertex degrees.Comment: 29 pages, 14 figures, tex, harvmac, eps
Multisided generalisations of Gregory patches
We propose two generalisations of Gregory patches to faces of any valency by using generalised barycentric coordinates in combination with two kinds of multisided Bézier patches. Our first construction builds on S-patches to generalise triangular Gregory patches. The local construction of Chiyokura and Kimura providing G1 continuity between adjoining Bézier patches is generalised so that the novel Gregory S-patches of any valency can be smoothly joined to one another. Our second construction makes a minor adjustment to the generalised Bézier patch structure to allow for cross-boundary derivatives to be defined independently per side. We show that the corresponding blending functions have the inherent ability to blend ribbon data much like the rational blending functions of Gregory patches. Both constructions take as input a polygonal mesh with vertex normals and provide G1 surfaces interpolating the input vertices and normals. Due to the full locality of the methods, they are well suited for geometric modelling as well as computer graphics applications relying on hardware tessellation
Flexible G1 Interpolation of Quad Meshes
International audienceTransforming an arbitrary mesh into a smooth G1 surface has been the subject of intensive research works. To get a visual pleasing shape without any imperfection even in the presence of extraordinary mesh vertices is still a challenging problem in particular when interpolation of the mesh vertices is required. We present a new local method, which produces visually smooth shapes while solving the interpolation problem. It consists of combining low degree biquartic Bézier patches with minimum number of pieces per mesh face, assembled together with G1-continuity. All surface control points are given explicitly. The construction is local and free of zero-twists. We further show that within this economical class of surfaces it is however possible to derive a sufficient number of meaningful degrees of freedom so that standard optimization techniques result in high quality surfaces
Multi-loop open string amplitudes and their field theory limit
JHEP is an open-access journal funded by SCOAP3 and licensed under CC BY 4.0This work
was supported by STFC (Grant ST/J000469/1, ‘String theory, gauge theory & duality’)
and by MIUR (Italy) under contracts 2006020509 004 and 2010YJ2NYW 00
Counting coloured planar maps: differential equations
We address the enumeration of q-coloured planar maps counted bythe number of
edges and the number of monochromatic edges. We prove that the associated
generating function is differentially algebraic,that is, satisfies a
non-trivial polynomial differential equation withrespect to the edge variable.
We give explicitly a differential systemthat characterizes this series. We then
prove a similar result for planar triangulations, thus generalizing a result of
Tutte dealing with their proper q-colourings. Instatistical physics terms, we
solvethe q-state Potts model on random planar lattices. This work follows a
first paper by the same authors, where the generating functionwas proved to be
algebraic for certain values of q,including q=1, 2 and 3. It isknown to be
transcendental in general. In contrast, our differential system holds for an
indeterminate q.For certain special cases of combinatorial interest (four
colours; properq-colourings; maps equipped with a spanning forest), we derive
from this system, in the case of triangulations, an explicit differential
equation of order 2 defining the generating function. For general planar maps,
we also obtain a differential equation of order 3 for the four-colour case and
for the self-dual Potts model.Comment: 43 p
- …