Eigenvectors for a random walk on a hyperplane arrangement (Q408117): Difference between revisions

Let \({\mathcal A}\) be an arrangement of \(n\) linear hyperplanes in \({\mathbb R}^\ell\), and let \({\mathcal C}\) denote the set of chambers. In [\textit{P. Bidigare, P. Hanlon} and \textit{D. Rockmore}, Duke Math. J. 99, No. 1, 135--174 (1999; Zbl 0955.60043)], the authors construct a random walk on \({\mathcal C}\), called the BHR random walk. The author gives a description of the BHR random walk's eigenvectors. The main result of the paper describes a spanning set for each eigenspace in terms of flags in the intersection lattice.