Arrangements of HyperplanesSpringer-Verlag, 1992 - 325页 |
在该图书中搜索
共有 77 个结果,这是第 1-3 个
第27页
... Recall that A is essential if and only if it contains linearly indepen- dent hyperplanes . For a central arrangement , this is equivalent to the condi- tion T ( A ) { 0 } . The braid arrangement is not essential ; T ( A ) is the line X1 ...
... Recall that A is essential if and only if it contains linearly indepen- dent hyperplanes . For a central arrangement , this is equivalent to the condi- tion T ( A ) { 0 } . The braid arrangement is not essential ; T ( A ) is the line X1 ...
第147页
... recall that S = S ( V * ) is the symmetric algebra of the dual space V * of V. Given a prime ideal pЄ SpecS and an element XE L , define X ( p ) E L by X ( p ) : = HEAX анер H. It follows from the definition that X ( p ) ≥ X , so X ( p ) ...
... recall that S = S ( V * ) is the symmetric algebra of the dual space V * of V. Given a prime ideal pЄ SpecS and an element XE L , define X ( p ) E L by X ( p ) : = HEAX анер H. It follows from the definition that X ( p ) ≥ X , so X ( p ) ...
第243页
... Recall the substitution y = t ( 1 - x ) - 1 used in the proof of Proposition 4.131 . The same substitution gives ( 6 ) ... Recall that for 1 ≤ i ≤ j ≤ l , the hyperplanes are H¿‚j = ker ( x ; − x ̧ ) and Q ( A ) = Π ( α ; - * ; ) . l ...
... Recall the substitution y = t ( 1 - x ) - 1 used in the proof of Proposition 4.131 . The same substitution gives ( 6 ) ... Recall that for 1 ≤ i ≤ j ≤ l , the hyperplanes are H¿‚j = ker ( x ; − x ̧ ) and Q ( A ) = Π ( α ; - * ; ) . l ...
其他版本 - 查看全部
常见术语和短语
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