{"title":"On Geometry and Combinatorics of Finite Classical Polar Spaces","authors":"Valentino Smaldore","doi":"arxiv-2409.11131","DOIUrl":null,"url":null,"abstract":"Polar spaces over finite fields are fundamental in combinatorial geometry.\nThe concept of polar space was firstly introduced by F. Veldkamp who gave a\nsystem of 10 axioms in the spirit of Universal Algebra. Later the axioms were\nsimplified by J. Tits, who introduced the concept of subspaces. Later on, from\nthe point of view of incidence geometry, axioms of polar spaces were also given\nby F. Buekenhout and E. Shult in 1974. The reader can find the three systems of\naxioms of polar spaces in Appendix A. Examples of polar spaces are the so\ncalled Finite classical polar spaces, i.e. incidence structures arising from\nquadrics, symplectic forms and Hermitian forms, which are in correspondance\nwith reflexive sesquilinear forms.It is still an open problem to show whether\nor not classical polar spaces are the only example of finite polar spaces. Nowadays, some research problems related to finite classical polar space are:\nexistence of spreads and ovoids; existence of regular systems and $m$-ovoids;\nupper or lower bounds on partial spreads and partial ovoids. Moreover, polar\nspaces are in relation with combinatorial objects as regular graphs, block\ndesigns and association schemes. In this Ph.D. Thesis we investigate the geometry of finite classical polar\nspaces, giving contributions to the above problems. The thesis is organized as\nfollows. Part I is more focused on the geometric aspects of polar spaces, while\nin Part II some combinatorial objects are introduced such as regular graphs,\nassociation schemes and combinatorial designs. Finally Appendix B, C and D are\ndedicated to give more details on, respectively, maximal curves, linear codes\nand combinatorial designs, giving useful results and definitions.","PeriodicalId":501407,"journal":{"name":"arXiv - MATH - Combinatorics","volume":"2020 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.11131","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Polar spaces over finite fields are fundamental in combinatorial geometry.
The concept of polar space was firstly introduced by F. Veldkamp who gave a
system of 10 axioms in the spirit of Universal Algebra. Later the axioms were
simplified by J. Tits, who introduced the concept of subspaces. Later on, from
the point of view of incidence geometry, axioms of polar spaces were also given
by F. Buekenhout and E. Shult in 1974. The reader can find the three systems of
axioms of polar spaces in Appendix A. Examples of polar spaces are the so
called Finite classical polar spaces, i.e. incidence structures arising from
quadrics, symplectic forms and Hermitian forms, which are in correspondance
with reflexive sesquilinear forms.It is still an open problem to show whether
or not classical polar spaces are the only example of finite polar spaces. Nowadays, some research problems related to finite classical polar space are:
existence of spreads and ovoids; existence of regular systems and $m$-ovoids;
upper or lower bounds on partial spreads and partial ovoids. Moreover, polar
spaces are in relation with combinatorial objects as regular graphs, block
designs and association schemes. In this Ph.D. Thesis we investigate the geometry of finite classical polar
spaces, giving contributions to the above problems. The thesis is organized as
follows. Part I is more focused on the geometric aspects of polar spaces, while
in Part II some combinatorial objects are introduced such as regular graphs,
association schemes and combinatorial designs. Finally Appendix B, C and D are
dedicated to give more details on, respectively, maximal curves, linear codes
and combinatorial designs, giving useful results and definitions.