244 results on '"Bousquet-Mélou, Mireille"'
Search Results
202. The generating function of convex polyominoes: The resolution of a q-differential system
- Author
-
Bousquet-Mélou, Mireille, primary and Fédou, Jean-Marc, additional
- Published
- 1995
- Full Text
- View/download PDF
203. Canonical positions for the factors in paperfolding sequences
- Author
-
Allouche, Jean-Paul, primary and Bousquet-Mélou, Mireille, additional
- Published
- 1994
- Full Text
- View/download PDF
204. Facteurs des suites de Rudin-Shapiro généralisées
- Author
-
Allouche, Jean-Paul, primary and Bousquet-Mélou, Mireille, additional
- Published
- 1994
- Full Text
- View/download PDF
205. Codage des polyominos convexes et équations pour l'énumération suivant l'aire
- Author
-
Bousquet-Mélou, Mireille, primary
- Published
- 1994
- Full Text
- View/download PDF
206. Polyominoes and polygons
- Author
-
Bousquet-Mélou, Mireille, primary
- Published
- 1994
- Full Text
- View/download PDF
207. q-Énumération de Polyominos Convexes
- Author
-
Bousquet-Mélou, Mireille, primary
- Published
- 1993
- Full Text
- View/download PDF
208. The number of minimal words chains computing the Thue-Morse word
- Author
-
Bousquet-Mélou, Mireille, primary
- Published
- 1992
- Full Text
- View/download PDF
209. Empilements de segments et q-énumération de polyominos convexes dirigés
- Author
-
Bousquet-Mélou, Mireille, primary and Viennot, Xavier Gérard, additional
- Published
- 1992
- Full Text
- View/download PDF
210. The expected number of inversions after n adjacent transpositions.
- Author
-
Bousquet-Mélou, Mireille
- Subjects
- *
INVERSIONS (Geometry) , *MARKOV processes , *PERMUTATIONS , *COMBINATORICS , *ALGEBRA - Abstract
We give a new expression for the expected number of inversions in the product of n random adjacent transpositions in the symmetric group Sm+1. We then derive from this expression the asymptotic behaviour of this number when n ≡ nm scales with m in various ways. Our starting point is an equivalence, due to Eriksson et al., with a problem of weighted walks confined to a triangular area of the plane. [ABSTRACT FROM AUTHOR]
- Published
- 2010
211. Culminating paths.
- Author
-
Bousquet-Mélou, Mireille and Ponty, Yann
- Subjects
- *
LATTICE paths , *NUMBER theory , *BIOINFORMATICS , *ALGORITHMS , *LORENTZ groups - Abstract
Let a and b be two positive integers. A culminating path is a path of Z² that starts from (0; 0), consists of steps (1, a) and (1, -b), stays above the x-axis and ends at the highest ordinate it ever reaches. These paths were first encountered in bioinformatics, in the analysis of similarity search algorithms. They are also related to certain models of Lorentzian gravity in theoretical physics. We first show that the language on a two letter alphabet that naturally encodes culminating paths is not context-free. Then, we focus on the enumeration of culminating paths. A step by step approach, combined with the kernel method, provides a closed form expression for the generating function of culminating paths ending at a (generic) height k. In the case a = b, we derive from this expression the asymptotic behaviour of the number of culminating paths of length n. When a > b, we obtain the asymptotic behaviour by a simpler argument. When a < b, we only determine the exponential growth of the number of culminating paths. Finally, we study the uniform random generation of culminating paths via various methods. The rejection approach, coupled with a symmetry argument, gives an algorithm that is linear when a ≥ b, with no precomputation stage nor non-linear storage required. The choice of the best algorithm is not as clear when a < b. An elementary recursive approach yields a linear algorithm after a precomputation stage involving O(n³) arithmetic operations, but we also present some alternatives that may be more efficient in practice. [ABSTRACT FROM AUTHOR]
- Published
- 2008
212. Three osculating walkers.
- Author
-
Bousquet-Mélou, Mireille
- Published
- 2006
- Full Text
- View/download PDF
213. The Lang–Vojta Conjectures on Projective Pseudo-Hyperbolic Varieties
- Author
-
Javanpeykar, Ariyan, Hussin, Véronique, Series Editor, Bousquet-Mélou, Mireille, Editorial Board Member, Córdoba Barba, Antonio, Editorial Board Member, Jitomirskaya, Svetlana, Editorial Board Member, Murty, V. Kumar, Editorial Board Member, Polterovich, Leonid, Editorial Board Member, and Nicole, Marc-Hubert, editor
- Published
- 2020
- Full Text
- View/download PDF
214. Hyperbolicity of Varieties of Log General Type
- Author
-
Ascher, Kenneth, Turchet, Amos, Hussin, Véronique, Series Editor, Bousquet-Mélou, Mireille, Editorial Board Member, Córdoba Barba, Antonio, Editorial Board Member, Jitomirskaya, Svetlana, Editorial Board Member, Murty, V. Kumar, Editorial Board Member, Polterovich, Leonid, Editorial Board Member, and Nicole, Marc-Hubert, editor
- Published
- 2020
- Full Text
- View/download PDF
215. Lectures on the Ax–Schanuel conjecture
- Author
-
Bakker, Benjamin, Tsimerman, Jacob, Hussin, Véronique, Series Editor, Bousquet-Mélou, Mireille, Editorial Board Member, Córdoba Barba, Antonio, Editorial Board Member, Jitomirskaya, Svetlana, Editorial Board Member, Murty, V. Kumar, Editorial Board Member, Polterovich, Leonid, Editorial Board Member, and Nicole, Marc-Hubert, editor
- Published
- 2020
- Full Text
- View/download PDF
216. Arithmetic Aspects of Orbifold Pairs
- Author
-
Campana, Frédéric, Hussin, Véronique, Series Editor, Bousquet-Mélou, Mireille, Editorial Board Member, Córdoba Barba, Antonio, Editorial Board Member, Jitomirskaya, Svetlana, Editorial Board Member, Murty, V. Kumar, Editorial Board Member, Polterovich, Leonid, Editorial Board Member, and Nicole, Marc-Hubert, editor
- Published
- 2020
- Full Text
- View/download PDF
217. Applications in Symplectic Geometry
- Author
-
Zhang, Jun, Hussin, Véronique, Series Editor, Bousquet-Mélou, Mireille, Editorial Board Member, Córdoba Barba, Antonio, Editorial Board Member, Jitomirskaya, Svetlana, Editorial Board Member, Murty, V. Kumar, Editorial Board Member, Polterovich, Leonid, Editorial Board Member, and Zhang, Jun
- Published
- 2020
- Full Text
- View/download PDF
218. Tamarkin Category Theory
- Author
-
Zhang, Jun, Hussin, Véronique, Series Editor, Bousquet-Mélou, Mireille, Editorial Board Member, Córdoba Barba, Antonio, Editorial Board Member, Jitomirskaya, Svetlana, Editorial Board Member, Murty, V. Kumar, Editorial Board Member, Polterovich, Leonid, Editorial Board Member, and Zhang, Jun
- Published
- 2020
- Full Text
- View/download PDF
219. Preliminaries
- Author
-
Zhang, Jun, Hussin, Véronique, Series Editor, Bousquet-Mélou, Mireille, Editorial Board Member, Córdoba Barba, Antonio, Editorial Board Member, Jitomirskaya, Svetlana, Editorial Board Member, Murty, V. Kumar, Editorial Board Member, Polterovich, Leonid, Editorial Board Member, and Zhang, Jun
- Published
- 2020
- Full Text
- View/download PDF
220. Introduction
- Author
-
Zhang, Jun, Hussin, Véronique, Series Editor, Bousquet-Mélou, Mireille, Editorial Board Member, Córdoba Barba, Antonio, Editorial Board Member, Jitomirskaya, Svetlana, Editorial Board Member, Murty, V. Kumar, Editorial Board Member, Polterovich, Leonid, Editorial Board Member, and Zhang, Jun
- Published
- 2020
- Full Text
- View/download PDF
221. Induction Schemes : From Language Separation to Graph Colorings
- Author
-
PIERRON, Théo, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Université de Bordeaux, Marc Zeitoun, Eric Sopena, STAR, ABES, Zeitoun, Marc, Sopena, Eric, Bonamy, Marthe, Colcombet, Thomas, Bousquet-Mélou, Mireille, Dvořák, Zdeněk, PILIPCZUK, Michal, and Sereni, Jean-Sébastien
- Subjects
[INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL] ,Languages separation ,Graphe planaire ,Regular language ,Méthode de déchargement ,Graph coloring ,[INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL] ,[INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL] ,Planar graph ,[INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL] ,Séparation de langages ,Coloration de graphe ,Langage régulier ,Discharging method - Abstract
In this thesis, we present results obtained in two fields: formal language theory and graph theory. In formal language theory, we consider some problems of characterization of classes of regular languages. The generic problem consists in determining whether a given regular language can be defined in a fixed formalism. The current approaches use a more general problem called separation. We present here two types of contributions: a generalization of a decidability result to the setting of infinite words, together with lower bounds for the complexity of the separation problem. In graph theory, we consider the classical problem of graph coloring, where we assign colors to vertices of a graph in such a way that two adjacent vertices receive different colors. The goal is to use the fewest colors. When the graphs are sparse, a crucial tool for this is the discharging method. It is most notably decisive in the proof of the Four-Color Theorem. This method can be seen as an unconventional construction of an inductive proof scheme, specific to the considered problem and graph class, where arguing the validity of the scheme is rarely immediate. We use variants of the discharging method to study two types of coloring problems., Cette thèse présente des résultats obtenus dans deux domaines : la théorie des langages, et la théorie des graphes. En théorie des langages, on s’intéresse à des problèmes de caractérisation de classes de langages réguliers. Le problème générique consiste à déterminer si un langage régulier donné peut être défini dans un certain formalisme. Les méthodes actuelles font intervenir un problème plus général appelé séparation. On présente ici deux types de contributions : une généralisation d’un résultat de décidabilité au cadre des langages de mots infinis, ainsi que des bornes inférieures pour la complexité du problème de séparation. En théorie des graphes, on considère le problème classique de coloration de graphes, où on cherche à attribuer des couleurs aux sommets d’un graphe de sorte que les sommets adjacents reçoivent des couleurs différentes, le but étant d’utiliser le moins de couleurs possible. Dans le cas des graphes peu denses, la méthode de déchargement est un atout majeur. Elle a notamment joué un rôle décisif dans la preuve du théorème des quatre couleurs. Cette méthode peut être vue comme une construction non conventionnelle d’un schéma de preuve par induction, spécifique à la classe de graphes et à la propriété considérées, et où la validité du schéma est rarement immédiate. On utilise des variantes de la méthode de déchargement pour étudier deux types de problèmes de coloration.
- Published
- 2019
222. Eulerian orientations and the six-vertex model on planar maps
- Author
-
Mireille Bousquet-Mélou, Andrew Elvey Price, Paul Zinn-Justin, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Laboratoire de Physique Théorique et Hautes Energies (LPTHE), Université Pierre et Marie Curie - Paris 6 (UPMC)-Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), and Bousquet-Mélou, Mireille
- Subjects
[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO] ,Mathematics::Combinatorics ,six vertex model ,Eulerian orientations ,[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] ,matrix integrals ,theta functions ,planar maps - Abstract
International audience; We address the enumeration of planar 4-valent maps equipped with an Eulerian orientation by two different methods, and compare the solutions we thus obtain. With the first method we enumerate these orientations as well as a restricted class which we show to be in bijection with general Eulerian orientations. The second method, based on the work of Kostov, allows us to enumerate these 4-valent orienta-tions with a weight on some vertices, corresponding to the six vertex model. We prove that this result generalises both results obtained using the first method, although the equivalence is not immediately clear.
- Published
- 2019
223. Quelques modèles à l’interface des probabilités et de la combinatoire : processus de particules et cartes
- Author
-
FREDES CARRASCO, Luis, STAR, ABES, Marckert, Jean-François, Albenque, Marie, Bousquet-Mélou, Mireille, Le Gall, Jean-François, Broutin, Nicolas, Miermont, Grégory, and Mörters, Peter
- Subjects
[MATH.MATH-PR] Mathematics [math]/Probability [math.PR] ,Lois invariantes ,Interactive particle systems ,Processus de particule ,Bijective map counting ,Extinction ,Comptage bijective de cartes ,Limit local ,Limite locale ,Random maps ,[INFO.INFO-MO] Computer Science [cs]/Modeling and Simulation ,Cartes aleatoires ,Invariant measures ,Coexistence - Abstract
This thesis consists in several works exploring some models belonging to two branches of probability theory: interacting particle systems and random planar maps. A first work concerns algebraic aspects of interacting particle systems invariant measures. We obtain some necessary and sufficient conditions for some continuous time particle systems with discrete local state space, to have a simple invariant measure. In a second work we investigate the effect on survival and coexistence of introducing forest fire epidemics to a certain two-species spatial competition model. Our main results show that, for the two-type model, there are explicit parameter regions where either one species dominates or there is coexistence; contrary to the same model without forest fires, for which the fittest species alwaysdominates. The third and fourth works are related to tree-decorated planar maps. In the third work we present a bijection between the set of tree-decorated maps and the Cartesian product between the set of trees and the set of maps with a simple boundary. We obtain some counting results and some tools to study random decorated map models. In the fourth work we prove that uniform tree-decorated triangulations and quadrangulations with f faces, boundary of length p and decorated by a tree of size a converge weakly for the local topology to different limits, depending on the finite or infinite behavior of f, p and a., Cette thèse se compose de plusieurs travaux portant sur deux branches de la théorie des probabilités: processus de particules et cartes planaires aléatoires. Un premier travail concerne les aspects algébriques des mesures invariantes des processus de particules. Nous obtenons des conditions nécessaires et suffisantes sous lesquelles un processus de particules en temps continu avec espace d’états local discret possède une mesure invariante simple. Dans un deuxième travail nous étudions un modèle "biologique" de coexistence de 2 espèces en compétition sur un espace partagé, et soumis à des épidémies modélisées par un modèle probabiliste appelé "feux de forêts". Notre résultat principal montre que pour deux espèces, il existe des régions explicites de paramètres pour lesquelles une espèce domine ou les deux espèces coexistent. Il s’agit d’un des premiers modèles pour lesquels la coexistence d’espèces sur le long terme est prouvée. Les troisièmes et quatrièmes travaux. portent sur les cartes planaires décorées par des arbres. Dans le troisième nous présentons une bijection entre l’ensemble des cartes décorées par des arbres et le produit Cartésien entre l’ensemble des arbres planaires et l’ensemble de cartes à bord simple. Nous obtenons quelques formules de comptage et quelques outils pour l’étude de cartes aléatoires décorées par un arbre. Le quatrième travail montre que les triangulations et quadrangulations aléatoires uniformes avec f faces, bord simple de taille p et décorées par un arbre avec a arêtes, convergent en loi pour la topologie locale vers différentes limites, dépendant du comportement fini ou infini de la limite de f, p et a.
- Published
- 2019
224. Combinatoire dans des stabilisations du modèle du tas de sable sur la grille Z²
- Author
-
DERYCKE, Henri, STAR, ABES, Le Borgne, Yvan, Bousquet-Mélou, Mireille, Marckert, Jean-François, Sportiello, Andrea, Hivert, Florent, Corteel, Sylvie, and Schaeffer, Gilles
- Subjects
Spanning tree ,Recurrence ,Sandpile model ,Tas de sable ,Arbre couvrant ,[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS] ,Récurrence ,Bootstrap percolation ,Q-analogue - Abstract
The sandpile model is a discrete model for diffusion of grains on a graph introduced by physicists Bak, Tang and Wiesenfeld as an illustration for self-organised criticality. For any finite graph, Dhar identified many of its numerous structures which simplify its analysis. This thesis focus on the usual square lattice and its subgraphs which are strips of height H, both notions of infinite graphs. Approximations on the behaviour of the stabilisation of a large stack of grains at the origin of the square lattice lead to some random distribution of grains, which stabilisation is connected to some models of bootstrap percolation where modified vertices by this stabilisation forms a rectangle. The laws of the half-perimeter of this rectangle are described by statistics on permutations. As a byproduct, the difference between the generating functions over some permutations of two classical mahonian statistics on permutations appears to mainly be a polynomial with coefficients which are integers and especially positive. Then, this thesis visits in the case of the studied infinite graphs some well-defined structures on finite graphs, in particular the recurrence. In the model on an horizontal strip of height H, we extend the existence of finite automata recognizing recurrent configurations read column by column presented by Járai and Lyons to new automata with significantly less states and these numbers are closer to a conjecture due to Gamlin. An implementation leads to explicit automata for heights 3 and 4 while up to now only the case 2 was obtained by hand. In a second approach, we consider the configurations on the twodimensional square lattice which are periodic in two directions. We suggest to place the sink ensuring that the stabilisation ends at infinity in a direction of rational slope which allows to preserve biperiodicity and a weaker form of Dhar criterion for recurrent configurations. Hence we obtain an effective algorithm defining recurrent configurations among the biperiodic and stable configurations. These biperiodic and recurrent configurations are natural candidates for being the elements of finite subgroups of the hypothetical group on configurations of the sandpile model on the square lattice. We discuss some notions allowing the definition of the law of such a group and experimentally provide some finite subgroups., Le modèle du tas de sable est un modèle de diffusion discret et isotrope introduit par les physiciens Bak, Tang et Wiesenfeld comme illustration de la criticalité auto-organisée. Pour tout graphe, souvent supposé fini, Dhar a formalisé de nombreuses propriétés simplifiant son analyse. Cette thèse propose des études de ce modèle sur la grille bidimensionnelle usuelle et certains de ses sous-graphes également infinis que sont les bandes bi-infinies de hauteur finie. Des approximations du comportement de la pile de sable peuvent se rapprocher de certains modèles de bootstrap percolation avec un support de stabilisation rectangulaire. Les lois sur son demi-périmètre peuvent se décrire à l’aide de statistiques sur les permutations. Un sous-produit de ce travail fait apparaître une différence de deux séries génératrices comptant des permutations selon deux statistiques mahoniennes classiques dont est extrait un polynôme à coefficients entiers et surtout positifs. La suite de cette thèse revisite dans le cadre de ces graphes infinis, des structures jusque-là bien définies uniquement dans le cas des graphes finis, notamment la récurrence. Dans le modèle sur une bande de hauteur finie H, l’existence donnée par Járai et Lyons d’automates finis reconnaissant les configurations récurrentes lues colonne par colonne est étendu par une construction explicite d’automates avec un nombre moindre d’états, se rapprochant de la conjecture de Gamlin. Dans une seconde approche, l’étude se concentre sur les configurations sur la grille entière qui sont périodiques dans les deux directions. Le puits, un sommet du graphe garantissant la terminaison de la stabilisation, est placé à l’infini dans une direction de pente rationnelle. Ceci permet à la fois de préserver la bipériodicité et de proposer une forme affaiblie du critère de Dhar caractérisant ainsi par un algorithme effectif les configurations récurrentes. Ces configurations récurrentes bipériodiques sont des candidates naturelles pour être les éléments de sous-groupes finis de l’éventuel groupe du tas de sable sur la grille. Des éléments de construction de cette loi de groupe donnent expérimentalement quelques sous-groupes finis.
- Published
- 2018
225. Combinatoire de l’ASEP, arbres non-ambigus et polyominos parallélogrammes périodiques
- Author
-
LABORDE-ZUBIETA, Patxi, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Université de Bordeaux, Jean-Christophe Aval, Adrien Boussicault, STAR, ABES, Aval, Jean-Christophe, Boussicault, Adrien, Hivert, Florent, Krattenthaler, Christian, Bousquet-Mélou, Mireille, Nadeau, Philippe, and Corteel, Sylvie
- Subjects
[INFO.INFO-OH] Computer Science [cs]/Other [cs.OH] ,Staircase tableaux ,Polyominos parallélogrammes périodiques ,Tree-like tableaux ,Tableaux escaliers ,Non-ambiguous trees ,ASEP ,Tableaux boisés ,[INFO.INFO-OH]Computer Science [cs]/Other [cs.OH] ,Arbres non-ambigus ,Periodic parallelogram polyominoes - Abstract
This thesis deals with a combinatorial interpretation of the stationnarydistribution of the ASEP given by staircase tableaux and studiestwo combinatorial objects : non-ambiguous trees and periodic parallelogrampolyominoes.In the first part, we study the matrix ansatz introduced by Derrida, Evans,Hakim and Pasquier. Any solution of this equation system can be used tocompute the stationnary probabilities of the ASEP. Our work defines newrecurrences equivalent to the matrix ansatz. By defining an insertion algorithmfor staircase tableaux, we prove combinatorially and easily that they satisfyour new recurrences. We do the same for the ASEP with two types of particles.Finally, we enumerate the corners of the tableaux related to the ASEP, whichgives the average number of transitions from a state of the ASEP.In the second part, we compute nice formulas for the generating functionsof non-ambiguous trees, from which we deduce enumeration formulas. Then, wegive a combinatorial interpretation of some of our results. Lastly, we generalisenon-ambiguous trees to every finite dimension.In the last part, we define a tree structure in periodic parallelogram polyominoes,motivated by the work of Boussicault, Rinaldi and Socci. It allowsus to compute easily the generating function with respect to the height andthe width as well as two new statistics : the intrinsic width and the intrinsicgluing height. Finally, we investigate the ultimate periodicity of the generatingfunction with respect to the area., Cette thèse porte sur l’interprétation combinatoire des probabilitésde l’état stationnaire de l’ASEP par les tableaux escaliers, sur les arbresnon-ambigus et sur les polyominos parallélogrammes périodiques.Dans une première partie, nous étudions l’ansatz matriciel de Derrida,Evans, Hakim et Pasquier. Toute solution de ce système d’équation permet decalculer les probabilités stationnaires de l’ASEP. Nos travaux définissent denouvelles récurrences équivalentes à celles de l’ansatz matriciel. En définissantun algorithme d’insertion sur les tableaux escaliers, nous montrons combinatoirementet simplement qu’ils les satisfont. Nous faisons de même pour l’ASEPà deux particules. Enfin, nous énumérons les coins dans les tableaux associésà l’ASEP, nous permettant ainsi de donner le nombre moyen de transitionspossibles depuis un état de l’ASEP.Dans une deuxième partie, nous calculons de jolies formules pour les sériesgénératrices des arbres non-ambigus, desquelles nous déduisons des formulesd’énumérations. Puis, nous interprétons bijectivement certains de ces résultats.Enfin, nous généralisons les arbres non-ambigus à toutes les dimensions finies.Dans la dernière partie, nous construisons une structure arborescente surles polyominos parallélogrammes périodiques, inspirée des travaux de Boussicault,Rinaldi et Socci. Cela nous permet de calculer facilement leur sériegénératrice selon la hauteur et la largeur ainsi que deux nouvelles statistiques :la largeur intrinsèque et la hauteur de recollement intrinsèque. Enfin, nousétudions l’ultime périodicité de leur série génératrice selon l’aire.
- Published
- 2017
226. Graphes planaires : dessins non-alignés, domination de puissance et énumération d’orientations Eulériennes
- Author
-
Pennarun, Claire, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Université de Bordeaux, Nicolas Bonichon, Paul Dorbec, STAR, ABES, Bonichon, Nicolas, Dorbec, Paul, Brauner, Nadia, Fusy, Eric, Henning, Michael A., Bousquet-Mélou, Mireille, and Pennarun, Claire
- Subjects
Domination de puissance ,Enumeration ,Power domination ,Graphe planaire ,[INFO.INFO-OH]Computer Science [cs]/Other [cs.OH] ,Dessin planaire ,[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS] ,Algorithme ,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO] ,[INFO.INFO-OH] Computer Science [cs]/Other [cs.OH] ,Graph drawing ,Planar graph ,Algorithm ,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM] ,Énumération - Abstract
In this thesis, we present results on three different problems concerning planar graphs. We first give some new results on planar non-aligned drawings, i.e., planar grid drawings where vertices are all on different rows and columns. We show that not every planar graph has a non-aligned drawing on a grid with n rows and columns, but we present two algorithms generating a non-aligned polyline drawings on such a grid requiring either n − 3 or min( (2n−5)/3 , #{separating triangles} + 1) bends in total. Concerning non-minimal grids, we give two algorithms drawing a planar non-aligned drawing on grids with area O(n^4). We also give specific results for 4-connected graphs and nested-triangle graphs.The second topic is power domination in planar graphs. We present a family of graphs with power dominating number γ_P at least n/6 . We then prove that for every maximal planar graph G of order n, γ_P (G) ≤ (n−2)/4 , and we give a constructive algorithm. We also prove that for triangular grids Tk of dimension k with hexagonal-shape border, γ_P (Tk) = \lceil k/3 \rceil.Finally, we focus on the enumeration of planar Eulerian orientations. After proposing a new decomposition for these maps, we define subsets and supersets of planar Eulerian orientations with parameter k, generated by looking at the orientations of the last 2k − 1 edges around the root vertex. For each set, we give a system of functional equations defining its generating function, and we prove that it is always algebraic. This way, we show that the growth rate of planar Eulerian orientations is between 11.56 and 13.005., Dans cette thèse, nous étudions trois problèmes concernant les graphes planaires.Nous travaillons tout d’abord sur les dessins planaires non-alignés, c’est-à-dire des dessins planaires de graphes sur une grille sans que deux sommets se trouvent sur la même ligne ou la même colonne. Nous caractérisons les graphes planaires possédant un tel dessin sur une grille à n lignes et n colonnes, et nous présentons deux algorithmes générant un dessin planaire non-aligné avec arêtes brisées sur cette grille pour tout graphe planaire, avec n − 3 ou min( (2n−5)/3 , #{triangles séparateurs} + 1) brisures au total. Nous proposons également deux algorithmes dessinant un dessin planaire non-aligné sur des grilles d’aire O(n^4). Nous donnons des résultats spécifiques concernant les graphes 4-connexes et de typetriangle-emboîté.Le second sujet de cette thèse est la domination de puissance dans les graphes planaires. Nous exhibons une famille de graphes ayant un nombre de domination de puissance γ_P au moins égal à n/6 . Nous montrons aussi que pour tout graphe planaire maximal G à n ≥ 6 sommets, γ_P (G) ≤ (n−2)/4 . Enfin, nous étudions les grilles triangulaires Tk à bord hexagonal de dimension k et nous montrons que γ_P (Tk ) = \lceil k/3 \rceil.Nous étudions également l’énumération des orientations planaires Eulériennes. Nous proposons tout d’abord une nouvelle décomposition de ces cartes. Puis, en considérant les orientations des dernières 2k − 1 arêtes autour de la racine, nous définissons des sous- et sur-ensembles des orientations planaires Eulériennes paramétrés par k. Pour chaque classe, nous proposons un système d’équations fonctionnelles définissant leur série génératrice, et nous prouvons que celle-ci est toujours algébrique. Nous montrons ainsi que la constante de croissance des orientations planaires Eulériennes est comprise entre 11.56 et 13.005.
- Published
- 2017
227. Polynominalité des coefficients de structures des algèbres de doubles-classes
- Author
-
Tout, Omar, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Université de Bordeaux, Jean-Christophe Aval, Valentin Feray, Aval, Jean-Christophe, Feray, Valentin, Bousquet-Mélou, Mireille, Cori, Robert, Méliot, Pierre-Loïc, Vassilieva, Ekaterina, Schaeffer, Gilles, Hivert, Florent, Goupil, Alain, and STAR, ABES
- Subjects
[INFO.INFO-OH] Computer Science [cs]/Other [cs.OH] ,Algèbres de doubles-classes ,[INFO.INFO-OH]Computer Science [cs]/Other [cs.OH] ,Structure coefficients ,Coefficients de structure ,Centres des algèbres de groupe ,Centers of group algebras ,Double-class algebras - Abstract
In this thesis we studied the structure coefficients and especially their dependence on n in the case of a sequence of double-class algebras. The first chapter is dedicated to the study of the structure coefficients in the general cases of centers of group algebras and double-class algebras. We recall in it the representation theory of finite groups and its link with structure coefficients. We show also that the study of the structure coefficients of double-class algebras is related to the theory of Gelfand pairs and zonal spherical functions by giving, in the case of Gelfand pairs, a theorem similar to that of Frobenius which writes the structure coefficients of the double-class algebra associated to a Gelfand pair in terms of zonal spherical functions. In the second chapter, we recall the Farahat and Higman's theorem about the polynomiality of the structure coefficients of the center of the symmetric group algebra as well as the Ivanov and Kerov's approach to prove this theorem. We give a combinatorial proof to the polynomiality property of the structure coefficients of the Hecke algebra of thepair (S2n, Bn) in the third chapter. Our proof uses a universal algebra which projects on the Hecke algebra of (S2n, Bn) for each n. We show that this universal algebra is isomorphic to the algebra of 2-shifted symmetric functions. In the fourth and last chapter we build a general framework which gives us the form of the structure coefficients in the case of a sequence of double-class algebras. This framework implies the polynomiality property of the structure coefficients of both the center of the symmetric group algebra and the Hecke algebra of (S2n, Bn). In addition, we give a polynomiality property for the structure coefficients of both the center of the hyperoctahedral group algebra and the double-class algebra of diag (Sn-1) in Sn x Sopp n-1., On étudie dans cette thèse les coefficients de structure et particulièrement leurs dépendancesen n dans le cadre d’une suite des algèbres de doubles-classes. Le premier chapitre est dédié à l’étude des coefficients de structure dans le cas général des centres d’algèbres de groupes finis et des algèbres de doubles-classes. On rappelle dans ce chapitre la théorie des représentationsdes groupes finiset son lien avec les coefficients de structure. On montre que l’étude des coefficients de structure des algèbres de doubles-classes est reliéeà la théorie des paires de Gelfand et auxfonctions sphériques zonales en donnant un théorème similaireà celui de Frobenius. Ce théorème exprime les coefficients de structure d’une algèbre de doubles-classes associée à une paire de Gelfand en fonction des fonctions sphériques zonales. Dans le deuxième chapitre, on rappellele théorème de Farahat et Higmann autour de la propriété de polynomialité des coefficients de structure du centre de l’algèbre du groupe symétriqueainsi que la preuve d’Ivanov et Kerov. On donne une preuvecombinatoire pour lapropriété de polynomialité des coefficients de structure de l’algèbre de Hecke de la paire (S2n, Bn) dans le troisième chapitre. On utilise dans notre preuve une algèbre universelle qui se projette sur l’algèbre de Hecke de la paire (S2n, Bn) pour tout n. On montre aussi que cette algèbre universelle est isomorphe à l’algèbre fonctions symétriques décalées d’ordre 2. Dans le dernier chapitre on présente un cadre général pour la forme des coefficients de structure dans le cas d’une suite des algèbres de doubles-classes.Ce cadre regroupe les propriétés de polynomialité des coefficients de structure du centre de l’algèbre du groupe symétrique et de l’algèbre de Hecke de la paire (S2n, Bn).De plus, on donne des propriétés de polynomialité pour les coefficients de structure du centre de l’algèbre du groupe hypéroctaédral et de l’algèbre de doubles-classes de diag (Sn-1) dans Sn x Sopp n-1.
- Published
- 2014
228. The site-perimeter of bargraphs
- Author
-
Andrew Rechnitzer, Mireille Bousquet-Mélou, Bousquet-Mélou, Mireille, Laboratoire Bordelais de Recherche en Informatique (LaBRI), and Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)
- Subjects
Difficult problem ,Discrete mathematics ,Mathematics::Combinatorics ,Polyomino ,Series (mathematics) ,Applied Mathematics ,[INFO.INFO-OH]Computer Science [cs]/Other [cs.OH] ,010102 general mathematics ,Generating function ,0102 computer and information sciences ,Computer Science::Computational Geometry ,01 natural sciences ,Column (database) ,[INFO.INFO-OH] Computer Science [cs]/Other [cs.OH] ,Perimeter ,Combinatorics ,010201 computation theory & mathematics ,Enumeration ,0101 mathematics ,Algebraic number ,Mathematics - Abstract
The site-perimeter enumeration of polyominoes that are both column- and row-convex is a well understood problem that always yields algebraic generating functions. Counting more general families of polyominoes is a far more difficult problem. Here we enumerate (by their site-perimeter) the simplest family of polyominoes that are not fully convex—bargraphs. The generating function we obtain is of a type that, to our knowledge, has never been encountered so far in the combinatorics literature: a q-series into which an algebraic series has been substituted.
- Published
- 2003
229. Permutations sortable by two stacks in parallel and quarter plane walks (conference version)
- Author
-
Michael Albert, Mireille Bousquet-Mélou, Department of Computer Science, University of Otago, University of Otago [Dunedin, Nouvelle-Zélande], Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), and Bousquet-Mélou, Mireille
- Subjects
[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO] ,Mathematics::Combinatorics ,[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] - Abstract
International audience; At the end of the 1960s, Knuth characterized in terms of forbidden patterns the permutations that can be sorted using a stack. He also showed that they are in bijection with Dyck paths and thus counted by the Catalan numbers. A few years later, Pratt and Tarjan asked about permutations that can be sorted using two stacks in parallel. This question is significantly harder. In particular, a sortable permutation can now be sorted by several distinct sequences of stack operations. Moreover, Pratt proved that in order to be sortable, a permutation must avoid infinitely many patterns. The associated counting question has remained open for 40 years. We solve it by giving a pair of equations that characterizes the generating function of permutations that can be sorted with two parallel stacks. The first component of this system describes the generating function $Q(a,u)$ of square lattice loops confined to the positive quadrant, counted by the length and the number of North-West and East-South factors. Our analysis of the asymptotic number of sortable permutations relies at the moment on two intriguing conjectures dealing with the series $Q(a,u)$. We prove that these conjectures hold for closed walks confined to the upper half-plane, or not confined at all. They remain open for quarter plane walks. Given the recent activity on walks confined to cones, we believe them to be attractive per se.
- Published
- 2014
230. Spanning forests in regular planar maps (conference version)
- Author
-
Mireille Bousquet-Mélou, Julien Courtiel, Bousquet-Mélou, Mireille, Laboratoire Bordelais de Recherche en Informatique (LaBRI), and Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)
- Subjects
Planar maps ,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO] ,[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] ,Exact and asymptotic enumeration ,Spanning forests - Abstract
International audience; We address the enumeration of $p$-valent planar maps equipped with a spanning forest, with a weight $z$ per face and a weight $u$ per component of the forest. Equivalently, we count regular maps equipped with a spanning tree, with a weight $z$ per face and a weight $\mu:=u+1$ per internally active edge, in the sense of Tutte. This enumeration problem corresponds to the limit $q \rightarrow 0$ of the $q$-state Potts model on the (dual) $p$-angulations. Our approach is purely combinatorial. The generating function, denoted by $F(z,u)$, is expressed in terms of a pair of series defined by an implicit system involving doubly hypergeometric functions. We derive from this system that $F(z,u)$ is $\textit{differentially algebraic}$, that is, satisfies a differential equation (in $z$) with polynomial coefficients in $z$ and $u$. This has recently been proved for the more general Potts model on 3-valent maps, but via a much more involved and less combinatorial proof. For $u \geq -1$, we study the singularities of $F(z,u)$ and the corresponding asymptotic behaviour of its $n^{\mathrm{th}}$ coefficient. For $u > 0$, we find the standard asymptotic behaviour of planar maps, with a subexponential factor $n^{-5/2}$. At $u=0$ we witness a phase transition with a factor $n^{-3}$. When $u \in[-1,0)$, we obtain an extremely unusual behaviour in $n^{-3}/(\log n)^2$. To our knowledge, this is a new ''universality class'' of planar maps.
- Published
- 2013
231. Counting planar maps, coloured or uncoloured
- Author
-
Mireille Bousquet-Mélou, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), and Bousquet-Mélou, Mireille
- Subjects
Discrete mathematics ,Mathematics::Combinatorics ,010102 general mathematics ,[PHYS.MPHY]Physics [physics]/Mathematical Physics [math-ph] ,Generating function ,01 natural sciences ,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO] ,Combinatorics ,010104 statistics & probability ,05A15, 05C30 ,Simple (abstract algebra) ,Functional equation ,[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] ,Bijection ,FOS: Mathematics ,Mathematics - Combinatorics ,Combinatorics (math.CO) ,0101 mathematics ,Tutte polynomial ,Algebraic number ,Bijection, injection and surjection ,Mathematics ,Potts model - Abstract
We present recent results on the enumeration of $q$-coloured planar maps, where each monochromatic edge carries a weight $\nu$. This is equivalent to weighting each map by its Tutte polynomial, or to solving the $q$-state Potts model on random planar maps. The associated generating function, obtained by Olivier Bernardi and the author, is differentially algebraic. That is, it satisfies a (non-linear) differential equation. The starting point of this result is a functional equation written by Tutte in 1971, which translates into enumerative terms a simple recursive description of planar maps. The proof follows and adapts Tutte's solution of properly $q$-coloured triangulations (1973-1984). We put this work in perspective with the much better understood enumeration of families of uncoloured planar maps, for which the recursive approach almost systematically yields algebraic generating functions. In the past 15 years, these algebraicity properties have been explained combinatorially by illuminating bijections between maps and families of plane trees. We survey both approaches, recursive and bijective. Comparing the coloured and uncoloured results raises the question of designing bijections for coloured maps. No complete bijective solution exists at the moment, but we present bijections for certain specialisations of the general problem. We also show that for these specialisations, Tutte's functional equation is much easier to solve that in the general case. We conclude with some open questions., Comment: 40 p
- Published
- 2011
232. Baxter permutations and plane bipolar orientations
- Author
-
Nicolas Bonichon, Eric Fusy, Mireille Bousquet-Mélou, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Department of Mathematics and Statistics [Fraser Valley], University College of the Fraser Valley (UFV), ANR-05-BLAN-0372,SADA,Structures aléatoires discrètes et algorithmes(2005), and Bousquet-Mélou, Mireille
- Subjects
0102 computer and information sciences ,01 natural sciences ,Combinatorics ,Planar ,Simple (abstract algebra) ,AMS 05A15 ,[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] ,FOS: Mathematics ,Discrete Mathematics and Combinatorics ,Mathematics - Combinatorics ,0101 mathematics ,Bipolar orientations ,ComputingMilieux_MISCELLANEOUS ,Mathematics ,Discrete mathematics ,Mathematics::Combinatorics ,Plane (geometry) ,Applied Mathematics ,010102 general mathematics ,Baxter permutation ,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO] ,010201 computation theory & mathematics ,Homogeneous space ,Bijection ,Combinatorics (math.CO) ,Symmetry (geometry) ,05A15 ,Baxter permutations - Abstract
We present a simple bijection between Baxter permutations of size $n$ and plane bipolar orientations with n edges. This bijection translates several classical parameters of permutations (number of ascents, right-to-left maxima, left-to-right minima...) into natural parameters of plane bipolar orientations (number of vertices, degree of the sink, degree of the source...), and has remarkable symmetry properties. By specializing it to Baxter permutations avoiding the pattern 2413, we obtain a bijection with non-separable planar maps. A further specialization yields a bijection between permutations avoiding 2413 and 3142 and series-parallel maps., Comment: 22 pages
- Published
- 2010
233. Counting coloured planar maps
- Author
-
Mireille Bousquet-Mélou, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), and Bousquet-Mélou, Mireille
- Subjects
Discrete mathematics ,Applied Mathematics ,010102 general mathematics ,0102 computer and information sciences ,01 natural sciences ,Combinatorics ,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO] ,Planar ,010201 computation theory & mathematics ,[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] ,Enumeration ,Discrete Mathematics and Combinatorics ,0101 mathematics ,Tutte polynomial ,ComputingMilieux_MISCELLANEOUS ,Mathematics - Abstract
International audience
- Published
- 2008
234. Decreasing subsequences in permutations and Wilf equivalence for involutions
- Author
-
Einar Steingrímsson, Mireille Bousquet-Mélou, Bousquet-Mélou, Mireille, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Department of Mathematics (MATHEMATICS), and Göteborgs Universitet (GU)-Chalmers tekniska hogskola
- Subjects
Pattern avoiding permutations ,prefix exchange ,Inverse ,0102 computer and information sciences ,MSC 05A15, 05E15 ,01 natural sciences ,Combinatorics ,Permutation ,Symmetric group ,Subsequence ,[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] ,FOS: Mathematics ,Discrete Mathematics and Combinatorics ,Mathematics - Combinatorics ,0101 mathematics ,Equivalence (formal languages) ,decreasing subsequences ,05A15, 05E15 ,ComputingMilieux_MISCELLANEOUS ,Mathematics ,Discrete mathematics ,Algebra and Number Theory ,Mathematics::Combinatorics ,010102 general mathematics ,Wilf equivalence ,Prefix ,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO] ,010201 computation theory & mathematics ,involutions ,Combinatorics (math.CO) - Abstract
International audience; In a recent paper, Backelin, West and Xin describe a map $\phi ^*$ that recursively replaces all occurrences of the pattern $k\cdots 21$ in a permutation $\sigma$ by occurrences of the pattern $(k-1)\cdots 21 k$. The resulting permutation $\phi^*(\sigma)$ contains no decreasing subsequence of length $k$. We prove that, rather unexpectedly, the map $\phi ^*$ commutes with taking the inverse of a permutation. In the BWX paper, the definition of $\phi^*$ is actually extended to full rook placements on a Ferrers board (the permutations correspond to square boards), and the construction of the map $\phi^*$ is the key step in proving the following result. Let $T$ be a set of patterns starting with the prefix $12\cdots k$. Let $T'$ be the set of patterns obtained by replacing this prefix by $k\cdots 21$ in every pattern of $T$. Then for all $n$, the number of permutations of the symmetric group $\Sn_n$ that avoid $T$ equals the number of permutations of $\Sn_n$ that avoid $T'$. Our commutation result, generalized to Ferrers boards, implies that the number of {\em involutions\/} of $\Sn_n$ that avoid $T$ is equal to the number of involutions of $\Sn_n$ avoiding $T'$, as recently conjectured by Jaggard.
- Published
- 2005
235. Walks confined in a quadrant are not always D-finite
- Author
-
Marko Petkovšek, Mireille Bousquet-Mélou, Bousquet-Mélou, Mireille, Laboratoire Bordelais de Recherche en Informatique (LaBRI), and Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)
- Subjects
General Computer Science ,Differential equation ,[INFO.INFO-OH]Computer Science [cs]/Other [cs.OH] ,010102 general mathematics ,05A15 (primary) ,0102 computer and information sciences ,16. Peace & justice ,Random walk ,01 natural sciences ,Square lattice ,Quadrant (plane geometry) ,Theoretical Computer Science ,Combinatorics ,[INFO.INFO-OH] Computer Science [cs]/Other [cs.OH] ,Linear differential equation ,010201 computation theory & mathematics ,FOS: Mathematics ,Mathematics - Combinatorics ,Combinatorics (math.CO) ,Polynomial coefficients ,0101 mathematics ,Combinatorial method ,Linear equation ,Mathematics ,Computer Science(all) - Abstract
We consider planar lattice walks that start from a prescribed position, take their steps in a given finite subset of Z^2, and always stay in the quadrant x >= 0, y >= 0. We first give a criterion which guarantees that the length generating function of these walks is D-finite, that is, satisfies a linear differential equation with polynomial coefficients. This criterion applies, among others, to the ordinary square lattice walks. Then, we prove that walks that start from (1,1), take their steps in {(2,-1), (-1,2)} and stay in the first quadrant have a non-D-finite generating function. Our proof relies on a functional equation satisfied by this generating function, and on elementary complex analysis., To appear in Theoret. Comput. Sci. (special issue devoted to random generation of combinatorial objects and bijective combinatorics)
- Published
- 2002
236. Philippe flajolet, the father of analytic combinatorics
- Author
-
Wojciech Szpankowski, Brigitte Vallée, Bruno Salvy, Michèle Soria, Bob Sedgewick, Algorithms (ALGORITHMS), Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Computer Science Department [Princeton], Princeton University, Algorithmes, Programmes et Résolution (APR), Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Department of Computer Science [Purdue], Purdue University [West Lafayette], Equipe AMACC - Laboratoire GREYC - UMR6072, Groupe de Recherche en Informatique, Image et Instrumentation de Caen (GREYC), Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Ingénieurs de Caen (ENSICAEN), Normandie Université (NU)-Normandie Université (NU)-Université de Caen Normandie (UNICAEN), Normandie Université (NU)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Ingénieurs de Caen (ENSICAEN), Normandie Université (NU), Bousquet-Mélou, Mireille, Wachs, Michelle, Hultman, Axel, Université de Caen Normandie (UNICAEN), Normandie Université (NU)-Normandie Université (NU)-École Nationale Supérieure d'Ingénieurs de Caen (ENSICAEN), Normandie Université (NU)-Centre National de la Recherche Scientifique (CNRS)-Université de Caen Normandie (UNICAEN), and Normandie Université (NU)-Centre National de la Recherche Scientifique (CNRS)
- Subjects
General Computer Science ,media_common.quotation_subject ,02 engineering and technology ,[MATH] Mathematics [math] ,0102 computer and information sciences ,[INFO] Computer Science [cs] ,01 natural sciences ,Prime (order theory) ,Theoretical Computer Science ,Combinatorics ,Mathematics (miscellaneous) ,0202 electrical engineering, electronic engineering, information engineering ,Discrete Mathematics and Combinatorics ,[INFO]Computer Science [cs] ,[MATH]Mathematics [math] ,media_common ,Mathematics ,Taste (sociology) ,obituary ,General Medicine ,Obituary ,Epistemology ,Algebra ,010201 computation theory & mathematics ,Curiosity ,Analytic combinatorics ,020201 artificial intelligence & image processing ,Algorithm ,Philippe Flajolet ,Computer Science(all) - Abstract
Philippe Flajolet, mathematician and computer scientist extraordinaire, suddenly passed away on March 22, 2011, at the prime of his career. He is celebrated for opening new lines of research in analysis of algo- rithms, developing powerful new methods, and solving difficult open problems. His research contributions will have impact for generations, and his approach to research, based on curiosity, a discriminating taste, broad knowledge and interest, intellectual integrity, and a genuine sense of camaraderie, will serve as an inspiration to those who knew him for years to come
- Published
- 2011
237. Codes pour les communications sans-fil multi-antennes : bornes et constructions
- Author
-
CREIGNOU, Jean, Bachoc, Christine, Belfiore, Jean-Claude, Bousquet-Mélou, Mireille, Solé, Patrick, Zémor, Gilles, Boutros, Joseph J., and Barg, Alexander
- Subjects
constructions ,Grassmannian ,Grassmanniens ,Bornes ,codes ,Matrices unitaires ,unitary matrices ,MIMO ,division algebra ,Wireless ,Télécommunications ,bounds ,Sans fils ,Algèbre à division
238. (2+2)-free posets, ascent sequences and pattern avoiding permutations
- Author
-
Mireille Bousquet-Mélou, Anders Claesson, Mark Dukes, Sergey Kitaev, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), The Mathematics Institute, Reyjavik University (School of Computer Science), Reykjavík University, Science Institute, University of Iceland, University of Iceland [Reykjavik], ANR-05-BLAN-0372,SADA,Structures aléatoires discrètes et algorithmes(2005), Bousquet-Mélou, Mireille, and Programme non thématique - Appel à projets de recherche - Structures aléatoires discrètes et algorithmes - - SADA2005 - ANR-05-BLAN-0372 - BLANC - VALID
- Subjects
Involution ,Mathematics::Combinatorics ,bijections ,Ascent sequence ,Encode ,enumeration ,Chord diagram ,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO] ,(2+2)-free poset ,pattern-avoiding permutations ,[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] ,FOS: Mathematics ,Mathematics - Combinatorics ,2+2-free posets ,Combinatorics (math.CO) ,05A15 ,Pattern avoiding permutation ,Non-D-finite series ,Enumerate - Abstract
International audience; We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2+2)-free posets and a certain class of involutions (or chord diagrams), already appeared in the literature, but were apparently not known to be equinumerous. We present a direct bijection between them. The third class is a family of permutations defined in terms of a new type of pattern. An attractive property of these patterns is that, like classical patterns, they are closed under the action of D_8, the symmetry group of the square. The fourth class is formed by certain integer sequences, called ascent sequences, which have a simple recursive structure and are shown to encode (2+2)-free posets and permutations. Our bijections preserve numerous statistics. We determine the generating function of these classes of objects, thus recovering a non-D-finite series obtained by Zagier for the class of chord diagrams. Finally, we characterize the ascent sequences that correspond to permutations avoiding the barred pattern 3{\bar 1}52{\bar 4} and use this to enumerate those permutations, thereby settling a conjecture of Pudwell.
239. Self-avoiding walks crossing a square
- Author
-
Mireille Bousquet-Mélou, Iwan Jensen, Anthony J. Guttmann, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Bousquet-Mélou, Mireille, ARC Centre of Excellence for Mathematics and Statistics of Complex Systems, Department of Mathematics and Statistics, and University of Melbourne
- Subjects
Phase transition ,[INFO.INFO-OH]Computer Science [cs]/Other [cs.OH] ,General Physics and Astronomy ,FOS: Physical sciences ,Lambda ,01 natural sciences ,Upper and lower bounds ,Self-avoiding walks ,Combinatorics ,symbols.namesake ,[PHYS.COND.CM-SM] Physics [physics]/Condensed Matter [cond-mat]/Statistical Mechanics [cond-mat.stat-mech] ,Lattice (order) ,0103 physical sciences ,[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] ,FOS: Mathematics ,Mathematics - Combinatorics ,0101 mathematics ,[PHYS.COND.CM-SM]Physics [physics]/Condensed Matter [cond-mat]/Statistical Mechanics [cond-mat.stat-mech] ,010306 general physics ,Condensed Matter - Statistical Mechanics ,Mathematical Physics ,ComputingMilieux_MISCELLANEOUS ,Physics ,Statistical Mechanics (cond-mat.stat-mech) ,010102 general mathematics ,Statistical and Nonlinear Physics ,Square lattice ,[INFO.INFO-OH] Computer Science [cs]/Other [cs.OH] ,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO] ,Exact results ,symbols ,Combinatorics (math.CO) ,Hamiltonian (quantum mechanics) - Abstract
We study a restricted class of self-avoiding walks (SAW) which start at the origin (0, 0), end at $(L, L)$, and are entirely contained in the square $[0, L] \times [0, L]$ on the square lattice ${\mathbb Z}^2$. The number of distinct walks is known to grow as $\lambda^{L^2+o(L^2)}$. We estimate $\lambda = 1.744550 \pm 0.000005$ as well as obtaining strict upper and lower bounds, $1.628 < \lambda < 1.782.$ We give exact results for the number of SAW of length $2L + 2K$ for $K = 0, 1, 2$ and asymptotic results for $K = o(L^{1/3})$. We also consider the model in which a weight or {\em fugacity} $x$ is associated with each step of the walk. This gives rise to a canonical model of a phase transition. For $x < 1/\mu$ the average length of a SAW grows as $L$, while for $x > 1/\mu$ it grows as $L^2$. Here $\mu$ is the growth constant of unconstrained SAW in ${\mathbb Z}^2$. For $x = 1/\mu$ we provide numerical evidence, but no proof, that the average walk length grows as $L^{4/3}$. We also consider Hamiltonian walks under the same restriction. They are known to grow as $\tau^{L^2+o(L^2)}$ on the same $L \times L$ lattice. We give precise estimates for $\tau$ as well as upper and lower bounds, and prove that $\tau < \lambda.$, Comment: 27 pages, 9 figures. Paper updated and reorganised following refereeing
240. Lattice animals and heaps of dimers
- Author
-
Andrew Rechnitzer, Mireille Bousquet-Mélou, Bousquet-Mélou, Mireille, Laboratoire Bordelais de Recherche en Informatique (LaBRI), and Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)
- Subjects
Lattice animals ,Enumeration ,Algebraic series ,[INFO.INFO-OH]Computer Science [cs]/Other [cs.OH] ,0102 computer and information sciences ,01 natural sciences ,Theoretical Computer Science ,Combinatorics ,Exponential growth ,Lattice (order) ,Discrete Mathematics and Combinatorics ,Hexagonal lattice ,D-finite series ,0101 mathematics ,Algebraic number ,Mathematics ,Discrete mathematics ,Mathematics::Combinatorics ,010102 general mathematics ,Generating function ,Directed animals ,Generating functions ,[INFO.INFO-OH] Computer Science [cs]/Other [cs.OH] ,010201 computation theory & mathematics ,Bijection ,Transcendental number - Abstract
The general quest ofthis paper is the search f or new classes ofsquare lattice animals that are both large and exactly enumerable. The starting point is a bijection between a subclass ofanimals, called directed animals, and certain heaps of dimers, called pyramids, which was described by Viennot more than 10 years ago. The generating function for directed animals had been known since 1982, but Viennot’s bijection suggested a new approach that greatly simpli7ed its derivation. We de7ne here two natural classes ofheaps that are supersets ofpyramids and are in bijection with certain classes ofanimals, and we enumerate them exactly. The 7rst class has an algebraic generating function and growth constant 3:5 (meaning that the number of n-celled animals grows like 3:5 n ), while the other has a transcendental non-holonomic generating function and growth constant 3:58 ::: :The generating function for directed animals is algebraic, and has growth constant 3. Hence both these new classes are exponentially larger. We obtain similar results for triangular lattice animals. c 2002 Elsevier Science B.V. All rights reserved.
241. Four classes of pattern-avoiding permutations under one roof: generating trees with two labels
- Author
-
Mireille Bousquet-Mélou, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), and Bousquet-Mélou, Mireille
- Subjects
Series (mathematics) ,Applied Mathematics ,010102 general mathematics ,[INFO.INFO-OH]Computer Science [cs]/Other [cs.OH] ,Generating function ,0102 computer and information sciences ,01 natural sciences ,Theoretical Computer Science ,[INFO.INFO-OH] Computer Science [cs]/Other [cs.OH] ,Combinatorics ,Computational Theory and Mathematics ,Integer ,010201 computation theory & mathematics ,Simple (abstract algebra) ,Functional equation ,Discrete Mathematics and Combinatorics ,Geometry and Topology ,Tree (set theory) ,0101 mathematics ,Algebraic number ,Tutte polynomial ,Mathematics - Abstract
Many families of pattern-avoiding permutations can be described by a generating tree in which each node carries one integer label, computed recursively via a rewriting rule. A typical example is that of $123$-avoiding permutations. The rewriting rule automatically gives a functional equation satisfied by the bivariate generating function that counts the permutations by their length and the label of the corresponding node of the tree. These equations are now well understood, and their solutions are always algebraic series. Several other families of permutations can be described by a generating tree in which each node carries two integer labels. To these trees correspond other functional equations, defining 3-variate generating functions. We propose an approach to solving such equations. We thus recover and refine, in a unified way, some results on Baxter permutations, $1234$-avoiding permutations, $2143$-avoiding (or: vexillary) involutions and $54321$-avoiding involutions. All the generating functions we obtain are D-finite, and, more precisely, are diagonals of algebraic series. Vexillary involutions are exceptionally simple: they are counted by Motzkin numbers, and thus have an algebraic generating function. In passing, we exhibit an interesting link between Baxter permutations and the Tutte polynomial of planar maps.
242. Walks and animals: applications of the theory of heaps of pieces
- Author
-
Bacher, Axel, Bousquet-Mélou, Mireille, Di Francesco, Philippe, Viennot, Xavier Gérard, Schaeffer, Gilles, Gouyou-Beauchamps, Dominique, and Bacher, Axel
- Subjects
[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO] ,heaps of pieces ,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM] ,Chemins auto-évitants ,generating functions ,Combinatoire énumérative ,analytic combinatorics ,Combinatoire analytique ,enumerative combinatorics ,Animaux ,séries génératrices ,Empilements de pièces - Abstract
The goal of this thesis is to establish enumerative results on several classes of paths and animals. These results are applications of the theory of heaps of pieces developed by Viennot. We study discrete excursions (or generalized Dyck paths) with bounded height; we obtain combinatorial interpretations and extensions of results from Banderier, Flajolet and Bousquet-Mélou. We describe and enumerate several subclasses of self-avoiding walks (SAW), called weakly directed walks. These classes are larger than the class of prudent walks, which is the largest natural subclass of SAW enumerated so far. We compute the average site perimeter of directed animals, proving conjectures from Conway and Le Borgne. Finally, we obtain new results on the enumeration of Klarner animals and multi-directed animals defined by Bousquet-Mélou and Rechnitzer., Le but de cette thèse est d'établir des résultats énumératifs sur certaines classes de chemins et d'animaux. Ces résultats sont obtenus en appliquant la théorie des empilements de pièces développée par Viennot. Nous étudions les excursions discrètes (ou chemins de Dyck généralisés) de hauteur bornée; nous obtenons des interprétations combinatoires et des extensions de résultats de Banderier, Flajolet et Bousquet-Mélou. Nous décrivons et énumérons plusieurs classes de chemins auto-évitants, dits chemins faiblement dirigés. Ces chemins sont plus nombreux que les chemins prudents qui forment la classe naturelle la plus grande jusqu'alors. Nous calculons le périmètre de site moyen des animaux dirigés, prouvant des conjectures de Conway et Le Borgne. Enfin, nous obtenons des résultats nouveaux sur l'énumération des animaux de Klarner et les animaux multi-dirigés de Bousquet-Mélou et Rechnitzer.
243. Combinatorics of the Tutte polynomial and planar maps
- Author
-
Courtiel, Julien, Bousquet-Mélou, Mireille, Boutier, Jérémie, Cori, Robert, Salvy, Bruno, Bassino, Frédérique, Schaeffer, Gilles, Noy, Marc, and Courtiel, Julien
- Subjects
Planar maps ,Algébricité différentielle ,Forêts couvrantes ,Combinatoire énumérative ,Comportement asymptotique ,Spanning forests ,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO] ,Tutte polynomial ,Activités ,Differentially algebraic ,[INFO.INFO-NA] Computer Science [cs]/Numerical Analysis [cs.NA] ,Cartes planaires ,Asymptotic behaviours ,Polynôme de Tutte ,Enumerative combinatorics ,Activities - Abstract
This thesis deals with the Tutte polynomial, studied from different points of view. In the first part, we address the enumeration of planar maps equipped with a spanning forest, here called forested maps, with a weight z per face and a weight u per non-root component of the forest. Equivalently, we count (with respect to the number of faces) the planar maps C weighted by TC(u + 1; 1), where TC is the Tutte polynomial of C.We begin by a purely combinatorial characterization of the corresponding generating function, denoted by F(z; u). We deduce from this that F(z; u) is differentially algebraic in z, that is, satisfies a polynomial differential equation in z. Finally, for u ≥ -1, we study the asymptotic behaviour of the nth coefficient of F(z; u).We observe a phase transition at 0, with a very unusual regime in n-3 ln-2(n) for u ϵ [-1; 0[, which testifiesa new universality class for planar maps. In the second part, we propose a framework unifying the notions of activity used in the literature to describe the Tutte polynomial. The new notion of activity thereby defined is called Δ-activity. It gathers all the notions of activities that were already known and has nice properties, as Crapo’s property that defines a partition of the lattice of the spanning subgraphs into intervals with respect to the activity. Lastly we conjecture that every activity that describes the Tutte polynomial and that satisfies Crapo’s property can be defined in terms of Δ-activity., Cette thèse porte sur le polynôme de Tutte, étudié selon différents points de vue. Dans une première partie, nous nous intéressons à l’énumération des cartes planaires munies d’une forêt couvrante, ici appelées cartes forestières, avec un poids z par face et un poids u par composante non racine de la forêt. De manière équivalente, nous comptons selon le nombre de faces les cartes planaires C pondérées par TC(u + 1; 1), où TC désigne le polynôme de Tutte de C. Nous commençons par une caractérisation purement combinatoire de la série génératrice correspondante, notée F(z; u). Nous en déduisons que F(z; u) est différentiellement algébrique en z, c’est-à-dire que F satisfait une équation différentielle polynomiale selon z. Enfin, pour u ≥ -1, nous étudions le comportement asymptotique du n-ième coefficient de F(z; u). Nous observons une transition de phase en 0, avec notamment un régime très atypique en n-3 ln-2(n) pour u ϵ [-1; 0[, témoignant d’une nouvelle classe d’universalité pour les cartes planaires. Dans une seconde partie, nous proposons un cadre unificateur pour les différentes notions d’activités utilisées dans la littérature pour décrire le polynôme de Tutte.La nouvelle notion d’activité ainsi définie est appelée Δ-activité. Elle regroupe toutes les notions d’activité déjà connues et présente de belles propriétés, comme celle de Crapo qui définit une partition (adaptée à l’activité) du treillis des sous-graphes couvrants en intervalles. Nous conjecturons en dernier lieu que toute activité qui décrit le polynôme de Tutte et qui satisfait la propriété susmentionnée de Crapo peut être définie en termes de Δ-activités.
244. Polynomial invariants and algebraic structures of combinatorial objects
- Author
-
Karaboghossian, Théo, Tanasa, Adrian, Aval, Jean-Christophe, Novelli, Jean-Christophe, Bergeron, Nantel, Chapoton, Frédéric, Pons, Viviane, Bousquet-Mélou, Mireille, STAR, ABES, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Université de Bordeaux, Adrian Tanasa, and Jean-Christophe Aval
- Subjects
Combinatoire algébrique ,Monoïdes de Hopf ,Hypergraphes ,Hopf monoids ,[MATH.MATH-AT] Mathematics [math]/Algebraic Topology [math.AT] ,[INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG] ,Hypergraphs ,Opérades ,[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG] ,Graphes ,Invariants polynomial ,[MATH.MATH-AT]Mathematics [math]/Algebraic Topology [math.AT] ,Mathematics::Quantum Algebra ,Mathematics::Category Theory ,Algebraic combinatorics ,Operads ,Polynomial invariants ,Graphs - Abstract
In the first half of this dissertation, we study the polynomial invariants defined by Aguiar and Ardila in arXiv:1709.07504 in the context of Hopf monoids. We first give a combinatorial interpretation of these polynomials over the Hopf monoids of generalized permutahedra and hypergraphs in both non negative and negative integers. We then use them to deduce similar interpretation on other combinatorial objects(graphs, simplicial complexes, building sets, etc).In the second half of this disseration, we propose a new way of defining and studying operads on multigraphs and similar objects.We study in particular two operads obtained with our method. The former is a direct generalization of the Kontsevich-Willwacher operad.This operad can be seen as a canonical operad on multigraphs,and has many interesting suboperads.The latter operad is a natural extension of the pre-Lie operad in a sense developed here and it is related to the multigraph operad. We also present various results on some of the finitely generated suboperads of the multigraph operad and establish links between them and the commutative operad and the commutative magmatic operad., Dans la première moitié de ce mémoire, nous étudions les invariants polynomiaux définis par Aguiar et Ardila dans arXiv:1709.07504 dans le contexte des monoïdes de Hopf. Nous donnons d'abord une interprétation combinatoire de ces polynômes pour les monoïdes de Hopf des permutaèdres généralisés et des hypergraphes,sur les entiers naturels et négatifs. Nous en déduisons ensuite des interprétations similaires sur d'autres objets combinatoires(graphes, complexes simpliciaux, building sets, etc).Dans la seconde moitié de ce mémoire, nous proposons une nouvelle façon de définir et d'étudier des opérades de multigraphes et d'objets similaires.Nous étudions en particulier deux opérades obtenues avec cette méthode. La première est une généralisation directe de l'opérade Kontsevich-Willwacher,qui peut être considérée comme une opérade canonique sur les multigraphes et possède de nombreuses sous-opérades intéressantes.La seconde est une extension naturelle de l'opérade pré-Lie et a aussi un lien avec l'opérade précédente.Nous présentons également divers résultats sur certaines sous-opérades finiment enegendrées et établissons des liens entre elles et les opérades commutative et commutative magmatique.
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.