The best polynomial bounds for the number of triangles in a simple arrangement of n pseudo-lines

Simple item page
dc.creatorBlanc, Jérémy
dc.date2008-01-18
dc.date2008-01-20
dc.date.accessioned2026-07-07T08:55:18Z
dc.date.available2026-07-07T08:55:18Z
dc.descriptionIt is well-known that affine (respectively projective) simple arrangements of n pseudo-lines may have at most n(n-2)/3 (respectively n(n-1)/3) triangles. However, these bounds are reached for only some values of n (mod 6). We provide the best polynomial bound for the affine and the projective case, and for each value of n (mod 6).
dc.description12 pages, 7 figures
dc.identifierhttps://arxiv.org/abs/0801.2845
dc.identifierhttp://arxiv.org/abs/0801.2845
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/146228
dc.subjectCombinatorics
dc.subject52C30
dc.titleThe best polynomial bounds for the number of triangles in a simple arrangement of n pseudo-lines
dc.typetext

Files

Collections

arXiv