English
Related papers

Related papers: Recurrence of bipartite planar maps

200 papers

Bipolar orientations of planar maps have recently attracted some interest in combinatorics, probability theory and theoretical physics. Plane bipolar orientations with $n$ edges are known to be counted by the $n$th Baxter number $b(n)$,…

Combinatorics · Mathematics 2021-02-26 Mireille Bousquet-Mélou , Éric Fusy , Kilian Raschel

We discuss asymptotics for large random planar maps under the assumption that the distribution of the degree of a typical face is in the domain of attraction of a stable distribution with index $\alpha\in(1,2)$. When the number $n$ of…

Probability · Mathematics 2017-08-23 Jean-François Le Gall , Grégory Miermont

We discuss the scaling limit of large planar quadrangulations with a boundary whose length is of order the square root of the number of faces. We consider a sequence $(\sigma_n)$ of integers such that $\sigma_n/\sqrt{2n}$ tends to some…

Probability · Mathematics 2013-09-17 Jérémie Bettinelli

We present a general bijective approach to planar hypermaps with two main results. First we obtain unified bijections for all classes of maps or hypermaps defined by face-degree constraints and girth constraints. To any such class we…

Combinatorics · Mathematics 2019-06-14 Olivier Bernardi , Eric Fusy

We establish sharp bounds for simultaneous local rotation and H\"older-distortion of planar quasiconformal maps. In addition, we give sharp estimates for the corresponding joint quasiconformal multifractal spectrum, based on new estimates…

Complex Variables · Mathematics 2015-08-24 Kari Astala , Tadeusz Iwaniec , István Prause , Eero Saksman

We study the geometry of infinite random Boltzmann planar maps with vertices of high degree. These correspond to the duals of the Boltzmann maps associated to a critical weight sequence $(q_{k})_{ k \geq 0}$ for the faces with polynomial…

Probability · Mathematics 2017-04-20 Timothy Budd , Nicolas Curien

In this article bipartite planar graphs St_r are investigated, r the number of their plane regions. Bounds for the graded Betti numbers and the projective dimension of the quotient ring associated to such graphs are discussed. We prove that…

Commutative Algebra · Mathematics 2024-04-01 Maurizio Imbesi , Monica La Barbiera

Our original results refer to multivariate recurrences: discrete multitime diagonal recurrence, bivariate recurrence, trivariate recurrence, solutions tailored to particular situations, second order multivariate recurrences, characteristic…

Dynamical Systems · Mathematics 2015-06-16 Cristian Ghiu , Raluca Tuliga , Constantin Udriste , Ionel Tevy

The main result of this paper is that the polytope of the bipartite TSP is significantly different from that of the general TSP. Comb inequalities are known as facet defining ones in the general case. In the bipartite case, however, many of…

Combinatorics · Mathematics 2017-04-03 Gergely Kovács , Zsolt Tuza , Béla Vizvári , Hajie K. Jabbari

Many questions about triangles and quadrilaterals with rational sides, diagonals and areas can be reduced to solving certain Diophantine equations. We look at a number of such questions including the question of approximating arbitrary…

Number Theory · Mathematics 2017-05-08 C. P. Anil Kumar

In this paper, we show that the resonance graph of a plane elementary bipartite graph $G$ can be obtained from an edge by a sequence of peripheral convex expansions with respect to a reducible face decomposition of $G$ if and only if the…

Combinatorics · Mathematics 2019-08-27 Zhongyuan Che

Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…

Group Theory · Mathematics 2009-05-08 M. J. Dunwoody

We construct an explicit bijection between bipartite pointed maps of an arbitrary surface $\mathbb{S}$, and specific unicellular blossoming maps of the same surface. Our bijection gives access to the degrees of all the faces, and distances…

Combinatorics · Mathematics 2022-08-02 Maciej Dołęga , Mathias Lepoutre

We consider a class of doubly intermittent maps with critical points, unbounded derivative and regularly varying tails. Under some mild assumptions we prove the existence of a unique mixing absolutely continuous invariant measure and give…

Dynamical Systems · Mathematics 2024-09-18 Muhammad Mubarak , Tanja I. Schindler

We unify and extend previous bijections on plane quadrangulations to bipartite and quasibipartite plane maps. Starting from a bipartite plane map with a distinguished edge and two distinguished corners (in the same face or in two different…

Combinatorics · Mathematics 2018-12-21 Jérémie Bettinelli

A graph $G=(V,E)$ is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite $1$-planar graphs with prescribed numbers of vertices in partite sets. Bipartite…

Combinatorics · Mathematics 2015-03-05 Július Czap , Jakub Przybyło , Erika Škrabuľáková

This paper provides uniform bounds on the asymptotic regularity for iterations associated to a finite family of nonexpansive mappings. We obtain our quantitative results in the setting of $(r,\delta)$-convex spaces, a class of geodesic…

Functional Analysis · Mathematics 2013-09-17 Laurentiu Leustean , Adriana Nicolae

Planar polynomial automorphisms are polynomial maps of the plane whose inverse is also a polynomial map. A map is reversible if it is conjugate to its inverse. Here we obtain a normal form for automorphisms that are reversible by an…

Chaotic Dynamics · Physics 2010-06-22 A. Gomez , J. D. Meiss

A planar hypermap with a boundary is defined as a planar map with a boundary, endowed with a proper bicoloring of the inner faces. The boundary is said alternating if the colors of the incident inner faces alternate along its contour. In…

Combinatorics · Mathematics 2021-07-21 Jérémie Bouttier , Ariane Carrance

We consider the algorithmic complexity of recognizing bipartite temporal graphs. Rather than defining these graphs solely by their underlying graph or individual layers, we define a bipartite temporal graph as one in which every layer can…

Computational Complexity · Computer Science 2021-11-18 Till Fluschnik , Pascal Kunz