Minimal complete arcs in PG(2,q), q<= 32

Details Minimal complete arcs in PG(2,q), q<= 32 Minimal complete arcs in PG(2,q), q<= 32

2010-05-19

arxiv.org/abs/1005.3412v1

Mathematics

Combinatorics

6pages

Scientific paper

In this paper it has been verified, by a computer-based proof, that the
smallest size of a complete arc is 14 in PG(2,31) and in PG(2,32). Some
examples of such arcs are also described.

Affiliated with

Also associated with

No associations

Rating

Minimal complete arcs in PG(2,q), q<= 32 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 Minimal complete arcs in PG(2,q), q<= 32, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimal complete arcs in PG(2,q), q<= 32 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-479187