Department of Mathematics, University of Pennsylvania, 209 South 33rd Street, Philadelphia, PA 19104-6395, USA, email: email@example.com
Abstract: We prove a conjecture of Bayer and Brandt [J. Alg. Combin. 6 (1997), 229-246] about the "largest" intersection lattice of a discriminantal arrangement based on an essential arrangement of $n$ linear hyperplanes in $\hbox R^k$. An important ingredient in the proof is Crapo's characterization of the matroid of circuits of the configuration of $n$ generic points in $ R^k$.
Full text of the article: