Naslov
A short (lattice) path from beating your kids to permutation statistics

Autori
Došlić, Tomislav

Izvornik
The College mathematics journal (0746-8342) 1 (2005), 1; 5-14

Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni

Ključne riječi
lattice path; permutation; permutation statistics

Sažetak
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.

Izvorni jezik
Engleski

Znanstvena područja
Matematika

POVEZANOST RADA