English

Degree 2 Boolean Functions on Grassmann Graphs

Combinatorics 2022-11-14 v3

Abstract

We investigate the existence of Boolean degree dd functions on the Grassmann graph of kk-spaces in the vector space Fqn\mathbb{F}_q^n. For d=1d=1 several non-existence and classification results are known, and no non-trivial examples are known for n5n \geq 5. This paper focusses on providing a list of examples on the case d=2d=2 in general dimension and in particular for (n,k)=(6,3)(n, k)=(6,3) and (n,k)=(8,4)(n,k) = (8, 4). We also discuss connections to the analysis of Boolean functions, regular sets/equitable bipartitions/perfect 2-colorings in graphs, qq-analogs of designs, and permutation groups. In particular, this represents a natural generalization of Cameron-Liebler line classes.

Keywords

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

R2 v1 2026-06-24T09:26:32.089Z