Arrangements of HyperplanesSpringer Science & Business Media, 2013年3月9日 - 325页 An arrangement of hyperplanes is a finite collection of codimension one affine subspaces in a finite dimensional vector space. Arrangements have emerged independently as important objects in various fields of mathematics such as combinatorics, braids, configuration spaces, representation theory, reflection groups, singularity theory, and in computer science and physics. This book is the first comprehensive study of the subject. It treats arrangements with methods from combinatorics, algebra, algebraic geometry, topology, and group actions. It emphasizes general techniques which illuminate the connections among the different aspects of the subject. Its main purpose is to lay the foundations of the theory. Consequently, it is essentially self-contained and proofs are provided. Nevertheless, there are several new results here. In particular, many theorems that were previously known only for central arrangements are proved here for the first time in completegenerality. The text provides the advanced graduate student entry into a vital and active area of research. The working mathematician will findthe book useful as a source of basic results of the theory, open problems, and a comprehensive bibliography of the subject. |
在该图书中搜索
共有 25 个结果,这是第 1-5 个
第xiv页
... graph with three vertices 2.10 A complete graph . . 2.11 Deletion and contraction 2.12 An oriented graph . . 2.13 Not acyclic orientations . • • 423 2228 12 13 25 25 25 29 30 37 48 52 53 55 289 57 58 3.1 A - equivalent but not L ...
... graph with three vertices 2.10 A complete graph . . 2.11 Deletion and contraction 2.12 An oriented graph . . 2.13 Not acyclic orientations . • • 423 2228 12 13 25 25 25 29 30 37 48 52 53 55 289 57 58 3.1 A - equivalent but not L ...
第xv页
Peter Orlik, Hiroaki Terao. 5.10 A flat graphing map 5.11 An admissible graph 5.12 Generators . 5.13 Loop passing 5.14 A pencil of lines . 5.15 Linking • 5.16 The arrangement C * ( 5 ) 5.17 Falk's Linking • 182 184 186 187 . 188 189 206 ...
Peter Orlik, Hiroaki Terao. 5.10 A flat graphing map 5.11 An admissible graph 5.12 Generators . 5.13 Loop passing 5.14 A pencil of lines . 5.15 Linking • 5.16 The arrangement C * ( 5 ) 5.17 Falk's Linking • 182 184 186 187 . 188 189 206 ...
第16页
... graph l of the motion of distinct points in the complex line between times t = 0 and t = = 1 , subject to the condition that the points remain distinct throughout the motion and that the sets of points at t O and t 1 are equal . Thus we ...
... graph l of the motion of distinct points in the complex line between times t = 0 and t = = 1 , subject to the condition that the points remain distinct throughout the motion and that the sets of points at t O and t 1 are equal . Thus we ...
第17页
... graph theory . This section includes a discussion of the chromatic polynomial , a precursor of the characteristic and Poincaré polynomials . Algebras In Chapter 3 let K be a commutative ring . We construct certain algebras over K ...
... graph theory . This section includes a discussion of the chromatic polynomial , a precursor of the characteristic and Poincaré polynomials . Algebras In Chapter 3 let K be a commutative ring . We construct certain algebras over K ...
第22页
... graph theory . This section includes a discussion of the chromatic polynomial , a precursor of the characteristic poly- nomial and the Poincaré polynomial . Many of the definitions and results may be extended to a larger class of ...
... graph theory . This section includes a discussion of the chromatic polynomial , a precursor of the characteristic poly- nomial and the Poincaré polynomial . Many of the definitions and results may be extended to a larger class of ...
目录
1 | |
4 | |
15 | |
22 | |
Examples | 30 |
Algebras | 59 |
The Injective Map AAx AA | 65 |
Supersolvable Arrangements | 80 |
115 | 204 |
Reflection Arrangements | 215 |
A Some Commutative Algebra 271 | 270 |
B Basic Derivations | 279 |
Orbit Types | 289 |
ThreeDimensional Restrictions | 301 |
164 | 310 |
Index | 315 |
其他版本 - 查看全部
常见术语和短语
A₁ affine arrangement algebra A(A arrangement and let assume b₁ basic derivations basic invariants basis for D(A bijection braid arrangement broken circuit called central arrangement choose cohomology complement complex reflection groups complexification compute Corollary Coxeter group defining polynomial Definition deformation retraction degree denote exact sequence Example exterior product fiber finite follows from Lemma follows from Proposition follows from Theorem formula free arrangement free with exp fundamental group G-orbit graph H₁ H₂ homogeneous homotopy type hyperplane arrangement inductively free integers irreducible isomorphism ker(x l-arrangement lattice Lemma Let G linear linearly independent Math matrix maximal element Möbius function modular elements nonempty Note Orbits Poincaré polynomial poset Proof prove real arrangement Recall reflection arrangement restriction result Section set of basic Shephard groups simplicial subset subspace supersolvable Suppose surjective topological unitary reflection group vertex w₁ write