Collinear triples in permutations

Details Collinear triples in permutations Collinear triples in permutations

2008-05-04

arxiv.org/abs/0805.0410v1

Mathematics

Combinatorics

4 pages

Scientific paper

Let $\alpha:\mathbb{F}_q\to\mathbb{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.

Affiliated with

Also associated with

No associations

Rating

Collinear triples in permutations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Collinear triples in permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Collinear triples in permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-324726