Arrangements of HyperplanesSpringer-Verlag, 1992 - 325页 |
在该图书中搜索
共有 90 个结果,这是第 1-3 个
第14页
... Let ( A , V ) be an arrangement . If BCA is a subset , then ( B , V ) is called a subarrangement . For X € L ( A ) define a subarrangement Ax of A by = Ax = { H Є A | X CH } . Note that Ay , and if XV , then Ax has center X in any ...
... Let ( A , V ) be an arrangement . If BCA is a subset , then ( B , V ) is called a subarrangement . For X € L ( A ) define a subarrangement Ax of A by = Ax = { H Є A | X CH } . Note that Ay , and if XV , then Ax has center X in any ...
第196页
... Let ( AR , VR ) be a real arrangement and let ( Ac , Vc ) be its complexification . Let MR M ( Ac ) be the real and complex complements . Let b1 ( MR ) and b2 ( Mc ) be their respective Betti numbers with coefficients in Z / 2 . Then MR ...
... Let ( AR , VR ) be a real arrangement and let ( Ac , Vc ) be its complexification . Let MR M ( Ac ) be the real and complex complements . Let b1 ( MR ) and b2 ( Mc ) be their respective Betti numbers with coefficients in Z / 2 . Then MR ...
第244页
... Let P ( l ) denote the number of partitions of l . = Proposition 6.72 Let A be the braid arrangement and let L = L ( A ) be the partition lattice . Two subspaces X = A and X ' A ' lie in the same G orbit if and only if || A || = || A ...
... Let P ( l ) denote the number of partitions of l . = Proposition 6.72 Let A be the braid arrangement and let L = L ( A ) be the partition lattice . Two subspaces X = A and X ' A ' lie in the same G orbit if and only if || A || = || A ...
其他版本 - 查看全部
常见术语和短语
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