François Boulier ; Florent Hivert ; Daniel Krob ; Jean-Christophe Novelli - Pseudo-Permutations II: Geometry and Representation Theory

dmtcs:2299 - Discrete Mathematics & Theoretical Computer Science, January 1, 2001, DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001) - https://doi.org/10.46298/dmtcs.2299
Pseudo-Permutations II: Geometry and Representation TheoryArticle

Authors: François Boulier 1; Florent Hivert ORCID2; Daniel Krob 3; Jean-Christophe Novelli 4,2

In this paper, we provide the second part of the study of the pseudo-permutations. We first derive a complete analysis of the pseudo-permutations, based on hyperplane arrangements, generalizing the usual way of translating the permutations. We then study the module of the pseudo-permutations over the symmetric group and provide the characteristics of this action.


Volume: DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001)
Section: Proceedings
Published on: January 1, 2001
Imported on: November 21, 2016
Keywords: Hyperplane Arrangements,Symmetric Group,Permutations,q-analogs,[INFO] Computer Science [cs],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

1 Document citing this article

Consultation statistics

This page has been seen 442 times.
This article's PDF has been downloaded 260 times.