We introduce the concept of a bounded below set in a lattice. This can be used to give a generalization of Rota's broken circuit theorem to any finite lattice. We then show how this result can be used to compute and combinatorially explain the Mo bius function in various examples including non-cross
On the Möbius Algebra of Geometric Lattices
✍ Scribed by G. Etienne
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 188 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper, a formula is given for the Mo bius number +(1, S n ) of the subgroup lattice of the symmetric group S n . This formula involves the Mo bius numbers of certain transitive subgroups of S n . When n has at most two (not necessarily distinct) prime factors or n is a power of two, this for
The generalized Mo¨bius function and Mo¨bius inversion formula are applied to a multiplicative semigroup. A general mathematical method based on this Mo¨bius inversion is presented to solve inversion problems of expansions with unequally weighted terms. By this method, all the inverse lattice proble
We give some new invariant characteristic properties of Mobius transformations by means of their mapping properties.
In this paper, we give some invariant characteristic properties of a certain class of Mobius transformations by means of their mapping properties.
We provide a solution to the important problem of constructing complete independent sets of Euclidean and affine invariants for algebraic curves. We first simplify algebraic curves through polynomial decompositions and then use some classical geometric results to construct functionally independent s