The AB-graph conjecture for maximal k-covers
The AB-graph conjecture for maximal k-covers
Let be a -cover, and suppose that
An AB function is a function whose graph is denoted by ; two sets are affinely equivalent when they are related by an affine transformation. AB-graph conjecture. If is a -cover with , then there exists an AB function such that is affinely equivalent to . The theorem preceding the conjecture shows that every such -cover gives a bent function, while graphs of AB functions provide examples; the conjecture asserts that these are the only examples up to affine equivalence.
Sources & referencesView supporting material
Primary source
Darrion Thornburgh, “On generalizing cryptographic results to Sidon sets in F_2^n”, arXiv:2501.11184 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.