Arrangements of HyperplanesSpringer-Verlag, 1992 - 325页 |
在该图书中搜索
共有 23 个结果,这是第 1-3 个
第54页
... vertices , then there are t ways to color the first vertex , t 1 ways to color the second vertex , t − 2 ways to - color the third vertex , and so on . Thus we have - - x ( G , t ) = t ( t − 1 ) ( t − 2 ) · · · ( t − l + 1 ) ...
... vertices , then there are t ways to color the first vertex , t 1 ways to color the second vertex , t − 2 ways to - color the third vertex , and so on . Thus we have - - x ( G , t ) = t ( t − 1 ) ( t − 2 ) · · · ( t − l + 1 ) ...
第183页
... vertex . Let v Є V be a vertex . Since the vertices are linearly ordered , we may choose real numbers t1 , t2 ER , t1 < 1 ( v ) < t2 , so v is the only vertex in the strip S = { m E R2 | t1 ≤ x1 ( m ) ≤ t2 } . Let C ; = { m € R2 | x1 ...
... vertex . Let v Є V be a vertex . Since the vertices are linearly ordered , we may choose real numbers t1 , t2 ER , t1 < 1 ( v ) < t2 , so v is the only vertex in the strip S = { m E R2 | t1 ≤ x1 ( m ) ≤ t2 } . Let C ; = { m € R2 | x1 ...
第186页
... vertex of I. There are four possibilities : S , may contain no vertex , a positive virtual vertex , a negative virtual vertex , or an actual vertex . If S ; contains no vertex , then an argument similar to Lemma 5.72 shows that Mi Li ...
... vertex of I. There are four possibilities : S , may contain no vertex , a positive virtual vertex , a negative virtual vertex , or an actual vertex . If S ; contains no vertex , then an argument similar to Lemma 5.72 shows that Mi Li ...
其他版本 - 查看全部
常见术语和短语
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