Arrangements of HyperplanesSpringer-Verlag, 1992 - 325页 |
在该图书中搜索
共有 85 个结果,这是第 1-3 个
第14页
... Note that A = A. The method of deletion and restriction is a basic construction in this book . It allows for ... Note that | cA | A + 1. We call Ko ker ( xo ) the additional hy- perplane . = = - Note that in the coning construction , the ...
... Note that A = A. The method of deletion and restriction is a basic construction in this book . It allows for ... Note that | cA | A + 1. We call Ko ker ( xo ) the additional hy- perplane . = = - Note that in the coning construction , the ...
第84页
... Note that ( π ) k = ✪ ( π ) y ~ YELK by Lemmas 3.84 and 3.85 . Also note that Ak ( A ) : = YELK ( TY ) Y YELK Ay ( A ) ~ Ay ( Ay ) YELK by Corollary 3.27 and Proposition 3.31 . By applying the induction assumption to Ly for r ( Y ) < r ...
... Note that ( π ) k = ✪ ( π ) y ~ YELK by Lemmas 3.84 and 3.85 . Also note that Ak ( A ) : = YELK ( TY ) Y YELK Ay ( A ) ~ Ay ( Ay ) YELK by Corollary 3.27 and Proposition 3.31 . By applying the induction assumption to Ly for r ( Y ) < r ...
第112页
... Note that A = 7 = 1 + 3 + 3 = 1 + 2 + 4 in agreement with Proposition 4.26 . We close the section with a discussion of subarrangements . Restrictions are considered at the end of Section 4.6 . Note first that a free arrangement may have ...
... Note that A = 7 = 1 + 3 + 3 = 1 + 2 + 4 in agreement with Proposition 4.26 . We close the section with a discussion of subarrangements . Restrictions are considered at the end of Section 4.6 . Note first that a free arrangement may have ...
其他版本 - 查看全部
常见术语和短语
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