A short (lattice) path from beating your kids to permutation statistics (CROSBI ID 128061)
Prilog u časopisu | izvorni znanstveni rad
Podaci o odgovornosti
Došlić, Tomislav
engleski
A short (lattice) path from beating your kids to permutation statistics
Motivated by a simple card guessing game, we consider the problem of enumerating grand Dyck lattice paths with respect to the number of turns. An explicit solution to this problem is given and subsequently applied to enumeration of permutations of $\{; ; 1, \ldots , n \}; ; $ according to the number of parity changes. Some properties of the enumerating sequences, such as their symmetry, unimodality, and the position of the maximal value are briefly investigated, and some further possibilities of research have been suggested.
lattice path; permutation; permutation statistics
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano