Collinear triples in permutations

MaRDI QIDQ993652zbMATH OpenFDO

Authors Liangpan Li

Publication date 20 September 2010

Published in Innovations in Incidence Geometry (Search for Journal in Brave)

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

zbMATH Keywords

collinear triplesfinite fieldgraphpermutation

Mathematics Subject Classification ID

Finite fields and commutative rings (number-theoretic aspects) (11T99)

Abstract: Let $alpha:mathbb{F}_{q}omathbb{F}_q$ be a permutation and $Psi(alpha)$ be the number of collinear triples in the graph of $alpha$, where $mathbb{F}_q$ denotes a finite field of $q$ elements. When $q$ is odd Cooper and Solymosi once proved $Psi(alpha)geq(q-1)/4$ and conjectured the sharp bound should be $Psi(alpha)geq(q-1)/2$. In this note we indicate that the Cooper-Solymosi conjecture is true.

Review text

Let \({\mathbb F}_q\) be a finite field, \(q\) odd, \(\alpha:{\mathbb F}_q\to{\mathbb F}_q\) a permutation and \(\Psi(\alpha)\) the number of collinear triples in the graph of \(\alpha\). The author proves that \(\Psi(\alpha)\geq \frac{q-1}{2}\).

Recommendations

• Collinear points in permutations
• Characterizations and constructions of triple-cycle permutations of the form x^rh(x^s)
• Permutation trinomials over \(\mathbb{F}_{q^3} \)
• Permutations on finite fields with invariant cycle structure on lines
• On permutation polynomials whose difference is linear

Cited in

(2)

• Collinear points in permutations
• Permutations minimizing the number of collinear triples

This page was built for publication: Collinear triples in permutations

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