Bigraphical arrangements - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2014

Bigraphical arrangements


We define the bigraphical arrangement of a graph and show that the Pak-Stanley labels of its regions are the parking functions of a closely related graph, thus proving conjectures of Duval, Klivans, and Martin and of Hopkins and Perkinson. A consequence is a new proof of a bijection between labeled graphs and regions of the Shi arrangement first given by Stanley. We also give bounds on the number of regions of a bigraphical arrangement. The full version of this paper is forthcoming in the $\textit{Transactions of the American Mathematical Society}$
Fichier principal
Vignette du fichier
dmAT0124.pdf (304.68 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01207608 , version 1 (01-10-2015)



Sam Hopkins, David Perkinson. Bigraphical arrangements. 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014), 2014, Chicago, United States. pp.265-276, ⟨10.46298/dmtcs.2398⟩. ⟨hal-01207608⟩


44 View
491 Download



Gmail Facebook X LinkedIn More