Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
PeterBurbery`Combinatorics`
FindAscentPositions |
|
| | ||||
Details and Options
Examples
(3)
Basic Examples
(1)
Consider this random permutation.
In[1]:=
randomPermutation=RandomSample[Range[9]]
Out[1]=
{6,7,1,8,5,3,2,9,4}
Find the positions, that is the indices, of the ascents. An index i is an ascent index if <.
a
i
a
i+1
In[2]:=
 | FindAscentPositions |
Out[2]=
{{1},{3},{7}}
Find the ascents.
In[3]:=
| FindAscentElements |
Out[3]=
{{6,7},{1,8},{2,9}}
Write this with Inactive.
In[4]:=
Inactive[Less]@@@
[randomPermutation]
| FindAscentElements |
Out[4]=
{6<7,1<8,2<9}
Are all these statements true?
In[5]:=
AllTrue[Activate[#]&]Inactive[Less]@@@
[randomPermutation]
| FindAscentElements |
Out[5]=
True
Reverse with greater:
In[6]:=
Inactive[Greater]@@@Map[Reverse]
[randomPermutation]
| FindAscentElements |
Out[6]=
{7>6,8>1,9>2}
Are all these statements true?
In[7]:=
AllTrue[Activate[#]&]Inactive[Greater]@@@Map[Reverse]
[randomPermutation]
| FindAscentElements |
Out[7]=
True
Scope
(1)
Options
(1)
 |
|
 |
|
""