TY - THES UR - http://lib.ugent.be/catalog/pug01:1209078 ID - pug01:1209078 LA - eng TI - Incidence geometry from an algebraic graph theory point of view PY - 2011 PB - Ghent AU - Vanhove, Frédéric 002002375747 802000260724 AU - De Clerck, Frank promotor 801000311366 AU - Bamberg, John copromotor AB - 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. ER -Download RIS file
00000nam^a2200301^i^4500 | |||
001 | 1209078 | ||
005 | 20180816074059.0 | ||
008 | 110414s2011------------------------eng-- | ||
024 | a 1854/LU-1209078 2 handle | ||
040 | a UGent | ||
245 | a Incidence geometry from an algebraic graph theory point of view | ||
260 | a Ghent, Belgium b Ghent University. Faculty of Sciences c 2011 | ||
518 | a Public defense: 2011-04-07 17:00 | ||
520 | a 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. | ||
598 | a D1 | ||
100 | a Vanhove, Frédéric 0 002002375747 0 802000260724 0 972065214670 | ||
700 | a De Clerck, Frank e promotor 0 801000311366 0 974053150353 | ||
700 | a Bamberg, John e copromotor u WE01 0 802000050051 | ||
852 | x WE b WE01 | ||
650 | a Mathematics and Statistics | ||
653 | a finite geometry | ||
653 | a distance-regular graphs | ||
653 | a association schemes | ||
856 | 3 Full Text u https://biblio.ugent.be/publication/1209078/file/4335521 z [open] y VanhovePhd.pdf | ||
920 | a phd | ||
852 | x WE b WE01 | ||
922 | a UGENT-WE |
All data below are available with an Open Data Commons Open Database License. You are free to copy, distribute and use the database; to produce works from the database; to modify, transform and build upon the database. As long as you attribute the data sets to the source, publish your adapted database with ODbL license, and keep the dataset open (don't use technical measures such as DRM to restrict access to the database).
The datasets are also available as weekly exports.