Permutree sorting - Laboratoire Interdisciplinaire des Sciences du Numérique Access content directly
Conference Papers Year : 2022

Permutree sorting

Abstract

Generalizing stack sorting and c-sorting for permutations, we define the permutree sorting algorithm. Given two disjoint subsets U and D of {2, . . . , n − 1}, the (U, D)-permutree sorting tries to sort a permutation π ∈ Sn and fails if and only if there are 1 ≤ i < j < k ≤ n such that π contains the subword jki with j ∈ U or kij with j ∈ D. This algorithm is seen as a way to explore an automaton which either rejects all reduced words of π, or accepts those reduced words for π whose prefixes are all (U, D)-permutree sortable.
Fichier principal
Vignette du fichier
31Pilaud.pdf (182.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03451389 , version 1 (26-11-2021)

Identifiers

  • HAL Id : hal-03451389 , version 1

Cite

Vincent Pilaud, Viviane Pons, Daniel Tamayo Jiménez. Permutree sorting. FPSAC 2021 - 33rd International Conference on Formal Power Series and Algebraic Combinatorics, Jan 2022, Ramat Gan, Israel. pp.#31. ⟨hal-03451389⟩
59 View
31 Download

Share

Gmail Facebook X LinkedIn More