Enumeration by kernel positions for strongly Bernoulli type truncation games on words

Details Enumeration by kernel positions for strongly Bernoulli type truncation games on words Enumeration by kernel positions for strongly Bernoulli type truncation games on words

2009-12-03

arxiv.org/abs/0912.0573v1

Mathematics

Combinatorics

Scientific paper

We find the winning strategy for a class of truncation games played on words. As a consequence of the present author's recent results on some of these games we obtain new formulas for Bernoulli numbers and polynomials of the second kind and a new combinatorial model for the number of connected permutations of given rank. For connected permutations, the decomposition used to find the winning strategy is shown to be bijectively equivalent to King's decomposition, used to recursively generate a transposition Gray code of the connected permutations.

Affiliated with

Also associated with

No associations

Rating

Enumeration by kernel positions for strongly Bernoulli type truncation games on words does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Enumeration by kernel positions for strongly Bernoulli type truncation games on words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumeration by kernel positions for strongly Bernoulli type truncation games on words will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-516852