English
Related papers

Related papers: Bipolar orientations on planar maps and SLE$_{12}$

200 papers

We prove a general Russo-Seymour-Welsh result valid for any invariant planar percolation process satisfying positive association. This means that the probability of crossing a rectangle in the long direction is related by a homeomorphism to…

Probability · Mathematics 2020-11-10 Laurin Köhler-Schindler , Vincent Tassion

We show that a large class of site percolation processes on any planar graph contains either zero or infinitely many infinite connected components. The assumptions that we require are: tail triviality, positive association (FKG) and that…

Probability · Mathematics 2026-04-21 Alexander Glazman , Matan Harel , Nathan Zelesko

We consider a random planar map $M_n$ which is uniformly distributed over the class of all rooted q-angulations with n faces. We let $\mathbf{m}_n$ be the vertex set of $M_n$, which is equipped with the graph distance $d_\mathrm{gr}$. Both…

Probability · Mathematics 2013-07-26 Jean-François Le Gall

The randomly oriented graph $G_{n,p}^{\sigma}$ is an Erd\H{o}s-R\'enyi random graph $G_{n,p}$ with a random orientation $\sigma$, which assigns to each edge a direction so that $G_{n,p}^{\sigma}$ becomes a directed graph. Denote by $S_n$…

Combinatorics · Mathematics 2018-09-05 Yilun Shang

In this article we provide a classification and description of compact Riemann surfaces admitting a triangular action of a group of order $2p^2,$ where $p$ is an odd prime number. We obtain that all such Riemann surfaces are isomorphic to…

Algebraic Geometry · Mathematics 2026-05-27 Sebastián Reyes-Carocca , Yazmin Rivera Nene

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 conjecture a relationship between the scaling limit of the fixed-length ensemble of self-avoiding walks in the upper half plane and radial SLE with kappa=8/3 in this half plane from 0 to i. The relationship is that if we take a curve…

Probability · Mathematics 2015-05-27 Tom Kennedy

We study codimension-two spacelike submanifolds in Lorentzian spacetimes that admit umbilical lightlike normal directions. We show that such submanifolds are subject to strong geometric and topological constraints, establishing explicit…

Differential Geometry · Mathematics 2025-06-26 Juan S. Gómez

We consider the ideal orientation problem in planar graphs. In this problem, we are given an undirected graph $G$ with positive edge lengths and $k$ pairs of distinct vertices $(s_1, t_1), \dots, (s_k, t_k)$ called terminals, and we want to…

Data Structures and Algorithms · Computer Science 2019-12-04 Yipu Wang

We extend the peeling exploration introduced in arxiv:1506.01590 to the setting of Boltzmann planar maps coupled to a rigid $O(n)$ loop model. Its law is related to a class of discrete Markov processes obtained by confining random walks to…

Probability · Mathematics 2018-09-07 Timothy Budd

We prove some asymptotic results for the radius and the profile of large random rooted planar maps with faces of arbitrary degrees. Using a bijection due to Bouttier, Di Francesco and Guitter between rooted planar maps and certain four-type…

Probability · Mathematics 2007-06-25 Grégory Miermont , Mathilde Weill

An edge-biregular map arises as a smooth normal quotient of a unique index-two subgroup of a full triangle group acting with two edge-orbits. We give a classification of all finite edge-biregular maps on surfaces of negative prime Euler…

Combinatorics · Mathematics 2021-03-08 Olivia Jeans , Jozef Širáň

Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…

Combinatorics · Mathematics 2020-07-21 Stefan Felsner , Clemens Huemer , Sarah Kappes , David Orden

The problem of orienting the edges of an undirected graph such that the resulting digraph is acyclic and has a single source s and a single sink t has a long tradition in graph theory and is central to many graph drawing algorithms. Such an…

Data Structures and Algorithms · Computer Science 2022-08-25 Carla Binucci , Walter Didimo , Maurizio Patrignani

We determine local topological types of binary differential equations of asymptotic curves at parabolic and flat umbilical points for generic $2$-parameter families of surfaces in $\mathbb P^3$ by comparing our projective classification of…

Differential Geometry · Mathematics 2017-08-21 Jorge Luiz Deolindo Silva , Yutaro Kabata , Toru Ohmoto

We consider random genus-0 hyperbolic surfaces $\mathcal{S}_n$ with $n + 1$ punctures, sampled according to the Weil-Petersson measure. We show that, after rescaling the metric by $n^{-1/4}$, the surface $\mathcal{S}_n$ converges in…

Probability · Mathematics 2025-08-27 Timothy Budd , Nicolas Curien

We study the relations between pin structures on a non-orientable even-dimensional manifold, with or without boundary, and pin structures on its orientable double cover, requiring the latter to be invariant under sheet-exchange. We show…

Mathematical Physics · Physics 2012-04-11 Loriano Bonora , Fabio Ferrari Ruffino , Raffaele Savelli

Recall that an excedance of a permutation $\pi$ is any position $i$ such that $\pi_i > i$. Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it…

Combinatorics · Mathematics 2021-01-05 Arvind Ayyer , Daniel Hathcock , Prasad Tetali

We investigate the iterative behaviour of continuous order preserving subhomogeneous maps that map a polyhedral cone into itself. For these maps we show that every bounded orbit converges to a periodic orbit and, moreover, that there exists…

Dynamical Systems · Mathematics 2007-05-23 Marianne Akian , Stephane Gaubert , Bas Lemmens , Roger Nussbaum

In 1990, Schnyder used a 3-spanning-tree decomposition of a simple triangulation, now known as the Schnyder wood, to give a fundamental grid-embedding algorithm for planar maps. In the framework of mating of trees, a uniformly sampled…

Probability · Mathematics 2022-12-26 Yiting Li , Xin Sun , Samuel S. Watson