scispace - formally typeset
Open AccessJournal ArticleDOI

Statistics on wreath products, perfect matchings, and signed words

Reads0
Chats0
TLDR
A natural extension of Adin, Brenti, and Roichman's major-index statistic nmaj on signed permutations to wreath products of a cyclic group with the symmetric group is introduced and "insertion lemmas" are derived which allow to give simple bijective proofs that this extension has the same distribution as another statistic on wreath Products.
About
This article is published in European Journal of Combinatorics.The article was published on 2005-08-01 and is currently open access. It has received 60 citations till now. The article focuses on the topics: Major index & Permutation.

read more

Citations
More filters
Journal ArticleDOI

Advanced Determinant Calculus: A Complement

TL;DR: In this article, Krattenthaler and Petersson present a list of determinant evaluations which have been found since the appearance of the previous article, or which they failed to mention there, including several conjectures and open problems.
Posted Content

Advanced Determinant Calculus: A Complement

TL;DR: In this paper, Almkvist and Petersson present a complement to their previous article "Advanced Determinant Calculus" (SEMinaire Lotharingien Combin. 42 (1999), Article B42q, 67 pp.).
Journal ArticleDOI

On derangement polynomials of type B. II

TL;DR: In this paper, a type B derangement polynomial was defined by q-counting derangements by the number of excedances in the hyperoctahedral group B"n.
References
More filters
Book

The Art of Computer Programming

TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Book

Enumerative Combinatorics

R P Stanley

The Art in Computer Programming

Andrew Hunt, +1 more
TL;DR: Here the authors haven’t even started the project yet, and already they’re forced to answer many questions: what will this thing be named, what directory will it be in, what type of module is it, how should it be compiled, and so on.
Book

The theory of partitions

TL;DR: The elementary theory of partitions and partitions in combinatorics can be found in this article, where the Hardy-Ramanujan-Rademacher expansion of p(n) is considered.
Related Papers (5)