惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

J
Java Code Geeks
Martin Fowler
Martin Fowler
MongoDB | Blog
MongoDB | Blog
博客园 - Franky
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
Microsoft Security Blog
Microsoft Security Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
博客园_首页
腾讯CDC
D
Docker
The Cloudflare Blog
量子位
爱范儿
爱范儿
L
LangChain Blog
博客园 - 三生石上(FineUI控件)
博客园 - 司徒正美
aimingoo的专栏
aimingoo的专栏
Blog — PlanetScale
Blog — PlanetScale
Jina AI
Jina AI
Apple Machine Learning Research
Apple Machine Learning Research
Hugging Face - Blog
Hugging Face - Blog
博客园 - 聂微东
Vercel News
Vercel News
MyScale Blog
MyScale Blog

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
On Geometry and Combinatorics of Finite Classical Polar S...
Valentino Smaldore · 2024-09-17 · via math.CO updates on arXiv.org

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 spaces and Hermitian varieties, 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.