Alexander Clifton

activity

20162023

most citedContinuously Increasing Subsequences of Random Multiset Permutations

1 citations · 2 across the 6 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

math.CO2021★ 1 cited

Continuously Increasing Subsequences of Random Multiset Permutations

Alexander Clifton, Bishal Deb, Yifeng Huang +2

For a word $π$ and integer $i$ , we define $L^{i} (π)$ to be the length of the longest subsequence of the form $i (i + 1) \dots j$ , and we let $L (π) := max_{i} L^{i} (π)$ . In this paper we esti…

math.CO2021

New Bounds on Diffsequences

Alexander Clifton

For a set of positive integers $D$ , a $k$ -term $D$ -diffsequence is a sequence of positive integers $a_{1} < a_{2} < \dots < a_{k}$ such that $a_{i} - a_{i - 1} \in D$ for $i = 2, 3, \dots, k$ . For $k\in…