Arrangements of HyperplanesSpringer-Verlag, 1992 - 325页 |
在该图书中搜索
共有 18 个结果,这是第 1-3 个
第38页
... Möbius function of the segment [ X , Y ] is the restriction of the Möbius function μA , we have μ ( X , Y ) = μ ( ( Ay ) * ) . Thus it suffices to show the assertion for a central arrangement A , and there it suffices to prove that μ ...
... Möbius function of the segment [ X , Y ] is the restriction of the Möbius function μA , we have μ ( X , Y ) = μ ( ( Ay ) * ) . Thus it suffices to show the assertion for a central arrangement A , and there it suffices to prove that μ ...
第40页
... function ƒ defined on IN and a second function g defined by the formula g ( n ) = f ( d ) . d❘n Can f ( n ) be expressed in terms of g ? Their formula is written today as ( 1 ) n f ( n ) = g ( n ) ... Möbius Function The Möbius Function.
... function ƒ defined on IN and a second function g defined by the formula g ( n ) = f ( d ) . d❘n Can f ( n ) be expressed in terms of g ? Their formula is written today as ( 1 ) n f ( n ) = g ( n ) ... Möbius Function The Möbius Function.
第42页
... Möbius function of L. Note that u ( x , x ) 1 for all x Є L and if x < y , = then μ = 8 implies μ * 5 ( x , y ) = Σ μ ( α , 2 ) ς ( 2,3 ) x≤z≤y = Σ μ ( x , z ) r≤x≤y = 0 . In order to recover the number theoretic Möbius function ...
... Möbius function of L. Note that u ( x , x ) 1 for all x Є L and if x < y , = then μ = 8 implies μ * 5 ( x , y ) = Σ μ ( α , 2 ) ς ( 2,3 ) x≤z≤y = Σ μ ( x , z ) r≤x≤y = 0 . In order to recover the number theoretic Möbius function ...
其他版本 - 查看全部
常见术语和短语
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