Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
PeterBurbery`Combinatorics`
SubsetIndex  |
|
| | ||||
Details and Options
Examples
(7)
Basic Examples
(3)
Find the index of a tuple:
In[1]:=
 | SubsetIndex |
Out[1]=
4
The following 3-subset sequence can be extended to infinity:
In[1]:=
SortBy[Subsets[Range[0,4],{3}],Reverse]
Out[1]=
{{0,1,2},{0,1,3},{0,2,3},{1,2,3},{0,1,4},{0,2,4},{1,2,4},{0,3,4},{1,3,4},{2,3,4}}
The function returns indices of one to ten for these subsets:
In[2]:=
| SubsetIndex |
Out[2]=
{1,2,3,4,5,6,7,8,9,10}
Any strictly increasing list of nonnegative integers can be considered as a subset with a unique index:
In[1]:=
| SubsetIndex |
Out[1]=
{182000,182047,182094,182141,182188,182235,182282,182329,182376}
The result above is a subset with a unique index:
In[2]:=
| SubsetIndex |
Out[2]=
615009470516515725210337949212442416450394
Scope
(3)
Neat Examples
(1)
 |
|
 |
|
|
""