Hostname: page-component-848d4c4894-5nwft Total loading time: 0 Render date: 2024-05-18T12:54:50.938Z Has data issue: false hasContentIssue false
  • English
  • Français

The slimmest arrangements of hyperplanes: II. Basepointed geometric lattices and Euclidean arrangements

Published online by Cambridge University Press:  26 February 2010

Thomas Zaslavsky
Thomas Zaslavsky
Affiliation:
Department of Mathematics, The Ohio State University, Columbus, Ohio 43210, U.S.A.
Get access

Abstract

We calculate the minimum numbers of k-dimensional flats and cells of any Euclidean d-arrangement of n hyperplanes. The bounds are obtained by calculating lower bounds for the values of the doubly indexed Whitney numbers of a basepointed geometric lattice of rank r with n points. Additional geometric results concern the minimum number of cells of a Euclidean or projective arrangement met by a subspace in general position and the minimum number of non-Radon partitions of a Euclidean point set. We include remarks on the relationship between Euclidean arrangements and basepointed geometric lattices and on the minimum numbers of cells of arrangements with a bounded region.

Type
Research Article
Information
Mathematika , Volume 28 , Issue 2 , December 1981 , pp. 169 - 190
Copyright
Copyright © University College London 1981

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Alexanderson, G. L. and Wetzel, J. E.. “Arrangements of planes in space”, Discrete Math., 34 (1981), 219–240.CrossRefGoogle Scholar
2.Brylawski, T.. “Connected matroids with the smallest Whitney numbers”, Discrete Math., 18 (1977), 243–252. MR 58 #27566.CrossRefGoogle Scholar
3.Crapo, H. H.. “A higher invariant for matroids”, J. Combinatorial Theory, 2 (1967), 406–417. MR 35 #6579.CrossRefGoogle Scholar
4.Crapo, H. H.. “A combinatorial perspective on algebraic geometry”, Atti Colloq. Internal. Teorie Combinatorie (Roma, 1973) (Accad. Naz. Lincei, Rome, 1976), Vol. II, pp. 343–357. MR 58 #27570.Google Scholar
5.Crapo, H. H. and Rota, G.-C.. Combinatorial Geometries, Preliminary Ed. (MIT Press, Cambridge, Mass., 1970). MR 45 #74.Google Scholar
6.Dowling, T. A. and Wilson, R. M.. “The slimmest geometric lattices”, Trans. Amer. Math. Soc., 196 (1974), 203–215. MR 49 #10579.CrossRefGoogle Scholar
7.Dowling, T. A. and Wilson, R. M.. “Whitney number inequalities for geometric lattices”. Proc. Amer. Math. Soc., 47 (1975), 504–512. MR 50 #6900.CrossRefGoogle Scholar
8.Greene, C. and Zaslavsky, T.. “On the interpretation of Whitney numbers through arrangements of hyperplanes, zonotopes, non-Radon partitions, and orientations of graphs”, in preparation.Google Scholar
9.Grünbaum, B.. Convex Polytopes (Interscience, New York, 1967). MR 37 #2085.Google Scholar
10.McLaughlin, J. E.. “Projectivities in relatively complemented lattices”, Duke Math. J., 18 (1951), 73–84. MR 12 #12, 667.CrossRefGoogle Scholar
11.Rota, G.-C.. “On the foundations of combinatorial theory: I. Theory of Möbius functions”, Z. Wahrscheinlichkeitstheorie, 2 (1964), 340–368. MR 30 #4688.CrossRefGoogle Scholar
12.Shannon, R. W.. “A lower bound on the number of cells in arrangements of hyperplanes”, J. Combinatorial Theory Ser. A, 20 (1976), 327–335. MR 53 #14321.CrossRefGoogle Scholar
13.Zaslavsky, T.. “Facing up to arrangements: Face-count formulas for partitions of space by hyperplanes”, Mem. Amer. Math. Soc, 1 (1975), Issue 1, No. 154. MR 50 #9603.Google Scholar
14.Zaslavsky, T.. “Arrangements of hyperplanes: matroids and graphs”, Proc. Tenth Southeastern Conf. on Combinatorics, Graph Theory and Computing (Boca Raton, 1979), Hoffman, F. et al., Eds. (Utilitas Math. Publ. Co., Winnipeg, Man., 1979), Vol. II, pp. 895–911, MR 81h: 05043.Google Scholar
15.Zaslavsky, T.. “The slimmest arrangements of hyperplanes: I. Geometric lattices and projective arrangements”, submitted.Google Scholar