Upper bounds on the covering number of Galois-planes with small order

Illés T, Pisinger D

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Our paper deals with the covering number of finite projective planes which is related to an unsolved question of P. Erdos. An integer linear programming (ILP) formulation of the covering number of finite projective planes is introduced for projective planes of given orders. The mathematical programming based approach for this problem is new in the area of finite projective planes. Since the ILP problem is NP-hard and may involve up to 360.000 boolean variables for the considered problems, we propose a heuristic based on Simulated Annealing. The computational study gives a new insight into the structure of projective planes and their (minimal) blocking sets. This computational study indicates that the current theoretical results may be improved.
Original languageEnglish
Pages (from-to)59-76
Number of pages18
JournalJournal of Heuristics
Volume7
Issue number1
DOIs
Publication statusPublished - 2001
Externally publishedYes

Keywords

  • Galois-plane
  • simulated annealing
  • programming
  • blocking sets

Fingerprint Dive into the research topics of 'Upper bounds on the covering number of Galois-planes with small order'. Together they form a unique fingerprint.

  • Cite this