Collinear triples in permutations
| dc.creator | Li, Liangpan | |
| dc.date | 2008-05-04 | |
| dc.date.accessioned | 2026-07-07T09:36:57Z | |
| dc.date.available | 2026-07-07T09:36:57Z | |
| dc.description | Let $α:\mathbb{F}_q\to\mathbb{F}_q$ be a permutation and $Ψ(α)$ be the number of collinear triples in the graph of $α$, where $\mathbb{F}_q$ denotes a finite field of $q$ elements. When $q$ is odd Cooper and Solymosi once proved $Ψ(α)\geq(q-1)/4$ and conjectured the sharp bound should be $Ψ(α)\geq(q-1)/2$. In this note we indicate that the Cooper-Solymosi conjecture is true. | |
| dc.description | 4 pages | |
| dc.identifier | https://arxiv.org/abs/0805.0410 | |
| dc.identifier | http://arxiv.org/abs/0805.0410 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/160298 | |
| dc.subject | Combinatorics | |
| dc.subject | 11T99 | |
| dc.title | Collinear triples in permutations | |
| dc.type | text |