2000 character limit reached
Bijections between affine hyperplane arrangements and valued graphs
Published 11 Mar 2014 in math.CO | (1403.2573v2)
Abstract: We show new bijective proofs of previously known formulas for the number of regions of some deformations of the braid arrangement, by means of a bijection between the no-broken-circuit sets of the corresponding integral gain graphs and some kinds of labelled binary trees. This leads to new bijective proofs for the Shi, Catalan, and similar hyperplane arrangements.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.