Related papers: Excedance numbers for permutations in complex refl…
A finite subgroup of $GL(n,\mathbb C)$ is involutory if the sum of the dimensions of its irreducible complex representations is given by the number of absolute involutions in the group. A uniform combinatorial model is constructed for all…
We present a simplified variant of Biane's bijection between permutations and 3-colored Motzkin paths with weight that keeps track of the inversion number, excedance number and a statistic so-called depth of a permutation. This generalizes…
We study the symmetry groups and winding numbers of planar curves obtained as images of weighted sums of exponentials. More generally, we study the image of the complex unit circle under a finite or infinite Laurent series using a…
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…
Nonexpansive mappings play a central role in modern optimization and monotone operator theory because their fixed points can describe solutions to optimization or critical point problems. It is known that when the mappings are sufficiently…
We investigate extreme values of Mahonian and Eulerian distributions arising from counting inversions and descents of random elements of finite Coxeter groups. To this end, we construct a triangular array of either distribution from a…
This paper aims to systematically study mystic reflection groups that emerged independently in the paper [Selecta Math. (N.S.) 14 (2009), 325-372, arXiv:0806.0867] by the authors and in the paper [Algebr. Represent. Theory 13 (2010),…
A four-variable distribution on permutations is derived, with two dual combinatorial interpretations. The first one includes the number of fixed points "fix", the second the so-called "pix" statistic. This shows that the duality between…
Not long ago, Claesson and Mansour proposed some conjectures about the enumeration of the permutations avoiding more than three Babson - Steingr\'\i msson patterns (generalized patterns of type $(1,2)$ or $(2,1)$). The avoidance of one, two…
This is my dissertation. Its research object is a symmetric group of permutations acting on a finite set. The density of permutations with a given cycle structure pattern is explored when the group order tends to infinity. New and sharper…
The study of pinnacle sets has been a recent area of interest in combinatorics. Given a permutation, its pinnacle set is the set of all values larger than the values on either side of it. Largely inspired by conjectures posed by Davis,…
Let $X$ be a nonempty real variety that is invariant under the action of a reflection group $G$. We conjecture that if $X$ is defined in terms of the first $k$ basic invariants of $G$ (ordered by degree), then $X$ meets a $k$-dimensional…
The purpose of this paper is to combine classical methods from transcendental number theory with the technique of restriction to real scalars. We develop a conceptual approach relating transcendence properties of algebraic groups to results…
In the classical theorems of extreme value theory the limits of suitably rescaled maxima of sequences of independent, identically distributed random variables are studied. So far, only affine rescalings have been considered. We show,…
We obtain a local central limit theorem for cocycles associated with a class of non abelian and non compact group extensions of Gibbs Markov maps. This class consists of multidimensional infinite dihedral groups. Unlike in the set up of the…
The extension of pattern avoidance from ordinary permutations to those on multisets gave birth to several interesting enumerative results. We study permutations on regular multisets, i.e., multisets in which each element occurs the same…
We investigate the generalized involution models of the projective reflection groups $G(r,p,q,n)$. This family of groups parametrizes all quotients of the complex reflection groups $G(r,p,n)$ by scalar subgroups. Our classification is…
It is shown that, under mild conditions, a complex reflection group $G(r,p,n)$ may be decomposed into a set-wise direct product of cyclic subgroups. This property is then used to extend the notion of major index and a corresponding Hilbert…
The classical derangement numbers count fixed point-free permutations. In this paper we study the enumeration problem of generalized derangements, when some of the elements are restricted to be in distinct cycles in the cycle decomposition.…
A formula of Stembridge states that the permutation peak polynomials and descent polynomials are connected via a quadratique transformation. The aim of this paper is to establish the cycle analogue of Stembridge's formula by using cycle…