Enumeration by kernel positions for strongly Bernoulli type truncation games on words
type: Item
instance of: scholarly article
title: Enumeration by kernel positions for strongly Bernoulli type truncation games on words
zbMATH Open document ID: 1231.05012
published in: Journal of Combinatorial Theory. Series A
publication date: 2010-09-27T00:00:00Z
full work available at URL: https://arxiv.org/abs/0912.0573
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 91A46
Mathematics Subject Classification ID: 11B68
zbMATH DE Number: 5791964
zbMATH Keywords: Bernoulli polynomials
zbMATH Keywords: progressively finite games
zbMATH Keywords: kernel position
zbMATH Keywords: enumerative combinatorics
zbMATH Keywords: generating functions
describes a project that uses: OEIS
MaRDI profile type: Publication
OpenAlex ID: W1977354656
arXiv ID: 0912.0573
cites work: Structure of the Malvenuto-Reutenauer Hopf algebra of permutations
cites work: Q5658104
cites work: Q4769056
cites work: Enumeration by kernel positions
cites work: Generating indecomposable permutations
cites work: Q5585020
cites work: Order structure on the algebra of permutations and of planar binary trees
cites work: Duality between quasi-symmetric functions and the Solomon descent algebra
cites work: The On-Line Encyclopedia of Integer Sequences
cites work: Q4844910
cites work: Q4344108
cites work: Q4236280
DOI: 10.1016/J.JCTA.2010.01.003
author: Gabor Hetyei
description: scientific article