A cyclic analogue of Stanley's shuffling theorem (Q2094891)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7613675
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A cyclic analogue of Stanley's shuffling theorem |
scientific article; zbMATH DE number 7613675 |
Statements
A cyclic analogue of Stanley's shuffling theorem (English)
0 references
8 November 2022
0 references
Summary: We introduce the cyclic major index of a cyclic permutation and give a bivariate analogue of the enumerative formula for the cyclic shuffles with a given cyclic descent number due to \textit{R. M. Adin} et al. [Isr. J. Math. 243, No. 1, 437--500 (2021; Zbl 1471.05112)], which can be viewed as a cyclic analogue of Stanley's shuffling theorem. This gives an answer to a question of Adin et al. [loc. cit.], which has been posed by \textit{R. Domagalski} et al. [Sémin. Lothar. Comb. 85, B85d, 11 p. (2021; Zbl 1505.05003)] again.
0 references
0.8544389009475708
0 references
0.7785978317260742
0 references
0.7779467701911926
0 references
0.7654119729995728
0 references
0.7521809935569763
0 references
