Affiliation:
1. Department of Mathematics, Technical University of Gabrovo, 5300 Gabrovo, Bulgaria
Abstract
An (n,r)-arc is a set of n points of a projective plane such that some r, but no r+1 of them, are collinear. The maximum size of an (n,r)-arc in PG(2, q) is denoted by mr(2, q). In this paper, a new (286, 16)-arc in PG(2,19), a new (341, 15)-arc, and a (388, 17)-arc in PG(2,25) are constructed, as well as a (394, 16)-arc, a (501, 20)-arc, and a (532, 21)-arc in PG(2,27). Tables with lower and upper bounds on mr(2, 25) and mr(2, 27) are presented as well. The results are obtained by nonexhaustive local computer search.
Funder
Bulgarian Ministry of Education and Science
Reference15 articles.
1. Institute of Statistics Mimeo Series no. 439,1965
2. Oxford Mathematical Monographs,1998
3. The Packing Problem in Statistics, Coding Theory and Finite Projective Spaces: Update 2001
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. New Large (n, r)-arcs in PG(2, q);Iranian Journal of Mathematical Sciences and Informatics;2022-04-01
2. Three new large (n, r) arcs in PG(2,31);2020 Algebraic and Combinatorial Coding Theory (ACCT);2020-10-11
3. New lower bounds on the size of (n,r)‐arcs in PG(2,q);Journal of Combinatorial Designs;2019-08-21
4. Some new ( n , r )-arcs in PG(2,31);Electronic Notes in Discrete Mathematics;2017-03
5. Improved lower bounds on m r (2,29);Electronic Notes in Discrete Mathematics;2017-03