Abstract
An n-dimensional real hyperplane arrangement is a finite collection of affine hyperplanesin R^n. A given arrangement separates R^n into disjoint regions and it is an important problem
in combinatorics to understand these regions combinatorially, in particular to enumerate the
number of regions associated to an arrangement.
We present here bijections between the regions of certain Type B, C, D Coxeter arrangements and certain configurations of trees. These bijections further allow us to obtain generating functions for the number of regions.
The present work originates from an effort to generalise previously known methods andresults in Type A arrangements due to my advisor Olivier Bernardi in his previous work.
It should also serve as a starting point in developing a systematic bijective framework for
studying the combinatorics of general Coxeter arrangements.