Related papers: Higher Lie characters and cyclic descent extension…

We prove an identity conjectured by Adin and Roichman involving the descent set of $\lambda$-unimodal cyclic permutations. These permutations appear in formulas for characters of certain representations of the symmetric group. Such formulas…

We introduce a notion of {\em cyclic Schur-positivity} for sets of permutations, which naturally extends the classical notion of Schur-positivity, and it involves the existence of a bijection from permutations to standard Young tableaux…

The notion of descent set, for permutations as well as for standard Young tableaux (SYT), is classical. Cellini introduced a natural notion of {\em cyclic descent set} for permutations, and Rhoades introduced such a notion for SYT --- but…

It is known that the number of permutations in the symmetric group $S_{2n}$ with cycles of odd lengths only is equal to the number of permutations with cycles of even lengths only. We prove a refinement of this equality, involving descent…

We investigate permutations in terms of their cycle structure and descent set. To do this, we generalize the classical bijection of Gessel and Reutenauer to deal with permutations that have some ascending and some descending blocks. We then…

It is known that, when $n$ is even, the number of permutations of $\{1,2,\dots,n\}$ all of whose cycles have odd length equals the number of those all of whose cycles have even length. Adin, Heged\H{u}s and Roichman recently found a…

The distribution of descents in fixed conjugacy classes of $S_n$ has been studied, and it is shown that its moments have interesting properties. Fulman proved that the descent numbers of permutations in conjugacy classes with large cycles…

In this paper, we consider the moments of statistics on conjugacy classes of the colored permutation groups $\mathfrak{S}_{n,r}=\mathbb{Z}_r\wr \mathfrak{S}_n$. We first show that any fixed moment coincides on all conjugacy classes where…

Let k be a commutative algebra with the field of the rational numbers included in k and let (E,p,i) be a cleft extension of A. We obtain a new mixed complex, simpler than the canonical one, giving the Hochschild and cyclic homologies of E…

We study the cycle structure of words in several random permutations. We assume that the permutations are independent and that their distribution is conjugation invariant, with a good control on their short cycles. If, after successive…

Higher Lie characters form a distinguished family of symmetric group characters, which appear in many areas of algebra and combinatorics. An old open problem of Thrall is to decompose them into irreducibles. We propose a novel asymptotic…

Let $H$ be an extension of a finite group $Q$ by a finite group $G$. Inspired by the results of duality theorems for \'etale gerbes on orbifolds, we describe the number of conjugacy classes of $H$ that maps to the same conjugacy class of…

This paper explores the cohomology of linear cycle sets, focusing on extensions of a specific linear cycle set H by an abelian group I. We derive explicit formulas for the second cohomology group, which classifies these extensions, and…

In this paper we study the cycle descent statistic on permutations. Several involutions on permutations and derangements are constructed. Moreover, we construct a bijection between negative cycle descent permutations and Callan perfect…

The study of pattern containment and avoidance for linear permutations is a well-established area of enumerative combinatorics. A cyclic permutation is the set of all rotations of a linear permutation. Callan initiated the study of…

Arc permutations, which were originally introduced in the study of triangulations and characters, have recently been shown to have interesting combinatorial properties. The first part of this paper continues their study by providing signed…

Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…

In a recent letter, new representations were proposed for the pair of sequences ($\gamma,\delta$), as defined formally by Bailey in his famous lemma. Here we extend and prove this result, providing pairs ($\gamma,\delta$) labelled by the…

Cyclic words are equivalence classes of cyclic permutations of ordinary words. When a group is given by a rewriting relation, a rewriting system on cyclic words is induced, which is used to construct algorithms to find minimal length…

In this work we provide alternative formulations of the concepts of lambda theory and extensional theory without introducing the notion of substitution and the sets of all, free and bound variables occurring in a term. We also clarify the…