Journal
DISCRETE MATHEMATICS
Volume 344, Issue 12, Pages -Publisher
ELSEVIER
DOI: 10.1016/j.disc.2021.112599
Keywords
Riffle shuffle; Carries process; Determinantal formula
Categories
Ask authors/readers for more resources
This paper discusses a colored permutation group and derives a determinantal formula for the probability of finding descents at given positions, with proof based on a bijection between the set of shuffles and non-intersecting lattice paths.
We consider a generalized riffle shuffle on the colored permutation group G(p,n) and derive a determinantal formula for the probability of finding descents at given positions, proof of which is based on the bijection between the set of shuffles in question and that of non-intersecting lattice paths. (C) 2021 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
