[go: up one dir, main page]

login
Revision History for A317655 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Number of free pure symmetric multifunctions with leaves a multiset whose multiplicities are the integer partition with Heinz number n.
(history; published version)
#8 by Susanna Cuyler at Fri Aug 03 08:17:06 EDT 2018
STATUS

proposed

approved

#7 by Gus Wiseman at Fri Aug 03 05:37:32 EDT 2018
STATUS

editing

proposed

#6 by Gus Wiseman at Fri Aug 03 05:36:47 EDT 2018
COMMENTS

A free pure symmetric multifunction f in EPSM is either (case 1) f = the leaf symbol "o", a positive integer, or (case 2) f = an expression of the form h[g_1, ..., g_k] where k > 0, h is in EPSM, each of the g_i for i = 1, ..., k is in EPSM, and for i < j we have g_i <= g_j under a canonical total ordering of EPSM, such as the Mathematica ordering of expressions.

#5 by Gus Wiseman at Fri Aug 03 05:35:37 EDT 2018
COMMENTS

A free pure symmetric multifunction f in PSM EPSM is either (case 1) f = the leaf symbol "o", or (case 2) f = an expression of the form h[g_1, ..., g_k] where k > 0, h is in PSM, EPSM, each of the g_i for i = 1, ..., k is in PSM, EPSM, and for i < j we have g_i <= g_j under a canonical total ordering of PSM, EPSM, such as the Mathematica ordering of expressions.

#4 by Gus Wiseman at Fri Aug 03 05:35:05 EDT 2018
COMMENTS

The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).

#3 by Gus Wiseman at Fri Aug 03 04:59:16 EDT 2018
#2 by Gus Wiseman at Fri Aug 03 04:15:19 EDT 2018
NAME

allocated for Gus WisemanNumber of free pure symmetric multifunctions with leaves a multiset whose multiplicities are the integer partition with Heinz number n.

DATA

0, 1, 1, 2, 3, 8, 10, 15, 50, 35, 37, 96, 144, 160, 299, 184, 589, 840, 2483, 578, 1729, 750, 10746, 1627, 2246, 3578, 9357, 3367, 47420, 6397, 212668, 3155, 9818, 17280, 15666, 18250, 966324, 84232, 54990, 12471, 4439540, 45015

OFFSET

1,4

COMMENTS

A free pure symmetric multifunction f in PSM is either (case 1) f = the leaf symbol "o", or (case 2) f = an expression of the form h[g_1, ..., g_k] where k > 0, h is in PSM, each of the g_i for i = 1, ..., k is in PSM, and for i < j we have g_i <= g_j under a canonical total ordering of PSM, such as the Mathematica ordering of expressions.

EXAMPLE

The a(6) = 8 free pure symmetric multifunctions:

1[1[2]]

1[2[1]]

2[1[1]]

1[1][2]

1[2][1]

2[1][1]

1[1,2]

2[1,1]

MATHEMATICA

sps[{}]:={{}}; sps[set:{i_, ___}]:=Join@@Function[s, Prepend[#, s]&/@sps[Complement[set, s]]]/@Cases[Subsets[set], {i, ___}];

mps[set_]:=Union[Sort[Sort/@(#/.x_Integer:>set[[x]])]&/@sps[Range[Length[set]]]];

exprUsing[m_]:=exprUsing[m]=If[Length[m]==0, {}, If[Length[m]==1, {First[m]}, Join@@Cases[Union[Table[PR[m[[s]], m[[Complement[Range[Length[m]], s]]]], {s, Take[Subsets[Range[Length[m]]], {2, -2}]}]], PR[h_, g_]:>Join@@Table[Apply@@@Tuples[{exprUsing[h], Union[Sort/@Tuples[exprUsing/@p]]}], {p, mps[g]}]]]];

got[y_]:=Join@@Table[Table[i, {y[[i]]}], {i, Range[Length[y]]}];

primeMS[n_]:=If[n==1, {}, Flatten[Cases[FactorInteger[n], {p_, k_}:>Table[PrimePi[p], {k}]]]];

Table[Length[exprUsing[got[Reverse[primeMS[n]]]]], {n, 40}]

KEYWORD

allocated

nonn

AUTHOR

Gus Wiseman, Aug 03 2018

STATUS

approved

editing

#1 by Gus Wiseman at Fri Aug 03 04:15:19 EDT 2018
NAME

allocated for Gus Wiseman

KEYWORD

allocated

STATUS

approved