A Survey of Cameron-Liebler Sets and Low Degree Boolean Functions in Grassmann Graphs

2024/11/25 by Ihringer, Ferdinand
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics

paper · doi:10.48550/arxiv.2411.16288

Abstract

We survey results for Cameron-Liebler sets and low degree Boolean functions for Hamming graphs, Johnson graphs and Grassmann graphs from the point of view of association schemes. This survey covers selected results in finite geometry, Boolean function analysis, design theory, coding theory, and cryptography.

Related

• Boolean degree 1 functions on some classical association schemes
• Degree 2 Boolean Functions on Grassmann Graphs
• Cameron-Liebler sets in Hamming graphs
• On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme
• The degree of functions in the Johnson and q-Johnson schemes