Free Arrangements and Relation Spaces.
K.A. Brandt, H. Terao (1994)
Discrete & computational geometry
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
K.A. Brandt, H. Terao (1994)
Discrete & computational geometry
Similarity:
J. Linhart (1993)
Discrete & computational geometry
Similarity:
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.
Cazals, Frédéric (1997)
Experimental Mathematics
Similarity:
A. Björner, P.H. Edelman, G.M. Ziegler (1990)
Discrete & computational geometry
Similarity:
Ruimei Gao, Xiupeng Cui, Zhe Li (2017)
Open Mathematics
Similarity:
In this paper, we define the supersolvable order of hyperplanes in a supersolvable arrangement, and obtain a class of inductively free arrangements according to this order. Our main results improve the conclusion that every supersolvable arrangement is inductively free. In addition, we assert that the inductively free arrangement with the required induction table is supersolvable.
H. Edelsbrunner, Raimund Seidel (1986)
Discrete & computational geometry
Similarity:
J.P. Roudneff (1988)
Discrete & computational geometry
Similarity:
Linhart, Johann (1994)
Beiträge zur Algebra und Geometrie
Similarity:
Günter M. Ziegler (1993)
Mathematische Zeitschrift
Similarity:
J. Matousek (1991)
Discrete & computational geometry
Similarity:
M. Sharir, B. Aronov, D.Q. Naiman, J. Pack (1993)
Discrete & computational geometry
Similarity: