Results 1 to 10 of about 1,071 (104)
Some of the next articles are maybe not open access.
The length of the longest common subsequence of two independent mallows permutations
Annals of Applied Probability, 2019Ke Jin
exaly
Rado's theorem and solvability of systems of equations.
Notre Dame Journal of Formal Logic, 1973exaly
Further enumeration results concerning a recent equivalence of restricted inversion sequences [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 Let asc and desc denote respectively the statistics recording the number of ascents or descents in a sequence having non-negative integer entries.
Toufik Mansour, Mark Shattuck
doaj +1 more source
Positional Marked Patterns in Permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 We define and study positional marked patterns, permutations $\tau$ where one of elements in $\tau$ is underlined. Given a permutation $\sigma$, we say that $\sigma$ has a $\tau$-match at position $i$ if $\tau$ occurs in $\sigma$ in such a way that ...
Sittipong Thamrongpairoj +1 more
doaj +1 more source
Antipowers in Uniform Morphic Words and the Fibonacci Word [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 Fici, Restivo, Silva, and Zamboni define a $k$-antipower to be a word composed of $k$ pairwise distinct, concatenated words of equal length. Berger and Defant conjecture that for any sufficiently well-behaved aperiodic morphic word $w$, there exists a ...
Swapnil Garg
doaj +1 more source
A Bijection on Classes Enumerated by the Schröder Numbers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 We consider a sorting machine consisting of two stacks in series where the first stack has the added restriction that entries in the stack must be in decreasing order from top to bottom.
Michael W. Schroeder, Rebecca Smith
doaj +1 more source
Pattern Avoidance in Reverse Double Lists [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 In this paper, we consider pattern avoidance in a subset of words on $\{1,1,2,2,\dots,n,n\}$ called reverse double lists. In particular a reverse double list is a word formed by concatenating a permutation with its reversal.
Monica Anderson +3 more
doaj +1 more source