The upper bound conjecture for arrangements of half-spaces.

Linhart, Johann

Displaying similar documents to “The upper bound conjecture for arrangements of half-spaces.”

Arrangements of Oriented Hyperplanes.

J. Linhart (1993)

Discrete & computational geometry

Similarity:

Arrangements of Lines with a Minimum Number of Triangles Are Simple.

J.P. Roudneff (1988)

Discrete & computational geometry

Similarity:

Combinatorial properties of one-dimensional arrangements.

Cazals, Frédéric (1997)

Experimental Mathematics

Similarity:

Hyperplane Arrangements with a Lattice of Regions.

A. Björner, P.H. Edelman, G.M. Ziegler (1990)

Discrete & computational geometry

Similarity:

Voroni Diagrams and Arrangements.

H. Edelsbrunner, Raimund Seidel (1986)

Discrete & computational geometry

Similarity:

Freeness of hyperplane arrangements and related topics

Masahiko Yoshinaga (2014)

Annales de la faculté des sciences de Toulouse Mathématiques

Similarity:

These are the expanded notes of the lecture by the author in “Arrangements in Pyrénées”, June 2012. We are discussing relations of freeness and splitting problems of vector bundles, several techniques proving freeness of hyperplane arrangements, K. Saito’s theory of primitive derivations for Coxeter arrangements, their application to combinatorial problems and related conjectures.