Arrangements of HyperplanesSpringer-Verlag, 1992 - 325页 |
在该图书中搜索
共有 42 个结果,这是第 1-3 个
第4页
... obtain recursion formulas for counting problems . A similar result was obtained independently by M. Las Vergnas [ 136 ] . Let A be an arrangement and let HЄ A be a hyperplane . Then A ' = A \ { H } is called the deleted arrangement ...
... obtain recursion formulas for counting problems . A similar result was obtained independently by M. Las Vergnas [ 136 ] . Let A be an arrangement and let HЄ A be a hyperplane . Then A ' = A \ { H } is called the deleted arrangement ...
第54页
... obtained from an ar- bitrary map on the plane . The chromatic function x ( G , t ) was introduced by G. Birkhoff in his study [ 26 ] of the four color problem . Example 2.79 If a graph G has vertices and no edges , then there is no ...
... obtained from an ar- bitrary map on the plane . The chromatic function x ( G , t ) was introduced by G. Birkhoff in his study [ 26 ] of the four color problem . Example 2.79 If a graph G has vertices and no edges , then there is no ...
第68页
... obtained by removing the maximal element of a standard circuit of Ax . Since the latter is also a standard circuit of A , S is a broken circuit of A. Conversely , suppose S is a broken circuit of A. Then there exists HЄ A such that ...
... obtained by removing the maximal element of a standard circuit of Ax . Since the latter is also a standard circuit of A , S is a broken circuit of A. Conversely , suppose S is a broken circuit of A. Then there exists HЄ A such that ...
其他版本 - 查看全部
常见术语和短语
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