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. Modified Growth Diag ...
Conference paper

Modified Growth Diagrams, Permutation Pivots, and the BWX Map $\phi^*$

Jonathan Bloom (1), Dan Saracino (2)
(1) Department of Mathematics [Dartmouth]
(2) Colgate University
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2011
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)
Proceedings
DOI
10.46298/dmtcs.3018
License
https://about.hal.science/hal-authorisation-v1
Indicators
555
Views
747
Downloads

Modified Growth Diagrams, Permutation Pivots, and the BWX Map $\phi^*$

Jonathan Bloom (1), Dan Saracino (2)
(1) Department of Mathematics [Dartmouth]
(2) Colgate University
Abstract
English
In their paper on Wilf-equivalence for singleton classes, Backelin, West, and Xin introduced a transformation $\phi^*$, defined by an iterative process and operating on (all) full rook placements on Ferrers boards. Bousquet-Mélou and Steingrimsson proved the analogue of the main result of Backelin, West, and Xin in the context of involutions, and in so doing they needed to prove that $\phi^*$ commutes with the operation of taking inverses. The proof of this commutation result was long and difficult, and Bousquet-Mélou and Steingrimsson asked if $\phi^*$ might be reformulated in such a way as to make this result obvious. In the present paper we provide such a reformulation of $\phi^*$, by modifying the growth diagram algorithm of Fomin. This also answers a question of Krattenthaler, who noted that a bijection defined by the unmodified Fomin algorithm obviously commutes with inverses, and asked what the connection is between this bijection and $\phi^*$.
French
Dans leur article sur l'équivalence de Wilf pour les classes de singletons, Backelin, West et Xin ont introduit une transformation $\phi^*$, définie par un processus itératif et opérant sur (tous) les placements complets de tours sur un plateau de Ferrers. Bousquet-Melou et Steingrimsson ont démontré l'analogue du résultat principal de Backelin, West et Xin dans le contexte d'involutions, et pour ce faire ont eu besoin de démontrer que $\phi^*$ commute avec l'opération inverse. La preuve de cette commutativité est longue et difficile, et Bousquet-Melou et Steingrômsson se demandèrent s'il n'était pas possible de reformuler $\phi^*$ de sorte que le resultat devienne évident. Dans le présent article, nous proposons une telle reformulation de $\phi^*$ en modifiant l'algorithme de croissance de diagramme de Fomin. Cette reformulation répond également à une question de Krattenthaler, qui, remarquant qu'une bijection définie par l'algorithme de Fomin non modifié commute évidemment avec l'opération inverse, se demanda quel était le rapport entre cette bijection et $\phi^*$.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • Wilf-equivalence
  • RSK correspondence
  • Growth Diagrams
  • Bijection
  • Permutations
Preview
Loading PDF preview...