a bijection between fractional trees and d angulations
play

A bijection between fractional trees and d -angulations Marie - PowerPoint PPT Presentation

Oct 28, 2023 •124 likes •658 views

A bijection between fractional trees and d -angulations Marie Albenque and Dominique Poulalhon LIX CNRS Young workshop in arithmetics and combinatorics June, 22th 2011 Albenque & Poulalhon (LIX CNRS) Bijection for d -angulations

  1. A bijection between fractional trees and d -angulations Marie Albenque and Dominique Poulalhon LIX – CNRS Young workshop in arithmetics and combinatorics – June, 22th 2011 Albenque & Poulalhon (LIX – CNRS) Bijection for d -angulations Madrid, June 22th 2011 1 / 14

  2. Definition of planar maps Planar map = planar connected graph embedded properly in the sphere up to a direct homomorphism of the sphere Rooted planar map = an oriented edge is marked. with a planar embedding = the “outer face” is chosen. Albenque & Poulalhon (LIX – CNRS) Bijection for d -angulations Madrid, June 22th 2011 2 / 14

  3. Triangulations, quadrangualations, . . . Faces = connected components of the plane without the edges of the map. Triangulation, quadrangulation, pentagulation, d -angulation, . . . = map whose faces are all of degree 3, 4, 5, d , . . . Girth = length of the shortest cycle. From now on, only d -angulations of girth d . Albenque & Poulalhon (LIX – CNRS) Bijection for d -angulations Madrid, June 22th 2011 3 / 14

  4. Triangulations, quadrangualations, . . . Faces = connected components of the plane without the edges of the map. Triangulation, quadrangulation, pentagulation, d -angulation, . . . = map whose faces are all of degree 3, 4, 5, d , . . . Girth = length of the shortest cycle. From now on, only d -angulations of girth d . Albenque & Poulalhon (LIX – CNRS) Bijection for d -angulations Madrid, June 22th 2011 3 / 14

  5. Triangulations, quadrangualations, . . . Faces = connected components of the plane without the edges of the map. Triangulation, quadrangulation, pentagulation, d -angulation, . . . = map whose faces are all of degree 3, 4, 5, d , . . . Girth = length of the shortest cycle. From now on, only d -angulations of girth d . Albenque & Poulalhon (LIX – CNRS) Bijection for d -angulations Madrid, June 22th 2011 3 / 14

  6. Enumeration One of the main question when studying some families of maps : How many maps belong to this family ? Tutte ’60s: recursive decomposition Matrix integrals: t’Hooft ’74,Brézin, Itzykson, Parisi and Zuber ’78 , Representation of the symmetric group: Goulden and Jackson ’87 , Bijective approach with labeled trees: Cori-Vauquelin ’81, Schaeffer ’98, Bouttier, Di Francesco and Guitter ’04, Bernardi, Chapuy, Fusy, Miermont, . . . Bijective approach with blossoming trees: Schaeffer ’98, Schaeffer and Bousquet-Mélou ’00, Poulalhon and Schaeffer ’05, Fusy, Poulalhon and Schaeffer ’06. Albenque & Poulalhon (LIX – CNRS) Bijection for d -angulations Madrid, June 22th 2011 4 / 14

  7. Rooted simple triangulations The number of rooted simple triangulations with 2 n faces, 3 n edges and n + 2 vertices is equal to: � 4 n − 2 � n !( 3 n − 1 )! = 1 2 ( 4 n − 3 )! 2 . n · ( 4 n − 2 ) n − 1 � �� � number of blossoming trees with n nodes Blossoming tree = rooted plane tree where each node (= inner vertex) carries exactly two leaves. Theorem (Poulalhon and Schaeffer ’05) There exists a one-to-one correspondence between the set of balanced plane trees with n nodes and two leaves adjacent to each node, and the set of rooted simple triangulations of size n. Albenque & Poulalhon (LIX – CNRS) Bijection for d -angulations Madrid, June 22th 2011 5 / 14

  8. Closure of a blossoming tree Root of the tree is not involved in the local closure ⇒ the tree is balanced. n trees correspond to the same rooted triangulation. Albenque & Poulalhon (LIX – CNRS) Bijection for d -angulations Madrid, June 22th 2011 6 / 14

  9. Closure of a blossoming tree Root of the tree is not involved in the local closure ⇒ the tree is balanced. n trees correspond to the same rooted triangulation. Albenque & Poulalhon (LIX – CNRS) Bijection for d -angulations Madrid, June 22th 2011 6 / 14

  10. Closure of a blossoming tree Root of the tree is not involved in the local closure ⇒ the tree is balanced. n trees correspond to the same rooted triangulation. Albenque & Poulalhon (LIX – CNRS) Bijection for d -angulations Madrid, June 22th 2011 6 / 14

  11. Closure of a blossoming tree Root of the tree is not involved in the local closure ⇒ the tree is balanced. n trees correspond to the same rooted triangulation. Albenque & Poulalhon (LIX – CNRS) Bijection for d -angulations Madrid, June 22th 2011 6 / 14

  12. Closure of a blossoming tree Root of the tree is not involved in the local closure ⇒ the tree is balanced. n trees correspond to the same rooted triangulation. Albenque & Poulalhon (LIX – CNRS) Bijection for d -angulations Madrid, June 22th 2011 6 / 14

  13. Closure of a blossoming tree Root of the tree is not involved in the local closure ⇒ the tree is balanced. n trees correspond to the same rooted triangulation. Albenque & Poulalhon (LIX – CNRS) Bijection for d -angulations Madrid, June 22th 2011 6 / 14

  14. Closure of a blossoming tree Root of the tree is not involved in the local closure ⇒ the tree is balanced. n trees correspond to the same rooted triangulation. Albenque & Poulalhon (LIX – CNRS) Bijection for d -angulations Madrid, June 22th 2011 6 / 14

  15. Closure of a blossoming tree Root of the tree is not involved in the local closure ⇒ the tree is balanced. n trees correspond to the same rooted triangulation. Albenque & Poulalhon (LIX – CNRS) Bijection for d -angulations Madrid, June 22th 2011 6 / 14

  16. Closure of a blossoming tree Root of the tree is not involved in the local closure ⇒ the tree is balanced. n trees correspond to the same rooted triangulation. Albenque & Poulalhon (LIX – CNRS) Bijection for d -angulations Madrid, June 22th 2011 6 / 14

  17. Closure of a blossoming tree Root of the tree is not involved in the local closure ⇒ the tree is balanced. n trees correspond to the same rooted triangulation. Albenque & Poulalhon (LIX – CNRS) Bijection for d -angulations Madrid, June 22th 2011 6 / 14

  18. Closure of a blossoming tree Root of the tree is not involved in the local closure ⇒ the tree is balanced. n trees correspond to the same rooted triangulation. Albenque & Poulalhon (LIX – CNRS) Bijection for d -angulations Madrid, June 22th 2011 6 / 14

  19. Closure of a blossoming tree How to describe the inverse construction ? with orientations. Albenque & Poulalhon (LIX – CNRS) Bijection for d -angulations Madrid, June 22th 2011 6 / 14

  20. Orientations Orientation of a planar map = an orientation is given to each edge We want to consider orientations where the outdegree of each vertex is prescribed → general theory of α -orientation (Felsner). For triangulations: � out ( v ) = 3 for each v not in the root face 3-orientation = out ( v ) = 0 otherwise . Theorem (Schnyder ’89, Felsner ’04) Each rooted triangulation of girth 3 admits a unique minimal 3-orientation, ie. a 3-orientation without counterclockwise cycle. Moreover there exists a directed path from any vertices to the root face : the orientation is accessible. Albenque & Poulalhon (LIX – CNRS) Bijection for d -angulations Madrid, June 22th 2011 7 / 14

  21. Orientations Orientation of a planar map = an orientation is given to each edge We want to consider orientations where the outdegree of each vertex is prescribed → general theory of α -orientation (Felsner). For triangulations: � out ( v ) = 3 for each v not in the root face 3-orientation = out ( v ) = 0 otherwise . Theorem (Schnyder ’89, Felsner ’04) Each rooted triangulation of girth 3 admits a unique minimal 3-orientation, ie. a 3-orientation without counterclockwise cycle. Moreover there exists a directed path from any vertices to the root face : the orientation is accessible. Albenque & Poulalhon (LIX – CNRS) Bijection for d -angulations Madrid, June 22th 2011 7 / 14

  22. Orientations Orientation of a planar map = an orientation is given to each edge We want to consider orientations where the outdegree of each vertex is prescribed → general theory of α -orientation (Felsner). For triangulations: � out ( v ) = 3 for each v not in the root face 3-orientation = out ( v ) = 0 otherwise . Theorem (Schnyder ’89, Felsner ’04) Each rooted triangulation of girth 3 admits a unique minimal 3-orientation, ie. a 3-orientation without counterclockwise cycle. Moreover there exists a directed path from any vertices to the root face : the orientation is accessible. Albenque & Poulalhon (LIX – CNRS) Bijection for d -angulations Madrid, June 22th 2011 7 / 14

  23. Inverse construction Theorem (Poulalhon and Schaeffer ’98) There exists a one-to-one correspondence between the set of balanced plane trees with n nodes and two leaves adjacent to each node, and the set of rooted simple triangulations of size n. Albenque & Poulalhon (LIX – CNRS) Bijection for d -angulations Madrid, June 22th 2011 8 / 14

  24. Inverse construction Theorem (Poulalhon and Schaeffer ’98) There exists a one-to-one correspondence between the set of balanced plane trees with n nodes and two leaves adjacent to each node, and the set of rooted simple triangulations of size n. Albenque & Poulalhon (LIX – CNRS) Bijection for d -angulations Madrid, June 22th 2011 8 / 14

Recommend

Statement Problem A: Bijection In this problem, you have to establish a bijection between

Statement Problem A: Bijection In this problem, you have to establish a bijection between

Problem A: Bijection Statement Statement Problem A: Bijection In this problem, you have to establish a bijection between combinations and pairs of a regular bracket sequence and an integer. Ivan Kazmenko (SPb SU) Problem Analysis 28.01.2020

2.1k views • 181 slides
On dimers and spanning trees February 13, 2017 On dimers and spanning trees Introduction

On dimers and spanning trees February 13, 2017 On dimers and spanning trees Introduction

On dimers and spanning trees Introduction Temperleys bijection T-graphs On dimers and spanning trees February 13, 2017 On dimers and spanning trees Introduction Temperleys bijection 1 Introduction T-graphs 2 Temperleys

600 views • 14 slides
Efficient Numerical Methods for Fractional Laplacian and time fractional PDEs Jie Shen Purdue

Efficient Numerical Methods for Fractional Laplacian and time fractional PDEs Jie Shen Purdue

Efficient Numerical Methods for Fractional Laplacian and time fractional PDEs Jie Shen Purdue University Collaborators: Sheng Chen and Changtao Sheng ICERM Workshop on Fractional PDEs, June 18-22, 2018 Two main difficulties with fractional

781 views • 39 slides
The Schrdinger equation for the fractional Laplacian in negative curvature JeanPhilippe

The Schrdinger equation for the fractional Laplacian in negative curvature JeanPhilippe

Introduction Homogeneous trees Hyperbolic spaces Conference Probability and Analysis (Bdlewo, May 15 17, 2017) The Schrdinger equation for the fractional Laplacian in negative curvature JeanPhilippe Anker (Universit

834 views • 33 slides
Part B: Mullin type bijections B.I Mullin bijection and Sheffieldburger paradigm Mullins

Part B: Mullin type bijections B.I Mullin bijection and Sheffieldburger paradigm Mullins

Bijections for maps: Beautiful and Powerful Part B: Mullin type bijections B.I Mullin bijection and Sheffieldburger paradigm Mullins bijection Def. A tree-decorated map is a map with a marked spanning tree. Mullins bijection Def. A

1.62k views • 134 slides
A bijection between cores and dominant Shi regions S. Fishel, M. Vazirani August 6, 2010

A bijection between cores and dominant Shi regions S. Fishel, M. Vazirani August 6, 2010

A bijection between cores and dominant Shi regions S. Fishel, M. Vazirani August 6, 2010 arXiv:0904.3118 [math.CO] To appear in European Journal of Combinatorics Introduction The bijection Sketch of sketch of proof Refinements 1/48 Set-up

993 views • 50 slides
( ( ) ) ( ) ( ) = = Work = h log t n B- B -Trees Trees B B- -Trees

( ( ) ) ( ) ( ) = = Work = h log t n B- B -Trees Trees B B- -Trees

B- B -Trees Trees B B- -Trees Trees Search for key R ( ( ) ) ( ) ( ) = = Work = h log t n B- B -Trees Trees B B- -Trees Trees Each Disk-Read or Disk-Write = one Basic unit of work O(1) Typical Node x

287 views • 4 slides
A New Fractional Process: A Fractional Non-homogeneous Poisson Process Enrico Scalas University

A New Fractional Process: A Fractional Non-homogeneous Poisson Process Enrico Scalas University

Definitions Limit theorems Application to the CTRW Summary and Outlook References A New Fractional Process: A Fractional Non-homogeneous Poisson Process Enrico Scalas University of Sussex Joint work with Nikolai Leonenko (Cardiff

721 views • 37 slides
FUNDAMENTAL SOLUTIONS FOR FRACTIONAL DIFFERENTIAL EQUATIONS INVOLVING FRACTIONAL POWERS OF

FUNDAMENTAL SOLUTIONS FOR FRACTIONAL DIFFERENTIAL EQUATIONS INVOLVING FRACTIONAL POWERS OF

FUNDAMENTAL SOLUTIONS FOR FRACTIONAL DIFFERENTIAL EQUATIONS INVOLVING FRACTIONAL POWERS OF FINITE DIFFERENCES OPERATORS J. G onzalez-Camus (USACH) and P.J. Miana (UZ) Workshop on Banach spaces and Banach lattices ICMAT, September 2019,

567 views • 38 slides
3 with gcd ( a , b ) = 1 . Consider pairs of natural numbers: N N Infinite

3 with gcd ( a , b ) = 1 . Consider pairs of natural numbers: N N Infinite

CS70 Countability More fractions? Cantor Size: A and B have the same size if there is a bijection between A and B . Are rationals countable. A set is countable if there is a bijection from A to a subset of Enumerate the rational numbers in

317 views • 5 slides
A simple explicit bijection between ( n , 2 ) Gog and Magog trapezoids Jrmie B ETTINELLI

A simple explicit bijection between ( n , 2 ) Gog and Magog trapezoids Jrmie B ETTINELLI

6 6 6 6 6 6 6 6 6 Introduction The bijection A simple explicit bijection between ( n , 2 ) Gog and Magog trapezoids Jrmie B ETTINELLI March 7, 2016 Jrmie B ETTINELLI A simple explicit bijection between ( n , 2 ) Gog and Magog

1.02k views • 56 slides
A What is |A|? B Solution: 0 3x+4 1000 iff -4/3 x 996/3 a 1 injection

A What is |A|? B Solution: 0 3x+4 1000 iff -4/3 x 996/3 a 1 injection

Section 2.4: Countability a 1 We can compare the cardinality of two sets. |A| = |B| means there is a bijection b bijection 2 between A and B. c 3 |A| |B| means there is an injection from A to B. d 4 |A| < |B| means |A| |B|

547 views • 15 slides
A new bijection on m -Dyck paths and application to random sampling Axel Bacher LIPN,

A new bijection on m -Dyck paths and application to random sampling Axel Bacher LIPN,

A new bijection on m -Dyck paths and application to random sampling Axel Bacher LIPN, Universit Paris 13 June 3rd, 2016 Outline Introduction 1 The folding bijection 2 m -ukasiewicz paths and m -Dyck prefixes Folding and unfolding

924 views • 38 slides
CS70: Lecture 11. Outline. 1. RSA system (continued) 1.1 Correctness: Fermats Theorem. 1.2

CS70: Lecture 11. Outline. 1. RSA system (continued) 1.1 Correctness: Fermats Theorem. 1.2

CS70: Lecture 11. Outline. 1. RSA system (continued) 1.1 Correctness: Fermats Theorem. 1.2 Construction. 2. Signature Schemes. 3. Warnings. Bijections Bijection is one to one and onto. Bijection: Bijections Bijection is one to one and

2.96k views • 198 slides
Analysis of the controllability of space-time fractional diffusion and super diffusion equations

Analysis of the controllability of space-time fractional diffusion and super diffusion equations

Objectives of the talk Space-time fractional order operators Controllability results for space-time fractional PDEs A new notion of boundary control Open problems Analysis of the controllability of space-time fractional diffusion and super

1.06k views • 62 slides
/ + - * * 5 3 2 6 5 2 Examples Binary Trees BSTs Augmenting BinExpr General Trees

/ + - * * 5 3 2 6 5 2 Examples Binary Trees BSTs Augmenting BinExpr General Trees

Trees Readings: HtDP , sections 14, 15, 16. Topics: Introductory examples and terminology Binary trees Binary search trees Augmenting trees Binary expression trees General arithmetic expression trees Nested lists Examples Binary Trees

1.19k views • 31 slides
Fractional L evy processes Heikki Tikanm aki Stockholm, March 15 2010 Heikki Tikanm aki

Fractional L evy processes Heikki Tikanm aki Stockholm, March 15 2010 Heikki Tikanm aki

Fractional L evy processes Heikki Tikanm aki Stockholm, March 15 2010 Heikki Tikanm aki Fractional L evy processes Introduction Fractional Brownian motion (fBM) is a Gaussian process with certain covariance structure It has

309 views • 15 slides
Fractional Gaussian Noise, Fractional Gaussian Noise, Subdiffusion and Stochastic and Stochastic

Fractional Gaussian Noise, Fractional Gaussian Noise, Subdiffusion and Stochastic and Stochastic

Fractional Gaussian Noise, Fractional Gaussian Noise, Subdiffusion and Stochastic and Stochastic Subdiffusion Networks in Biophysics Networks in Biophysics Samuel Kou Department of Statistics Harvard University Single-Molecule Experiments

741 views • 46 slides
Trees Eric McCreath Overview In this lecture we will explore: general trees, binary trees,

Trees Eric McCreath Overview In this lecture we will explore: general trees, binary trees,

Trees Eric McCreath Overview In this lecture we will explore: general trees, binary trees, binary search trees, and AVL and B-Trees. 2 Trees Trees are recursive data structures. They are useful for: representing items that have a tree

622 views • 27 slides
2-3-4 Trees and Red- Black Trees 204 erm CS 16: Balanced Trees 2-3-4 Trees Revealed Nodes

2-3-4 Trees and Red- Black Trees 204 erm CS 16: Balanced Trees 2-3-4 Trees Revealed Nodes

CS 16: Balanced Trees 2-3-4 Trees and Red- Black Trees 204 erm CS 16: Balanced Trees 2-3-4 Trees Revealed Nodes store 1, 2, or 3 keys and have 2, 3, or 4 children, respectively All leaves have the same depth k n r b e h n r b e

800 views • 31 slides
Algorithms and Data Structures Balanced Trees (AVL-Trees, (a,b)-Trees, Red-Black-Trees)

Algorithms and Data Structures Balanced Trees (AVL-Trees, (a,b)-Trees, Red-Black-Trees)

Algorithms and Data Structures Balanced Trees (AVL-Trees, (a,b)-Trees, Red-Black-Trees) Albert-Ludwigs-Universitt Freiburg Prof. Dr. Rolf Backofen Bioinformatics Group / Department of Computer Science Algorithms and Data Structures, January

884 views • 55 slides
ECO-generation for compositions and Introduction their restrictions Recalls Bijection C 1 , p (

ECO-generation for compositions and Introduction their restrictions Recalls Bijection C 1 , p (

BARIL & DO ECO-generation for compositions and Introduction their restrictions Recalls Bijection C 1 , p ( n ) Jean-Luc BARIL & Phan-Thuan DO p ( n ) C C # p ( n ) Universit de Bourgogne France Summary CAT Permutation

481 views • 32 slides
NON-SYMMETRIC FRACTIONAL DIFFUSION NON-SYMMETRIC FRACTIONAL DIFFUSION AS A SPECIAL CASE OF AS A

NON-SYMMETRIC FRACTIONAL DIFFUSION NON-SYMMETRIC FRACTIONAL DIFFUSION AS A SPECIAL CASE OF AS A

NON-SYMMETRIC FRACTIONAL DIFFUSION NON-SYMMETRIC FRACTIONAL DIFFUSION AS A SPECIAL CASE OF AS A SPECIAL CASE OF NONLOCAL CONVECTION-DIFFUSION NONLOCAL CONVECTION-DIFFUSION Marta D'Elia, Center for Computing Research, SNL, mdelia@sandia.gov M.

1.13k views • 75 slides
AVL TREES Height Balance : AVL Trees h 1 h 2 | h - h | 1 AVL AVL 2 1 non-AVL trees

AVL TREES Height Balance : AVL Trees h 1 h 2 | h - h | 1 AVL AVL 2 1 non-AVL trees

AVL TREES Height Balance : AVL Trees h 1 h 2 | h - h | 1 AVL AVL 2 1 non-AVL trees AVL trees S. Prasitjutrakul 1994 AVL Trees : I nsertion m m k k k u u k k m m v t u m m t t u k m u k u p v t k p v v

320 views • 16 slides

More recommend