Results 11 to 20 of about 354,201 (259)
Nordlyd: Tromsø University Working Papers on Language & LinguisticsI propose that, within local domains corresponding to extended projections, typologically possible information-neutral word orders are limited to the stack-sortable (231-avoiding) permutations of a universal head-complement-specifier linear order.
David P. Medeiros
doaj +3 more sources
Deterministic stack-sorting for set partitions [PDF]
Enumerative Combinatorics and Applications, 2023 A sock sequence is a sequence of elements, which we will refer to as socks, from a finite alphabet. A sock sequence is sorted if all occurrences of a sock appear consecutively. We define equivalence classes of sock sequences called sock patterns, which are in bijection with set partitions.
Xia, Janabel
openaire +4 more sources
Stack-sorting with consecutive-pattern-avoiding stacks [PDF]
Advances in Applied Mathematics, 2021 We introduce consecutive-pattern-avoiding stack-sorting maps $\text{SC}_σ$, which are natural generalizations of West's stack-sorting map $s$ and natural analogues of the classical-pattern-avoiding stack-sorting maps $s_σ$ recently introduced by Cerbai, Claesson, and Ferrari.
Colin Defant, Kai Zheng
openaire +3 more sources
Stack sorting with restricted stacks [PDF]
Journal of Combinatorial Theory, Series A, 2020 The (classical) problem of characterizing and enumerating permutations that can be sorted using two stacks connected in series is still largely open. In the present paper we address a related problem, in which we impose restrictions both on the procedure and on the stacks.
Giulio Cerbai +2 more
openaire +4 more sources
Stack Sorting with Increasing and Decreasing Stacks [PDF]
The Electronic Journal of Combinatorics, 2020 We introduce a sorting machine consisting of $k+1$ stacks in series: the first $k$ stacks can only contain elements in decreasing order from top to bottom, while the last one has the opposite restriction. This device generalizes the $\mathfrak{DI}$ machine introduced by Rebecca Smith, which studies the case $k=1$.
Cerbai, G, Cioni, L, Ferrari, L
openaire +6 more sources
Stack-sorting for Coxeter groups [PDF]
Combinatorial Theory, 2022 39 pages, 11 figures; to be published in Combinatorial ...
openaire +4 more sources
Troupes, cumulants, and stack-sorting [PDF]
Advances in Mathematics, 2022 Several sequences of free cumulants that count binary plane trees correspond to sequences of classical cumulants that count the decreasing versions of the same trees. Using two new operations on colored binary plane trees that we call insertion and decomposition, we prove that this surprising phenomenon holds for families of trees that we call troupes.
openaire +3 more sources
Sorting with Pattern-Avoiding Stacks: The 132-Machine [PDF]
The Electronic Journal of Combinatorics, 2020 This paper continues the analysis of the pattern-avoiding sorting machines recently introduced by Cerbai, Claesson and Ferrari (2020). These devices consist of two stacks, through which a permutation is passed in order to sort it, where the content of each stack must at all times avoid a certain pattern.
Giulio Cerbai +3 more
openaire +8 more sources
JMIR Formative Research, 2023 BackgroundmHealth (mobile health) systems have been deployed widely in low- and middle-income countries (LMICs) for health system strengthening, requiring considerable resource allocation. However, most solutions have not achieved
Verghese Thomas +5 more
doaj +1 more source