Related papers: Recurrence of bipartite planar maps
In this paper we give a combinatorial description of the renormlization limits of infinitely renormalizable unimodal maps with {\it essentially bounded} combinatorics admitting quadratic-like complex extensions. As an application we…
It is well-known (see Dvoretzky, Erd{\H o}s and Kakutani [8] and Le Gall [12]) that a planar Brownian motion $(B_t)_{t\ge 0}$ has points of infinite multiplicity, and these points form a dense set on the range. Our main result is the…
We compute the limit shape for several classes of restricted integer partitions, where the restrictions are placed on the part sizes rather than the multiplicities. Our approach utilizes certain classes of bijections which map limit shapes…
Beyond-planarity focuses on combinatorial properties of classes of non-planar graphs that allow for representations satisfying certain local geometric or topological constraints on their edge crossings. Beside the study of a specific graph…
We prove that every 2-local automorphism of the unitary group or the general linear group on a complex infinite-dimensional separable Hilbert space is an automorphism. Thus these types of transformations are completely determined by their…
The problem of bi-equivariant extension of continuous maps of binary $G$-spaces is considered. The concept of a structural map of distributive binary $G$-spaces is introduced, and a theorem on the bi-equivariant extension of structural maps…
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…
We study straight-line drawings of planar graphs with prescribed face areas. A plane graph is 'area-universal' if for every area assignment on the inner faces, there exists a straight-line drawing realizing the prescribed areas. For…
For Young systems, i.e. for hyperbolic systems without/with singularities satisfying Lai-Sang Young's axioms (which imply exponential decay of correlation and the CLT) a local CLT is proven. In fact, a unified version of the local CLT is…
We exhibit an analogy between the problem of pushing forward measurable sets under measure preserving maps and linear relaxations in combinatorialoptimization. We show how invariance of hyperfiniteness of graphings under local isomorphism…
Every indefinite binary form occurs as the Picard lattice of some K3-surface. The group of its isometries, or automorphs, coincides with the automorphism group of the K3-surface, but only up to finite groups. The classical theory of…
We study a free boundary problem on the lattice whose scaling limit is a harmonic free boundary problem with a discontinuous Hamiltonian. We find an explicit formula for the Hamiltonian, prove the solutions are unique, and prove that the…
An area-preserving homeomorphism isotopic to the identity is said to have rational rotation direction if its rotation vector is a real multiple of a rational class. We give a short proof that any area-preserving homeomorphism of a compact…
The purpose of this paper is to study the limiting distribution of special {\it additive functionals} on random planar maps, namely the number of occurrences of a given {\it pattern}. The main result is a central limit theorem for these…
Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with respect to some local forbidden crossing configurations.…
We study the invariants of arbitrary dimensional multipartite quantum states under local unitary transformations. For multipartite pure states, we give a set of invariants in terms of singular values of coefficient matrices. For…
The main goal of this paper is to determine the asymptotic behavior of the number $X_n$ of cut-vertices in random planar maps with $n$ edges. It is shown that $X_n/n \to c$ in probability (for some explicit $c>0$). For so-called subcritical…
We consider the bipartite boolean quadric polytope (BQP) with multiple-choice constraints and analyse its combinatorial properties. The well-studied BQP is defined as the convex hull of all quadric incidence vectors over a bipartite graph.…
The aim of this article is to show that systems of linear partial differential equations on filtered manifolds, which are of weighted finite type, can be canonically rewritten as first order systems of a certain type. This leads immediately…
Barnette's conjecture states that every cubic, bipartite, planar and 3-connected graph is Hamiltonian. Goodey verified Barnette's conjecture for all graphs with faces of size up to 6. We substantially strengthen Goodey's result by proving…