Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Pseudo-Permutations ...
Conference paper

Pseudo-Permutations II: Geometry and Representation Theory

François Boulier ORCID (1), Florent Hivert ORCID (2), Daniel Krob (3), Jean-Christophe Novelli (1) (2)
(1) Laboratoire d'Informatique Fondamentale de Lille
(2) Laboratoire d'Informatique Gaspard-Monge
(3) Laboratoire d'informatique Algorithmique : Fondements et Applications
Download article
Open on HAL
Imported on
November 21, 2016
Published on
December 31, 2000
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001)
Proceedings
DOI
10.46298/dmtcs.2299
License
https://about.hal.science/hal-authorisation-v1
Indicators
800
Views
565
Downloads

Pseudo-Permutations II: Geometry and Representation Theory

François Boulier ORCID (1), Florent Hivert ORCID (2), Daniel Krob (3), Jean-Christophe Novelli (1) (2)
(1) Laboratoire d'Informatique Fondamentale de Lille
(2) Laboratoire d'Informatique Gaspard-Monge
(3) Laboratoire d'informatique Algorithmique : Fondements et Applications
Abstract
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.
Keywords
  • [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]
  • Hyperplane Arrangements
  • Symmetric Group
  • Permutations
  • q-analogs
Cited by

Source: OpenCitations

  • Skew Metrics Valued in Sugihara Semigroups

    Lecture notes in computer science

    Authors : Luigi Santocanale ORCID

    Journal reference : Volume , 2021, pp. 396-412

    DOI : 10.1007/978-3-030-88701-8_24
Preview
Loading PDF preview...