Arrangements of HyperplanesSpringer-Verlag, 1992 - 325页 |
在该图书中搜索
共有 75 个结果,这是第 1-3 个
第65页
... write a = ( u ) where u Ep . Write u = Σses , cses where cs € K. If S € S , is dependent , then ( es ) = 0. If SЄ Sp is independent , let X = S. Then r ( X ) = p and es Є Ex implies y ( es ) € Ax . Thus Ap CΣ Ax . The sum is direct by ...
... write a = ( u ) where u Ep . Write u = Σses , cses where cs € K. If S € S , is dependent , then ( es ) = 0. If SЄ Sp is independent , let X = S. Then r ( X ) = p and es Є Ex implies y ( es ) € Ax . Thus Ap CΣ Ax . The sum is direct by ...
第74页
... write ан = ен + I. If He A ' , it is important to distinguish between ан and ен + I ' . We can- not identify the two because we do not know that i is a monomorphism . If S = ( H1 , ... , Hp ) Є S , write as aн1 ... ан ,. If S Є S ...
... write ан = ен + I. If He A ' , it is important to distinguish between ан and ен + I ' . We can- not identify the two because we do not know that i is a monomorphism . If S = ( H1 , ... , Hp ) Є S , write as aн1 ... ан ,. If S Є S ...
第93页
Peter Orlik, Hiroaki Terao. For simplicity of notation , we write wn = wɅn for w , n E ( V ) . In particu- lar , we write dr1 ... dxp = dx1 ^ ... Ʌdap . We identify o with F. The elements of P ( V ) are called rational differential p ...
Peter Orlik, Hiroaki Terao. For simplicity of notation , we write wn = wɅn for w , n E ( V ) . In particu- lar , we write dr1 ... dxp = dx1 ^ ... Ʌdap . We identify o with F. The elements of P ( V ) are called rational differential p ...
其他版本 - 查看全部
常见术语和短语
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