A family of symmetric counterexamples to the bent sum decomposition conjecture
Máté Róbert Kepes, Anita Kercsó-Molnár, Viczián András
Abstract
In this paper, we provide an infinite family of counterexamples to Tokareva's conjecture on sums of two bent functions. The conjecture states that every Boolean function in an even number of variables n of algebraic degree at most n/2 can be written as the sum of two bent functions. We show that for every n=2k≥ 8, the symmetric function Fn=1+σ2+σ4+σ6+·s+σn/2 has degree n/2 and cannot be written as a sum of at most two bent functions. Here σj is the elementary symmetric Boolean polynomial of degree j. Furthermore, we show that the eight-variable member of this family can be represented as the sum of exactly three bent functions. Using the connection between bent-sum decompositions and derivatives of bent functions, we also obtain an infinite family of balanced Boolean functions that cannot be derivatives of bent functions.
Create a lesson
Related papers
Off-Diagonal Induced Ramsey Numbers
Bruno Andrades, Marcelo Campos, Rafael Filipe et al.
Largest Sperner families with bounded VC-dimension
Gennian Ge, Hanyu Wang, Zixiang Xu et al.
Proof of two conjectures on the log-concavity of partition ranks and cranks
Jianxi Mao, Wenle Shi, Bao-Xuan Zhu
The Exact Number of Pentagons in Book-Free Graphs
Wentao Hu
Counting graphs admitting a strictly matched involution
Stephan Dominique Andres, Igor Režan
Polylogarithmic bound for the Gyárfás-Sumner conjecture
Martin Bierbaumer, Matija Bucić