Collinear Points in Permutations

Simple item page
dc.creatorCooper, J.
dc.creatorSolymosi, J.
dc.date2004-08-29
dc.date.accessioned2026-07-07T05:11:37Z
dc.date.available2026-07-07T05:11:37Z
dc.descriptionConsider the following problem: how many collinear triples of points must a transversal of (Z/nZ)^2 have? This question is connected with venerable issues in discrete geometry. We show that the answer, for n prime, is between (n-1)/4 and (n-1)/2, and consider an analogous question for collinear quadruples. We conjecture that the upper bound is the truth and suggest several other interesting problems in this area.
dc.description7 pages, 0 figures
dc.identifierhttps://arxiv.org/abs/math/0408396
dc.identifierhttp://arxiv.org/abs/math/0408396
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/72307
dc.subjectCombinatorics
dc.subjectNumber Theory
dc.subject51E15 (Primary), 11T99 (Secondary)
dc.titleCollinear Points in Permutations
dc.typetext

Files

Collections

arXiv