Daniele Bartoli, Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco
Published 2014-05-22Version 1
Tables of sizes of random complete arcs in the plane $PG(2,q)$ are given. The sizes are close to the smallest known sizes of complete arcs in $PG(2,q)$, in particular, to ones constructed by Algorithm FOP (fixed order of points). The random arcs are obtained in the region $\{3\leq q\leq 46337,~q \mbox{prime}\}$.
Comments: 37 pages, 5 figures, 1 table, 57 references; Table is attached also as .csv files. To view attachments, please download and extract the gzipped tar source file listed under "Other formats". arXiv admin note: substantial text overlap with arXiv:1404.0469
Tables, bounds and graphics of sizes of complete lexiarcs in the plane $\mathrm{PG}(2,q)$ for all $q\le301813$ and sporadic $q$ in the interval $[301897\ldots430007]$ obtained by an algorithm with fixed order of points (FOP)
Maximizing the mean subtree order
A note on the $A_α$-spectral radius of graphs
![QR code for arXiv:1405.5862 [math.CO]](http://oss.arxitics.com/images/favicon.svg)