English
Related papers

Related papers: Geometric Bijections Between Spanning Trees and Br…

200 papers

A bijection between ternary trees with $n$ nodes and a subclass of Motzkin paths of length $3n$ is given. This bijection can then be generalized to $t$-ary trees.

Combinatorics · Mathematics 2018-08-17 Helmut Prodinger , Sarah J. Selkirk

We extend Schaeffer's bijection between rooted quadrangulations and well-labeled trees to the general case of Eulerian planar maps with prescribed face valences, to obtain a bijection with a new class of labeled trees, which we call…

Combinatorics · Mathematics 2007-05-23 J. Bouttier , P. Di Francesco , E. Guitter

We establish counting formulas and bijections for deformations of the braid arrangement. Precisely, we consider real hyperplane arrangements such that all the hyperplanes are of the form $x\_i-x\_j=s$ for some integer $s$. Classical…

Combinatorics · Mathematics 2021-06-15 Olivier Bernardi

Toric geometry provides a bridge between algebraic geometry and combinatorics of fans and polytopes. For each polarized toric variety (X,L) we have associated a polytope P. In this thesis we use this correspondence to study birational…

Algebraic Geometry · Mathematics 2016-11-26 Edilaine Ervilha Nobili

If $G$ is a strongly connected finite directed graph, the set $\mathcal{T}G$ of rooted directed spanning trees of $G$ is naturally equipped with a structure of directed graph: there is a directed edge from any spanning tree to any other…

Combinatorics · Mathematics 2018-09-18 Philippe Biane , Guillaume Chapuy

The purpose of this paper is twofold. First we answer to a question asked by Steingrimsson and Williams about certain permutation tableaux: we construct a bijection between binary trees and the so-called Catalan tableaux. These tableaux are…

Combinatorics · Mathematics 2009-05-20 Xavier Gérard Viennot

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…

Combinatorics · Mathematics 2007-05-23 Frederic Patras , Manfred Schocker

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

In this paper we give a bijective proof for a relation between uni- bi- and tricellular maps of certain topological genus. While this relation can formally be obtained using Matrix-theory as a result of the Schwinger-Dyson equation, we here…

Combinatorics · Mathematics 2019-08-13 Hillary S. W. Han , Christian M. Reidys

We consider bicolored maps, i.e. graphs which are drawn on surfaces, and construct a bijection between (i) oriented maps with arbitary face structure, and (ii) (weighted) non-oriented maps with exactly one face. Above, each non-oriented map…

Combinatorics · Mathematics 2022-12-12 Agnieszka Czyżewska-Jankowska , Piotr Śniady

The active bijection forms a package of results studied by the authors in a series of papers in oriented matroids. The present paper is intended to state the main results in the particular case, and more widespread language, of graphs. We…

Combinatorics · Mathematics 2018-07-19 Emeric Gioan , Michel Las Vergnas

For a given Jacobi-Jordan algebra $A$ and a vector space $V$ over a field $k$, a non-abelian cohomological type object ${\mathcal H}^{2}_{A} \, (V, \, A)$ is constructed: it classifies all Jacobi-Jordan algebras containing $A$ as a…

Rings and Algebras · Mathematics 2022-02-11 A. L. Agore , G. Militaru

The critical group of a graph is a finite abelian group whose order is the number of spanning forests of the graph. For a graph G with a certain reflective symmetry, we generalize a result of Ciucu-Yan-Zhang factorizing the spanning tree…

Combinatorics · Mathematics 2013-04-29 Andrew Berget

In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed…

Combinatorics · Mathematics 2007-05-23 Richard W. Kenyon , James G. Propp , David B. Wilson

We consider the dimer problem on a non-bipartite graph $G$, where there are two types of dimers one of which we regard impurities. Results of simulations using Markov chain seem to indicate that impurities are tend to distribute on the…

Combinatorics · Mathematics 2015-05-13 Fumihiko Nakano , Taizo Sadahiro

The Jacobian group (also known as the critical group or sandpile group) is an important invariant of a finite, connected graph $X$; it is a finite abelian group whose cardinality is equal to the number of spanning trees of $X$ (Kirchhoff's…

Combinatorics · Mathematics 2022-01-19 Sophia Gonet

We define the Laplacian matrix and the Jacobian group of a finite graph of groups. We prove analogues of the matrix tree theorem and the class number formula for the order of the Jacobian of a graph of groups. Given a group $G$ acting on a…

Combinatorics · Mathematics 2023-07-27 Margaret Meyer , Dmitry Zakharov

This paper is the second in a series of two papers which study the phenomenon of tropical split Jacobians. The first paper is a contemplative study, embedded in the broader context of exploring connections between the category of tropical…

Algebraic Geometry · Mathematics 2025-02-11 Lou-Jean Leila Cobigo

We show that relative compactified Jacobians of one-parameter smoothings of a nodal curve of genus g are Mumford models of the generic fiber. Each such model is given by an admissible polytopal decomposition of the skeleton of the Jacobian.…

Algebraic Geometry · Mathematics 2025-01-07 Karl Christ , Sam Payne , Tif Shen

The Tree Decomposition Conjecture by Bar\'at and Thomassen states that for every tree $T$ there exists a natural number $k(T)$ such that the following holds: If $G$ is a $k(T)$-edge-connected simple graph with size divisible by the size of…

Combinatorics · Mathematics 2016-03-02 Martin Merker