Arrangements of HyperplanesSpringer-Verlag, 1992 - 325页 |
在该图书中搜索
共有 25 个结果,这是第 1-3 个
第24页
... maximal linearly ordered subsets V = X。< X1 < ... < Xp = X have the same cardinality . Thus L ( A ) is a geometric ... maximal number of linearly independent hyperplanes which can contain a subspace is its codimension . To see ( 3 ) ...
... maximal linearly ordered subsets V = X。< X1 < ... < Xp = X have the same cardinality . Thus L ( A ) is a geometric ... maximal number of linearly independent hyperplanes which can contain a subspace is its codimension . To see ( 3 ) ...
第49页
... maximal chain of modular elements V = Xo < X1 < ... < X1 = T. Let b1 = | Ax , \ Ax , _ , | . Then π ( A , t ) = [ ( 1 + b ; t ) . i = 1 Proof . We argue by induction on | A ] . The assertion is clear for | A | = 1. For the induction ...
... maximal chain of modular elements V = Xo < X1 < ... < X1 = T. Let b1 = | Ax , \ Ax , _ , | . Then π ( A , t ) = [ ( 1 + b ; t ) . i = 1 Proof . We argue by induction on | A ] . The assertion is clear for | A | = 1. For the induction ...
第168页
... maximal elements have the same dimen- sion . If T € L ( H ) is a maximal element and H € H does not contain T , then H is parallel to T. The same holds for the maximal element T ' . Thus every hyperplane which contains T ' either ...
... maximal elements have the same dimen- sion . If T € L ( H ) is a maximal element and H € H does not contain T , then H is parallel to T. The same holds for the maximal element T ' . Thus every hyperplane which contains T ' either ...
其他版本 - 查看全部
常见术语和短语
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