Skip to content

DivisorLattice ​

The poset of divisors of nn ordered by divisibility, on which MoebiusFunction recovers the classical number-theoretic μ\mu.

DivisorLattice(n)the divisors of nn ordered by divisibility
Typed signatures
TypePackageApplies
(integer) -> expression<DivisorLattice>incidencealways

Domain: Incidence algebras

Examples

Basic #
live ↗
InPosetElements(DivisorLattice(12))\mathrm{PosetElements}(\mathrm{DivisorLattice}(12))Out[1,2,3,4,6,12]\bigl\lbrack1, 2, 3, 4, 6, 12\bigr\rbrack

μ(30)=−1\mu(30)=-1

live ↗
InMoebiusFunction(DivisorLattice(30),1,30)\mathrm{MoebiusFunction}(\mathrm{DivisorLattice}(30), 1, 30)Out−1-1
About
Examples2

See also: IncidenceAlgebra, PosetElements, MoebiusFunction