A Survey of Cameron-Liebler Sets and Low Degree Boolean Functions in Grassmann Graphs
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909635750920192 |
|---|---|
| author | Ihringer, Ferdinand |
| author_facet | Ihringer, Ferdinand |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_16288 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Survey of Cameron-Liebler Sets and Low Degree Boolean Functions in Grassmann Graphs Ihringer, Ferdinand Combinatorics Discrete Mathematics 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. |
| title | A Survey of Cameron-Liebler Sets and Low Degree Boolean Functions in Grassmann Graphs |
| topic | Combinatorics Discrete Mathematics |
| url | https://arxiv.org/abs/2411.16288 |