Vol. 8, No. 1, 2008

Download this article
Download this article For screen
For printing
Recent Issues
Volume 17, Issue 2
Volume 17, Issue 1
Volume 16, Issue 1
Volume 15, Issue 1
Volume 14, Issue 1
Volume 13, Issue 1
Volume 12, Issue 1
Volume 11, Issue 1
Volume 10, Issue 1
Volume 9, Issue 1
Volume 8, Issue 1
Volume 6+7, Issue 1
Volume 5, Issue 1
Volume 4, Issue 1
Volume 3, Issue 1
Volume 2, Issue 1
Volume 1, Issue 1
The Journal
About the Journal
Subscriptions
Editorial Board
Submission Guidelines
Submission Form
Ethics Statement
To Appear
Editorial Login
Contacts
ISSN (electronic): 2640-7345
ISSN (print): 2640-7337
Other MSP Journals
Collinear triples in permutations

Liangpan Li

Vol. 8 (2008), No. 1, 171–173
DOI: 10.2140/iig.2008.8.171
Abstract

Let α : Fq Fq be a permutation and Ψ(α) be the number of collinear triples in the graph of α, where Fq denotes a finite field of q elements. When q is odd, Cooper and Solymosi once proved Ψ(α) (q 1)4 and conjectured the sharp bound should be Ψ(α) (q 1)2. In this note we confirm this conjecture.

Keywords
collinear triple, permutation, Kakeya set
Mathematical Subject Classification 2000
Primary: 11T99
Milestones
Received: 21 May 2008
Accepted: 2 September 2008
Authors
Liangpan Li