A Survey of Cameron-Liebler Sets and Low Degree Boolean Functions in Grassmann Graphs
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.
arXiv comment26 pages (20 text, 6 references); accepted by the conference volume of Sum(m)it280