Generalizing Korchmáros-Mazzocca arcs

In this paper, we generalize the so called Korchmáros-Mazzocca arcs, that is, point sets of size $q+t$ intersecting each line in 0, 2 or t points in a finite projective plane of order q. When t is not 2 then this means that each point of the point set is incident with exactly one line meeting the point set in t points. In PG(2,p^n), we change 2 in the definition above to any integer m and describe all examples when m or t is not divisible by p. We also study mod p variants of these objects, give examples and under some conditions we prove the existence of a nucleus

Field reduction and linear sets in finite geometry

Based on the simple and well understood concept of subfields in a finite field, the technique called `field reduction' has proved to be a very useful and powerful tool in finite geometry. In this paper we elaborate on this technique. Field reduction for projective and polar spaces is formalized and the links with Desarguesian spreads and linear sets are explained in detail. Recent results and some fundamental ques- tions about linear sets and scattered spaces are studied. The relevance of field reduction is illustrated by discussing applications to blocking sets and semifields

Incidence geometry from an algebraic graph theory point of view

The goal of this thesis is to apply techniques from algebraic graph theory to finite incidence geometry. The incidence geometries under consideration include projective spaces, polar spaces and near polygons. These geometries give rise to one or more graphs. By use of eigenvalue techniques, we obtain results on these graphs and on their substructures that are regular or extremal in some sense. The first chapter introduces the basic notions of geometries, such as projective and polar spaces. In the second chapter, we introduce the necessary concepts from algebraic graph theory, such as association schemes and distance-regular graphs, and the main techniques, including the fundamental contributions by Delsarte. Chapter 3 deals with the Grassmann association schemes, or more geometrically: with the projective geometries. Several examples of interesting subsets are given, and we can easily derive completely combinatorial properties of them. Chapter 4 discusses the association schemes from classical finite polar spaces. One of the main applications is obtaining bounds for the size of substructures known as partial m- systems. In one specific case, where the partial m-systems are partial spreads in the polar space H(2d − 1, q^2) with d odd, the bound is new and even tight. A variant of the famous Erdős-Ko-Rado problem is considered in Chapter 5, where we study sets of pairwise non-trivially intersecting maximal totally isotropic subspaces in polar spaces. A combination of geometric and algebraic techniques is used to obtain a classification of such sets of maximum size, except for one specific polar space, namely H(2d − 1, q^2) for odd rank d ≥ 5. Near polygons, including generalized polygons and dual polar spaces, are studied in the last chapter. Several results on substructures in these geometries are given. An inequality of Higman on the parameters of generalized quadrangles is generalized. Finally, it is proved that in a specific dual polar space, a highly regular substructure would yield a distance- regular graph, generalizing a result on hemisystems. The appendix consists of an alternative proof for one of the main results in the thesis, a list of open problems and a summary in Dutch

Providing Information by Resource- Constrained Data Analysis

The Collaborative Research Center SFB 876 (Providing Information by Resource-Constrained Data Analysis) brings together the research fields of data analysis (Data Mining, Knowledge Discovery in Data Bases, Machine Learning, Statistics) and embedded systems and enhances their methods such that information from distributed, dynamic masses of data becomes available anytime and anywhere. The research center approaches these problems with new algorithms respecting the resource constraints in the different scenarios. This Technical Report presents the work of the members of the integrated graduate school