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

DOI10.1016/j.jcta.2010.01.003zbMath1231.05012arXiv0912.0573OpenAlexW1977354656MaRDI QIDQ1957964

No author found.

Publication date: 27 September 2010

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0912.0573

zbMATH Keywords

generating functionsBernoulli polynomialsenumerative combinatoricskernel positionprogressively finite games

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) 2-person games (91A05) Bernoulli and Euler numbers and polynomials (11B68) Combinatorial games (91A46)

Related Items (5)

On $q$-hypergeometric Bernoulli polynomials and numbers ⋮ Timber game as a counting problem ⋮ Ordinal Sums, Clockwise Hackenbush, and Domino Shave ⋮ Unnamed Item ⋮ Sterling Stirling play

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structure of the Malvenuto-Reutenauer Hopf algebra of permutations
• Enumeration by kernel positions
• Order structure on the algebra of permutations and of planar binary trees
• Duality between quasi-symmetric functions and the Solomon descent algebra
• Generating indecomposable permutations

This page was built for publication: Enumeration by kernel positions for strongly Bernoulli type truncation games on words