scholarly journals Labeling the Regions of the Type $C_n$ Shi Arrangement

10.37236/3272 ◽  
2013 ◽  
Vol 20 (2) ◽  
Author(s):  
Karola Mészáros

The number of regions of the type $C_n$ Shi arrangement in $\mathbb{R}^n$ is $(2n+1)^n$. Strikingly, no bijective proof of this fact has been given thus far. The aim of this paper is to provide such a bijection and use it to prove more refined results. We construct a bijection between the regions of the type $C_n$ Shi arrangement in $\mathbb{R}^n$ and sequences $a_1a_2 \ldots a_n$, where $a_i \in \{-n, -n+1, \ldots, -1, 0, 1, \ldots, n-1, n\}$, $ i \in [n]$. Our bijection naturally restrict to bijections between special regions of the arrangement and sequences with a given number of distinct elements.

2021 ◽  
Vol 28 (4) ◽  
Author(s):  
Duncan Levear

In 1986, Shi derived the famous formula $(n+1)^{n-1}$ for the number of regions of the Shi arrangement, a hyperplane arrangement in ${R}^n$. There are at least two different bijective explanations of this formula, one by Pak and Stanley, another by Athanasiadis and Linusson. In 1996, Athanasiadis used the finite field method to derive a formula for the number of $k$-dimensional faces of the Shi arrangement for any $k$. Until now, the formula of Athanasiadis did not have a bijective explanation. In this paper, we extend a bijection for regions defined by Bernardi to obtain a bijection between the $k$-dimensional faces of the Shi arrangement for any $k$ and a set of decorated binary trees. Furthermore, we show how these trees can be converted to a simple set of functions of the form $f: [n-1] \to [n+1]$ together with a marked subset of $\text{Im}(f)$. This correspondence gives the first bijective proof of the formula of Athanasiadis. In the process, we also obtain a bijection and counting formula for the faces of the Catalan arrangement. All of our results generalize to both extended arrangements.


2017 ◽  
Vol 10 (3) ◽  
pp. 523-530
Author(s):  
Jacob Forster ◽  
Kristina Garrett ◽  
Luke Jacobsen ◽  
Adam Wood
Keyword(s):  

1997 ◽  
Vol Vol. 1 ◽  
Author(s):  
Jean-Christophe Novelli ◽  
Igor Pak ◽  
Alexander V. Stoyanovskii

International audience This paper presents a new proof of the hook-length formula, which computes the number of standard Young tableaux of a given shape. After recalling the basic definitions, we present two inverse algorithms giving the desired bijection. The next part of the paper presents the proof of the bijectivity of our construction. The paper concludes with some examples.


10.37236/409 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Markus Kuba ◽  
Stephan Wagner

By a theorem of Dobrow and Smythe, the depth of the $k$th node in very simple families of increasing trees (which includes, among others, binary increasing trees, recursive trees and plane ordered recursive trees) follows the same distribution as the number of edges of the form $j-(j+1)$ with $j < k$. In this short note, we present a simple bijective proof of this fact, which also shows that the result actually holds within a wider class of increasing trees. We also discuss some related results that follow from the bijection as well as a possible generalization. Finally, we use another similar bijection to determine the distribution of the depth of the lowest common ancestor of two nodes.


Sign in / Sign up

Export Citation Format

Share Document