Yannic Vargas - Hopf algebra of permutation pattern functions

dmtcs:2446 - Discrete Mathematics & Theoretical Computer Science, January 1, 2014, DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014) - https://doi.org/10.46298/dmtcs.2446
Hopf algebra of permutation pattern functions

Authors: Yannic Vargas 1

  • 1 Laboratoire de combinatoire et d'informatique mathématique [Montréal]

We study permutation patterns from an algebraic combinatorics point of view. Using analogues of the classical shuffle and infiltration products for word, we define two new Hopf algebras of permutations related to the notion of permutation pattern. We show several remarkable properties of permutation patterns functions, as well their occurrence in other domains.

https://doi.org/10.46298/dmtcs.2446
Source: HAL:hal-01207565v1
Volume: DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)
Section: Proceedings
Published on: January 1, 2014
Imported on: November 21, 2016
Keywords: Pattern permutation,shuffle,infiltration,bialgebra,Hopf algebra,representative function,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo ARXIV 1805.08255
Source : ScholeXplorer IsRelatedTo DOI 10.1016/j.tcs.2018.02.007
Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.1805.08255
  • 10.48550/arxiv.1805.08255
  • 1805.08255
  • 10.1016/j.tcs.2018.02.007
  • 10.1016/j.tcs.2018.02.007
Algorithmic and algebraic aspects of unshuffling permutations

5 Documents citing this article

Share and export

Consultation statistics

This page has been seen 277 times.
This article's PDF has been downloaded 649 times.