Collinear triples in permutations (Q993652)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Collinear triples in permutations |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Collinear triples in permutations |
scientific article |
Statements
Collinear triples in permutations (English)
0 references
20 September 2010
0 references
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}\).
0 references
finite field
0 references
permutation
0 references
graph
0 references
collinear triples
0 references
0.778367817401886
0 references
0.7384297847747803
0 references
0.7241225242614746
0 references
0.7075592875480652
0 references
0.7030914425849915
0 references
