COMBINATORIAL PROBLEMS FOR ABELIAN GROUPS ARISING FROM GEOMETRY
Abstract
This paper deals with elementary problems on complexes of abelian groups related to finite geometry, in particular to arcs and blocking sets of finite projective planes. Arcs contained in cubic curves led us to the notion of a 3-independent subset in abelian groups. Various examples of complete arcs containing only three points outside a conic were constructed by KORCHMÁROS [6) using 2 -(m, n) isolated sets. In this paper we survey the known results and constructions concerning 3-independent and 2 (m, n) isolated sets. Moreover we obtain some new bounds for their size and give some new examples showing that the lower and upper bounds are sharp regarding their order of magnitude. Finally, we will show how the methods and constructions of the previous sections can be applied to the problem of blocking sets contained in the union of three lines and answer a question of CAMERON [1].
How to Cite
Issue
Section
License
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (see The Effect of Open Access). As soon as the paper is accepted, finally submitted and edited, the paper will appear in the "OnlineFirst" page of the journal, thus from this point no other internet-based publication is necessary.

