Cameron-Liebler sets in bilinear forms graphs

2020/04/05 by Jun Guo, Guo, Jun
Computer Science · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.2004.02104

openalex publication_date 2020/04/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Cameron-Liebler sets of subspaces in projective spaces were studied recently by Blokhuis, De Boeck and D'haeseleer (Des. Codes Cryptogr., 2019). In this paper, we discuss Cameron-Liebler sets in bilinear forms graphs, obtain several equivalent definitions and present some classification results.

Related

• Cameron-Liebler sets of k-spaces in PG(n,q)
• Cameron-Liebler sets in Hamming graphs
• Regular ovoids and Cameron-Liebler sets of generators in polar spaces
• Cameron-Liebler sets of generators in the Klein quadric Q⁺(5,q)
• A Survey of Cameron-Liebler Sets and Low Degree Boolean Functions in Grassmann Graphs