Degree 2 Boolean Functions on Grassmann Graphs

arXiv (Cornell University)(2023)

引用 0|浏览0
暂无评分
摘要
We investigate the existence of Boolean degree $d$ functions on the Grassmann graph of $k$-spaces in the vector space $\mathbb{F}_q^n$. For $d=1$ several non-existence and classification results are known, and no non-trivial examples are known for $n \geq 5$. This paper focusses on providing a list of examples on the case $d=2$ in general dimension and in particular for $(n, k)=(6,3)$ and $(n,k) = (8, 4)$.We also discuss connections to the analysis of Boolean functions, regular sets/equitable bipartitions/perfect 2-colorings in graphs, $q$-analogs of designs, and permutation groups. In particular, this represents a natural generalization of Cameron-Liebler line classes.
更多
查看译文
关键词
boolean functions,graphs,degree
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要