中文
相关论文

相关论文: Planar maps as labeled mobiles

200 篇论文

Generalized Tamari intervals have been recently introduced by Pr\'eville-Ratelle and Viennot, and have been proved to be in bijection with (rooted planar) non-separable maps by Fang and Pr\'eville-Ratelle. We present two new bijections…

组合数学 · 数学 2023-04-25 Éric Fusy , Abel Humbert

We present an algorithmic mapping from permutations of length dn to labeled n-node d-ary trees and back again. Given such a bijection, one can interpret each of the factorials in the formula for the Catalan numbers as a count of…

组合数学 · 数学 2007-05-23 Bennet Vance

This paper investigates two involutions on binary trees. One is the mirror symmetry of binary trees which combined with the classical bijection $\varphi$ between binary trees and plane trees answers an open problem posed by Bai and Chen.…

组合数学 · 数学 2023-09-13 Yang Li , Zhicong Lin , Tongyuan Zhao

For a natural class of $r \times n$ integer matrices, we construct a non-convex polytope which periodically tiles $\mathbb R^n$. From this tiling, we provide a family of geometrically meaningful maps from a generalized sandpile group to a…

组合数学 · 数学 2022-03-30 Alex McDonough

We consider planar maps with three boundaries, colloquially called pairs of pants. In the case of bipartite maps with controlled face degrees, a simple expression for their generating function was found by Eynard and proved bijectively by…

组合数学 · 数学 2022-11-28 Jérémie Bouttier , Emmanuel Guitter , Grégory Miermont

The modular decomposition of a symmetric map $\delta\colon X\times X \to \Upsilon$ (or, equivalently, a set of symmetric binary relations, a 2-structure, or an edge-colored undirected graph) is a natural construction to capture key features…

组合数学 · 数学 2021-03-12 Carmen Bruckmann , Peter F. Stadler , Marc Hellmuth

We introduce a simple bijection between Tamari intervals and the blossoming trees (Poulalhon and Schaeffer, 2006) encoding planar triangulations, using a new meandering representation of such trees. Its specializations to the families of…

组合数学 · 数学 2025-11-11 Wenjie Fang , Éric Fusy , Philippe Nadeau

We investigate connections between pairs of (pseudo-)Riemannian metrics whose sum is a (tensor) product of a covector field with itself. A bijective mapping between the classes of Euclidean and Lorentzian metrics is constructed as a special…

广义相对论与量子宇宙学 · 物理学 2007-05-23 Bozhidar Z. Iliev

Let $G$ be a connected finite graph. Backman, Baker, and Yuen have constructed a family of explicit and easy-to-describe bijections $g_{\sigma,\sigma^*}$ between spanning trees of $G$ and $(\sigma,\sigma^*)$-compatible orientations, where…

组合数学 · 数学 2023-06-14 Changxin Ding

Triangulations of the 5-gon with no separating triangle nor quadrangle, so called 5c-triangulations, are a planar map family closely related to 5-connected planar triangulations. We show that 5c-triangulations are in bijection with…

组合数学 · 数学 2025-10-29 Éric Fusy

We prove that isomorphism classes of principal bundles over a diffeological space are in bijection to certain maps on its free loop space, both in a setup with and without connections on the bundles. The maps on the loop space are smooth…

微分几何 · 数学 2013-03-21 Konrad Waldorf

We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the…

组合数学 · 数学 2007-05-23 Frederic Patras , Manfred Schocker

A category N of labeled (oriented) trivalent graphs (nets) or ribbon graphs is extended by new generators called fusing, braiding, twist and switch with relations which can be called Moore--Seiberg relations. A functor to N is constructed…

高能物理 - 理论 · 物理学 2008-02-22 Volodymyr Lyubashenko

The slice decomposition is a bijective method for enumerating planar maps (graphs embedded in the sphere) with control over face degrees. In this paper, we extend the slice decomposition to the richer setting of hypermaps, naturally…

组合数学 · 数学 2026-04-29 Marie Albenque , Jérémie Bouttier

Poulalhon and Schaeffer introduced an elegant method to linearly encode a planar triangulation optimally. The method is based on performing a special depth-first search algorithm on a particular orientation of the triangulation: the minimal…

离散数学 · 计算机科学 2015-07-21 Vincent Despré , Daniel Gonçalves , Benjamin Lévêque

Within this research, two combinatorial bijections using Young diagrams were studied. The first is a special case of a bijective correspondence between two classes of combinatorial objects. Its proof, based on Young diagrams, establishes…

数论 · 数学 2026-04-06 Katya Borodinova

In this paper we introduce a description of ordered groupoids as a particular type of double categories. This enables us to turn Lawson's correspondence between ordered groupoids and left-cancellative categories into a biequivalence. We use…

范畴论 · 数学 2019-10-08 Darien DeWolf , Dorette Pronk

We associate root polytopes to directed graphs and study them by using ribbon structures. Most attention is paid to what we call the semi-balanced case, i.e., when each cycle has the same number of edges pointing in the two directions.…

组合数学 · 数学 2024-08-16 Tamás Kálmán , Lilla Tóthmérész

We prove that all quiver Grassmannians for exceptional representations of a generalized Kronecker quiver admit a cell decomposition. In the process, we introduce a class of regular representations which arise as quotients of consecutive…

表示论 · 数学 2018-03-20 Dylan Rupel , Thorsten Weist

There is a natural bijection between Dyck paths and basis diagrams of the Temperley-Lieb algebra defined via tiling. Overhang paths are certain generalisations of Dyck paths allowing more general steps but restricted to a rectangle in the…

组合数学 · 数学 2020-12-21 Bethany Marsh , Paul Martin