English
Related papers

Related papers: Bijections between affine hyperplane arrangements …

200 papers

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

We establish a general bijective framework for encoding faces of some classical hyperplane arrangements. Precisely, we consider hyperplane arrangements in $\mathbb{R}^n$ whose hyperplanes are all of the form $\{x_i-x_j=s\}$ for some…

Combinatorics · Mathematics 2025-03-04 Olivier Bernardi

In 1986, Shi derived the famous formula $(n+1)^{n-1}$ for the number of regions of the Shi arrangement, a hyperplane arrangement in $\mathbb{R}^n$. There are at least two different bijective explanations of this formula, one by Pak and…

Combinatorics · Mathematics 2020-08-07 Duncan Levear

The Shi arrangement ${\mathcal S}_n$ is the arrangement of affine hyperplanes in ${\mathbb R}^n$ of the form $x_i - x_j = 0$ or $1$, for $1 \leq i < j \leq n$. It dissects ${\mathbb R}^n$ into $(n+1)^{n-1}$ regions, as was first proved by…

Combinatorics · Mathematics 2016-09-07 Christos A. Athanasiadis , Svante Linusson

Plane increasing trees are rooted labeled trees embedded into the plane such that the sequence of labels is increasing on any branch starting at the root. Relaxed binary trees are a subclass of unlabeled directed acyclic graphs. We…

Combinatorics · Mathematics 2018-07-12 Michael Wallner

We present a surprisingly new connection between two well-studied combinatorial classes: rooted connected chord diagrams on one hand, and rooted bridgeless combinatorial maps on the other hand. We describe a bijection between these two…

Combinatorics · Mathematics 2017-10-18 Julien Courtiel , Karen Yeats , Noam Zeilberger

A hyperplane arrangement in $\mathbb{R}^n$ is a finite collection of affine hyperplanes. Counting regions of hyperplane arrangements is an active research direction in enumerative combinatorics. In this paper, we consider the arrangement…

Combinatorics · Mathematics 2023-09-12 Priyavrat Deshpande , Krishna Menon , Writika Sarkar

Recently, Ehrenborg and Van Willenburg defined a class of bipartite graphs that correspond naturally to Ferrers diagrams, and proved several results about them. We give bijective proofs for the (already known) expressions for the number of…

Combinatorics · Mathematics 2007-05-23 Jason Burns

The {\sf Shi hyperplane arrangement} Shi(n) was introduced by Shi to study the Kazhdan-Lusztig cellular structure of the affine symmetric group. The {\sf Ish hyperplane arrangement} Ish(n) was introduced by Armstrong in the study of…

Combinatorics · Mathematics 2013-07-25 Emily Leven , Brendon Rhoades , Andrew Timothy Wilson

This article presents new bijections on planar maps. At first a bijection is established between bipolar orientations on planar maps and specific "transversal structures" on triangulations of the 4-gon with no separating 3-cycle, which are…

Combinatorics · Mathematics 2009-03-20 Eric Fusy

A hyperplane arrangement in $\mathbb{R}^n$ is a finite collection of affine hyperplanes. The regions are the connected components of the complement of these hyperplanes. By a theorem of Zaslavsky, the number of regions of a hyperplane…

Combinatorics · Mathematics 2023-09-12 Priyavrat Deshpande , Krishna Menon

We present a bijective proof for the planar case of Louf's counting formula on bipartite planar maps with prescribed face degree, that arises from the Toda hierarchy. We actually show that his formula hides two simpler formulas, both of…

Combinatorics · Mathematics 2025-02-12 Juliette Schabanel

In this paper, we give a bijection between rooted labeled ordered forests with a selected subset of their leaves and the regions of the type $C$ Catalan arrangement in $\R^n$. We thus obtain a bijective proof of the well-known enumeration…

Combinatorics · Mathematics 2020-04-22 Anne Micheli , Vu Nguyen Dinh

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

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.…

Combinatorics · Mathematics 2023-09-13 Yang Li , Zhicong Lin , Tongyuan Zhao

Associated with the $r$-Shi arrangement and $r$-Catalan arrangement in $\Bbb{R}^n$, we introduce a cubic matrix for each region to establish two bijections in a uniform way. Firstly, the positions of minimal positive entries in column…

Combinatorics · Mathematics 2020-05-19 Houshan Fu , Suijie Wang , Weijin Zhu

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

This article presents a unified bijective scheme between planar maps and blossoming trees, where a blossoming tree is defined as a spanning tree of the map decorated with some dangling half-edges that enable to reconstruct its faces. Our…

Combinatorics · Mathematics 2015-07-27 Marie Albenque , Dominique Poulalhon

We consider real hyperplane arrangements whose hyperplanes are of the form $\{x_i - x_j = s\}$ for some integer $s$, which we call deformations of the braid arrangement. In 2018, Bernardi gave a counting formula for the number of regions of…

Combinatorics · Mathematics 2026-03-27 Neha Goregaokar , Aaron Lin

This paper primarily investigates a specific type of deformation of the braid arrangement $\mathcal{B}_n$ in $\mathbb{R}^n$, denoted by $\mathcal{B}_n^A$ and defined in (1.2). Let $r_l(\mathcal{B}_n^A)$ be the number of regions of level $l$…

Combinatorics · Mathematics 2024-11-19 Yanru Chen , Houshan Fu , Suijie Wang , Jinxing Yang
‹ Prev 1 2 3 10 Next ›