Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi

A short (lattice) path from beating your kids to permutation statistics (CROSBI ID 128061)

Prilog u časopisu | izvorni znanstveni rad

Došlić, Tomislav A short (lattice) path from beating your kids to permutation statistics // The College mathematics journal, 1 (2005), 1; 5-14-x

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

Podaci o izdanju

1 (1)

2005.

5-14-x

objavljeno

0746-8342

1931-1346

Povezanost rada

Matematika