OFFSET
1,2
COMMENTS
We define the brute-force normalization of a multiset of multisets to be obtained by first normalizing so that the vertices cover an initial interval of positive integers, then applying all permutations to the vertex set, and finally taking the least representative, where the ordering of multisets is first by length and then lexicographically.
For example, 15301 is the MM-number of {{3},{1,2},{1,1,4}}, which has the following normalizations together with their MM-numbers:
Brute-force: 43287: {{1},{2,3},{2,2,4}}
Lexicographic: 43143: {{1},{2,4},{2,2,3}}
VDD: 15515: {{2},{1,3},{1,1,4}}
MM: 15265: {{2},{1,4},{1,1,3}}
A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. The multiset of multisets with MM-number n is formed by taking the multiset of prime indices of each part of the multiset of prime indices of n. For example, the prime indices of 78 are {1,2,6}, so the multiset of multisets with MM-number 78 is {{},{1},{1,2}}.
MATHEMATICA
brute[m_]:=If[Union@@m!={}&&Union@@m!=Range[Max@@Flatten[m]], brute[m/.Rule@@@Table[{(Union@@m)[[i]], i}, {i, Length[Union@@m]}]], First[Sort[brute[m, 1]]]];
brute[m_, 1]:=Table[Sort[Sort/@(m/.Rule@@@Table[{i, p[[i]]}, {i, Length[p]}])], {p, Permutations[Union@@m]}];
Table[Map[Times@@Prime/@#&, brute[primeMS/@primeMS[n]], {0, 1}], {n, 100}]
CROSSREFS
This sequence is idempotent and its image/fixed points are A330104.
Non-isomorphic multiset partitions are A007716.
Other normalizations: A330061 (VDD MM), A330101 (brute-force BII), A330102 (VDD BII), A330105 (brute-force MM).
Other fixed points:
- Brute-force: A330104 (multisets of multisets), A330107 (multiset partitions), A330099 (set-systems).
- Lexicographic: A330120 (multisets of multisets), A330121 (multiset partitions), A330110 (set-systems).
- BII: A330109 (set-systems).
KEYWORD
nonn
AUTHOR
Gus Wiseman, Dec 02 2019
STATUS
approved