Permutations destroying arithmetic progressions in finite cyclic groups

MaRDI QIDQ907229zbMATH OpenFDO

Authors Anders Martinsson, Peter Hegarty

Publication date 25 January 2016

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1506.05342, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i4p39

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

arithmetic progressionfinite cyclic group

Mathematics Subject Classification ID

Ramsey theory (05D10) Arithmetic progressions (11B25) Other combinatorial number theory (11B75) General theory for finite permutation groups (20B05)

Abstract: A permutation pi of an abelian group G is said to destroy arithmetic progressions (APs) if, whenever (a,b,c) is a non-trivial 3-term AP in G, that is c-b=b-a and a,b,c are not all equal, then (pi(a),pi(b),pi(c)) is not an AP. In a paper from 2004, the first author conjectured that such a permutation exists of Z/nZ, for all n except 2,3,5 and 7. Here we prove, as a special case of a more general result, that such a permutation exists for all n >= n_0, for some explcitly constructed number n_0 approx 1.4 x 10^{14}. We also construct such a permutation of Z/pZ for all primes p > 3 such that p = 3 (mod 8).

Review text

Summary: A permutation \(\pi\) of an abelian group \(G\) is said to destroy arithmetic progressions (APs) if, whenever \((a,b,c)\) is a non-trivial 3-term AP in \(G\), that is \(c-b=b-a\) and \(a\), \(b\), \(c\) are not all equal, then \((\pi(a),\pi(b), \pi(c))\) is not an AP. The first author [ibid. 11, No. 1, Research paper R39, 21 p. (2004; Zbl 1128.11007)] conjectured that such a permutation exists of \(\mathbb{Z}_n\), for all \(n \not\in \{2,3,5,7\}\). Here we prove, as a special case of a more general result, that such a permutation exists for all \(n \geq n_0\), for some explicitly constructed number \(n_0 \approx 1.4 \times 10^{14}\). We also construct such a permutation of \(\mathbb{Z}_p\) for all primes \(p > 3\) such that \(p \equiv 3 \pmod 8\).

Recommendations

• Permutations that destroy arithmetic progressions in elementary p-groups
• On a conjecture regarding permutations which destroy arithmetic progressions
• Permutations destroying arithmetic structure
• Permutations avoiding arithmetic patterns
• On permutations avoiding arithmetic progressions

Cites work

• An infinite permutation without arithmetic progressions
• On permutations containing no long arithmetic progressions
• Permutations avoiding arithmetic patterns
• Permutations destroying arithmetic structure
• Solving a linear equation in a set of integers I

Cited in

(6)

• On a conjecture regarding permutations which destroy arithmetic progressions
• Forbidden arithmetic progressions in permutations of subsets of the integers
• Permutations avoiding arithmetic patterns
• Permutations destroying arithmetic structure
• Permutations that destroy arithmetic progressions in elementary p-groups
• On permutations avoiding arithmetic progressions

This page was built for publication: Permutations destroying arithmetic progressions in finite cyclic groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q907229)