Degree 2 Boolean Functions on Grassmann Graphs
Combinatorics
2022-11-14 v3
Abstract
We investigate the existence of Boolean degree functions on the Grassmann graph of -spaces in the vector space . For several non-existence and classification results are known, and no non-trivial examples are known for . This paper focusses on providing a list of examples on the case in general dimension and in particular for and . We also discuss connections to the analysis of Boolean functions, regular sets/equitable bipartitions/perfect 2-colorings in graphs, -analogs of designs, and permutation groups. In particular, this represents a natural generalization of Cameron-Liebler line classes.
Cite
@article{arxiv.2202.03940,
title = {Degree 2 Boolean Functions on Grassmann Graphs},
author = {Jan De Beule and Jozefien D'haeseleer and Ferdinand Ihringer and Jonathan Mannaert},
journal= {arXiv preprint arXiv:2202.03940},
year = {2022}
}
Comments
21 pages; 1 figure; accepted in the Electronic Journal of Combinatorics