The maximum and the minimum size of complete (n,3)-arcs in PG(2,16)

Details The maximum and the minimum size of complete (n,3)-arcs in PG(2,16) The maximum and the minimum size of complete (n,3)-arcs in PG(2,16)

2012-01-11

arxiv.org/abs/1201.2260v1

Mathematics

Combinatorics

3 pages

Scientific paper

In this work we solve the packing problem for complete (n,3)-arcs in
PG(2,16), determining that the maximum size is 28 and the minimum size is 15.
We also performed a partial classification of the extremal size of complete
(n,3)-arcs in PG(2,16).

Affiliated with

Also associated with

No associations

Rating

The maximum and the minimum size of complete (n,3)-arcs in PG(2,16) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The maximum and the minimum size of complete (n,3)-arcs in PG(2,16), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The maximum and the minimum size of complete (n,3)-arcs in PG(2,16) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-603699