Enumerating permutations that avoid three term arithmetic progressions
From MaRDI portal
Publication:1028844
zbMath1187.05003MaRDI QIDQ1028844
Publication date: 8 July 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/117521
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Combinatorial inequalities (05A20) Generalized Ramsey theory (05C55)
Related Items (4)
On permutations avoiding arithmetic progressions ⋮ Arithmetic subsequences in a random ordering of an additive set ⋮ Forbidden arithmetic progressions in permutations of subsets of the integers ⋮ A Note on 3-free Permutations
This page was built for publication: Enumerating permutations that avoid three term arithmetic progressions