Arrangements of HyperplanesSpringer-Verlag, 1992 - 325页 |
在该图书中搜索
共有 87 个结果,这是第 1-3 个
第78页
... proof is the same as the proof of the central version , Corollary 3.27 . Corollary 3.73 will be used in Theorem 5.91 to give an elementary proof of Brieskorn's Lemma . Corollary 3.73 Let A be an affine arrangement . Then Ap = 0xELP AX ...
... proof is the same as the proof of the central version , Corollary 3.27 . Corollary 3.73 will be used in Theorem 5.91 to give an elementary proof of Brieskorn's Lemma . Corollary 3.73 Let A be an affine arrangement . Then Ap = 0xELP AX ...
第90页
... Proof . If ns = 0 , then ( es ) = bs = 0. If S is dependent , then des = τψες = Tbs 0 , so des Є ker . Thus IC ker and induces a surjective map : A → B such that as bs . Since is an algebra homomorphism , so is Ꮎ . = = Lemma 3.108 If ...
... Proof . If ns = 0 , then ( es ) = bs = 0. If S is dependent , then des = τψες = Tbs 0 , so des Є ker . Thus IC ker and induces a surjective map : A → B such that as bs . Since is an algebra homomorphism , so is Ꮎ . = = Lemma 3.108 If ...
第198页
... Proof . We have = L. Note that the p ( X ) ^ M ( A / Y ) = 0 ↔ p ( X ) ≤ p ( H ) p ( X ) p ( H ) X + YCH for some HЄ Ay for some HЄ Ay X + YCH for some HЄ Ay + XAY # V . This completes the proof . Proposition 5.103 The following four ...
... Proof . We have = L. Note that the p ( X ) ^ M ( A / Y ) = 0 ↔ p ( X ) ≤ p ( H ) p ( X ) p ( H ) X + YCH for some HЄ Ay for some HЄ Ay X + YCH for some HЄ Ay + XAY # V . This completes the proof . Proposition 5.103 The following four ...
其他版本 - 查看全部
常见术语和短语
A₁ affine arrangement algebra A(A arrangement and let assume b₁ basic derivations basic invariants basis for D(A braid arrangement broken circuit central arrangement chain complex choose cohomology complement complex reflection groups complexification compute Corollary Coxeter group defining polynomial Definition deformation retraction degree denote dependent exact sequence Example exterior algebra exterior product fiber finite follows from Lemma follows from Proposition follows from Theorem formula free arrangement free with exp G-orbit graded K-module graph H₁ H₂ homogeneous homotopy type hyperplanes inductively free integers irreducible isomorphism K-algebra ker(x l-arrangement lattice Lemma Let G linear linearly independent matrix maximal element Möbius function modular elements module N¹(A nonempty Note Orbits Poincaré polynomial poset Proof prove real arrangement Recall reflection arrangement restriction result Saito's criterion 4.19 Section Shephard groups simplicial subset subspace supersolvable supersolvable arrangement Suppose surjective vertex w₁ write x-independent