Arrangements of HyperplanesSpringer-Verlag, 1992 - 325页 |
在该图书中搜索
共有 62 个结果,这是第 1-3 个
第7页
... called free if D ( A ) is a free S - module . It is an enduring mystery of the subject just what makes an ... called its exponents , exp A = { b1 , ... , be } . These integers are unique up to order , but they are not necessarily ...
... called free if D ( A ) is a free S - module . It is an enduring mystery of the subject just what makes an ... called its exponents , exp A = { b1 , ... , be } . These integers are unique up to order , but they are not necessarily ...
第9页
... called a Sylvester - Gallai ( S - G ) configuration if it verifies the following condition : ( * ) If P , Q € X , with PQ , the line joining P and Q contains at least one more point of X. ( Equivalently : no line intersects X in exactly ...
... called a Sylvester - Gallai ( S - G ) configuration if it verifies the following condition : ( * ) If P , Q € X , with PQ , the line joining P and Q contains at least one more point of X. ( Equivalently : no line intersects X in exactly ...
第16页
... called the superdiagonal and its complement M ( A ) = V \ N ( A ) is the pure braid space . Reflection Arrangements ... called a reflection group if it is generated by reflections . Definition 1.23 Let G C GL ( V ) be a finite reflection ...
... called the superdiagonal and its complement M ( A ) = V \ N ( A ) is the pure braid space . Reflection Arrangements ... called a reflection group if it is generated by reflections . Definition 1.23 Let G C GL ( V ) be a finite reflection ...
其他版本 - 查看全部
常见术语和短语
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