Arithmetic subsequences in a random ordering of an additive set

zbMath1490.11017arXiv2012.12339MaRDI QIDQ3390062

Rosie Y. Zhao, Marcel K. Goh

Publication date: 24 March 2022

Full work available at URL: https://arxiv.org/abs/2012.12339

zbMATH Keywords

asymptotic propertiesfinite abelian groupnumber of orderingslength of longest arithmetic subsequencerandom ordering of additive set

Mathematics Subject Classification ID

Arithmetic progressions (11B25)

Related Items (2)

Continuously increasing subsequences of random multiset permutations ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Permutations that destroy arithmetic progressions in elementary \(p\)-groups
• On permutations avoiding arithmetic progressions
• Enumerating permutations that avoid three term arithmetic progressions
• On the length of the longest monotone subsequence in a random permutation
• Forbidden arithmetic progressions in permutations of subsets of the integers
• Permutations avoiding arithmetic patterns
• Maximal arithmetic progressions in random subsets
• On sets of integers containing k elements in arithmetic progression
• On permutations containing no long arithmetic progressions
• A Note on 3-free Permutations
• On the Application of the Borel-Cantelli Lemma

This page was built for publication: Arithmetic subsequences in a random ordering of an additive set