相关论文: Excedance numbers for permutations in complex refl…

We revise the enumeration of the imprimitive rank two quaternionic reflection groups, adding missing groups and establishing isomorphisms between groups in the published tables. The isomorphisms are obtained as a consequence of the…

We compute Ext-groups between classical exponential functors (i.e. symmetric, exterior or divided powers) and their Frobenius twists. Our method relies on bar constructions, and bridges these Ext-groups with the homology of Eilenberg-Mac…

Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…

Let $A(n,m)$ denote the Eulerian numbers, which count the number of permutations on $[n]$ with exactly $m$ descents. It is well known that $A(n,m)$ also counts the number of permutations on $[n]$ with exactly $m$ excedances. In this report,…

Initiated by Davis, Nelson, Petersen and Tenner (2018), the enumerative study of pinnacle sets of permutations has attracted a fair amount of attention recently. In this article, we provide a recurrence that can be used to compute…

In this paper we introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the Le-diagrams of Alex Postnikov. The…

A classic problem in enumerative combinatorics is to count the number of derangements, that is, permutations with no fixed point. Inspired by a recent generalization to facet derangements of the hypercube by Gordon and McMahon, we…

In this paper, we first introduce the number of signed permutations with exactly $k$ inversions, which is denoted by $i_B(n,k)$ and called \textit{Mahonian numbers of type $B$}. Then we provide a recurrence relation for the Mahonian numbers…

In this article it is determined which integral reflection representations of the symmetric groups and the primitive complex reflection groups of degree $2$ have rings of invariants which are isomorphic to polynomial rings.

We survey the existing parts of a classification of finite groups generated by orthogonal transformations in a finite-dimensional Euclidean space whose fixed point subspace has codimension one or two and extend it to a complete…

This work is devoted to the study of first order linear problems with involution and periodic boundary value conditions. We first prove a correspondence between a large set of such problems with different involutions to later focus our…

We extend the usual notion of fully commutative elements from the Coxeter groups to the complex reflection groups. Then we decompose the sets of fully commutative elements into natural subsets according to their combinatorial properties,…

Complex braid groups are the natural generalizations of braid groups associated to arbitrary (finite) complex reflection groups. We investigate several methods for computing the homology of these groups. In particular, we get the Poincar\'e…

In this paper we find some exponential formulas for the Betti numbers of the De Concini-Procesi minimal wonderful models Y_{G(r,p,n)} associated to the complex reflection groups G(r,p,n). Our formulas are different from the ones already…

We survey a research program on the strong convergence of unitary and permutation representations of discrete groups. We also take the opportunity to flesh out details that have not appeared elsewhere.

Let $\mathcal A$ be a hyperplane arrangement in a vector space $V$ and $G \leq GL(V)$ a group fixing $\mathcal A$. In case when $G$ is a complex reflection group and $\mathcal A=\mathcal A(G)$ is its reflection arrangement in $V$, Douglass,…

We describe a collection of computer scripts written in PARI/GP to compute, for reflection groups determined by finite-volume polyhedra in $\mathbb{H}^3$, the commensurability invariants known as the invariant trace field and invariant…

We study new statistics on permutations that are variations on the descent and the inversion statistics. In particular, we consider the alternating descent set of a permutation sigma = sigma_1sigma_2...sigma_n defined as the set of indices…

We present a simple formula for the expected number of inversions in a permutation of size $n$ obtained by applying $t$ random (not necessarily adjacent) transpositions to the identity permutation. More general, for any finite irreducible…

We study normal reflection subgroups of complex reflection groups. Our approach leads to a refinement of a theorem of Orlik and Solomon to the effect that the generating function for fixed-space dimension over a reflection group is a…