9846

Eulerian Numbers versus Stirling Numbers of the First Kind

In a permutation , an ascent is a pair with . The Eulerian number counts the number of permutations of with exactly ascents, . Alternatively, counts the number of permutations of with exactly ' permutation runs, . For example, the permutation has the three ascents , , and and the two runs and .
The unsigned Stirling number of the first kind counts the number of permutations of whose cycle decomposition has cycles. For example, the permutation is the mapping , , , , , so its cycle decomposition is with four cycles.
Both types of numbers count the permutations of in different ways. Define the number to count the number of permutations that have cycles and runs. This Demonstration lays out these numbers in a square; the row sums are and the column sums are ; the sums of either of those is .

SNAPSHOTS

  • [Snapshot]
  • [Snapshot]
  • [Snapshot]

DETAILS

The 1 in the first column comes from the identity permutation that has cycles row) and one run (first column).
The 1 in the last column comes from the permutation . It has runs of length 1. Its cycle decomposition is for even and for odd, so has cycles.
If a permutation has many cycles, they chain many elements together into longer but fewer runs, which explains the zeros in the lower-right part of the tables.
Let us see why the two nonzero entries in the second-to-last row for are and . A permutation with cycles consists of one transposition and singletons (fixed points); there are such permutations. If the pair in the transposition are neighbors, there are two runs; there are ways to form a neighboring pair. If the pair are not neighbors, there are three runs and such pairs.
Ignoring the first two squares and the zeros at the beginning and end, the first rows form the following triangle of numbers, which is is symmetric up to except for two rows. The rows appear to start with the number of binary Lyndon words of length (A001037) and appear to end with a sequence directly related to A038063.
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.









 
RELATED RESOURCES
Mathematica »
The #1 tool for creating Demonstrations
and anything technical.
Wolfram|Alpha »
Explore anything with the first
computational knowledge engine.
MathWorld »
The web's most extensive
mathematics resource.
Course Assistant Apps »
An app for every course—
right in the palm of your hand.
Wolfram Blog »
Read our views on math,
science, and technology.
Computable Document Format »
The format that makes Demonstrations
(and any information) easy to share and
interact with.
STEM Initiative »
Programs & resources for
educators, schools & students.
Computerbasedmath.org »
Join the initiative for modernizing
math education.
Step-by-step Solutions »
Walk through homework problems one step at a time, with hints to help along the way.
Wolfram Problem Generator »
Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet.
Wolfram Language »
Knowledge-based programming for everyone.
Powered by Wolfram Mathematica © 2014 Wolfram Demonstrations Project & Contributors  |  Terms of Use  |  Privacy Policy  |  RSS Give us your feedback
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to Mathematica Player 7EX
I already have Mathematica Player or Mathematica 7+