A bijection for ordered factorizations (Q914675): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q105602959, #quickstatements; #temporary_batch_1714653054045 |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0097-3165(90)90040-4 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2037618871 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q105602959 / rank | |||
Normal rank |
Latest revision as of 13:31, 2 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A bijection for ordered factorizations |
scientific article |
Statements
A bijection for ordered factorizations (English)
0 references
1990
0 references
An ordered factorization of n is a representation of n as a product of integers \(\geq 2\); two such factorizations are considered the same only if they agree in both factors and order. Let \(\Psi\) (n) denote the class of all ordered factorizations \(\psi\) of n; and write \(k=k(\psi)\) for the number of factors in \(\psi\). The authors give two short proofs of the result: \(\sum_{\psi \in \Psi (n)}(-1)^{k(\psi)}=\mu (n)\) where \(\mu\) is the Möbius function. The first proof uses generating functions; the second exhibits an explicit bijection.
0 references
ordered factorization
0 references
Möbius function
0 references
generating functions
0 references