Arrangements of HyperplanesSpringer-Verlag, 1992 - 325页 |
在该图书中搜索
共有 37 个结果,这是第 1-3 个
第24页
... Assertion ( 1 ) follows from the definition . Assertion ( 2 ) is a consequence of the fact that the maximal number of linearly independent hyperplanes which can contain a subspace is its codimension . To see ( 3 ) recall that dim ( X + ...
... Assertion ( 1 ) follows from the definition . Assertion ( 2 ) is a consequence of the fact that the maximal number of linearly independent hyperplanes which can contain a subspace is its codimension . To see ( 3 ) recall that dim ( X + ...
第38页
... assertion for a central arrangement A , and there it suffices to prove that μ ( A ) 0 and signμ ( A ) = ( −1 ) ( A ) . We argue by induction on r ( A ) . The assertion is clear if r ( A ) = 0. Suppose r ( A ) ≥ 1. Choose HЄ A and ...
... assertion for a central arrangement A , and there it suffices to prove that μ ( A ) 0 and signμ ( A ) = ( −1 ) ( A ) . We argue by induction on r ( A ) . The assertion is clear if r ( A ) = 0. Suppose r ( A ) ≥ 1. Choose HЄ A and ...
第140页
... assertion holds for | A | = r ( A ) . For the induction step , choose Ho E A and consider the associated spaces F ... assertion is correct for r ( A ) = 2 and arbitrary | A | by Lemma 4.102 . The assertion is also correct for arbitrary r ...
... assertion holds for | A | = r ( A ) . For the induction step , choose Ho E A and consider the associated spaces F ... assertion is correct for r ( A ) = 2 and arbitrary | A | by Lemma 4.102 . The assertion is also correct for arbitrary r ...
其他版本 - 查看全部
常见术语和短语
A₁ affine arrangement algebra A(A arrangement and let arrangements of hyperplanes assume b₁ basic invariants basis for D(A braid arrangement Brieskorn broken circuit central arrangement chain complex cohomology complement complex reflection groups complexification compute construction Corollary Coxeter group defining polynomial Definition deformation retraction denote dependent exact sequence Example exterior algebra fiber finite follows from Lemma follows from Proposition formula free arrangement free with exp graded K-module graph H₁ H₂ homogeneous homology homotopy type hyperplane arrangement hyperplanes inductively free integers irreducible isomorphism K-algebra ker(x l-arrangement lattice Lemma Let G linear linearly independent Math matrix maximal element Möbius function modular elements module nonempty Note Orbits Poincaré polynomial poset Proof prove real arrangement Recall reflection arrangement restriction result Section Shephard groups simplicial space subset subspace supersolvable supersolvable arrangement Suppose surjective topological vertex vertices w₁ write x-independent