Collinear triples in permutations

zbMATH Open1200.11094arXiv0805.0410MaRDI QIDQ993652FDOQ993652

Authors: Liangpan Li 

Publication date: 20 September 2010

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

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.

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

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

zbMATH Keywords

graphpermutationfinite fieldcollinear triples

Mathematics Subject Classification ID

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

Cited In (1)

• Collinear points in permutations

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)