Higher-order nonhomomorphicity under affine restrictions
Serge Feukoua, Ana Sălăgean, Pantelimon Stănică
Abstract
We study the behavior of the k-th-order nonhomomorphicity of Boolean functions under restriction to affine subspaces. For odd k3 and 0 t<n, we introduce the t-restriction k-th-order nonhomomorphicity Pk,t(f), defined as the minimum of Pk(f A) over affine spaces of codimension at most t. For a direct sum of m monomials of degrees at least two, we determine Pk,t exactly. When t<m, a minimum is obtained by setting one variable equal to zero in each of the t monomials of lowest degree. When m t<n, the minimum is zero. The proof combines multiplicativity of even Walsh moments with a contraction argument for affine restrictions. We establish a general formula for the Walsh transform of a Boolean function restricted to an affine subspace of arbitrary codimension, yielding an exact spectral characterization of the t-restriction normalized nonlinearity t(f). As odd k tends to infinity, (1-2Pk,t(f))1/(k+1) converges to 1-2t(f). We further prove that every non-affine function has a hyperplane restriction with strictly smaller odd-order nonhomomorphicity. Finally, we determine 1(Td,n) exactly for all threshold functions with n3. This proves the two threshold-function conjectures left open in~SergeAnaPante2025, including the previously unresolved odd-majority case, where a minimizing hyperplane is x1+x2=0.
Create a lesson
Related papers
Multiple-Function Approximated Coded Computing: Constructions and Error Bounds
Rimpi Borah, Wilton Kim, J. Harshan et al.
Log Density Spectrum Based Decoding of Polar Codes for Channels with Strong Phase Noise
Yinuo Mei, Daiming Qu
More Interactions Make Communications More Efficient: A Directed Information Bottleneck Approach to Task-Oriented Communication
Zhirun Zheng, Yiqin Deng, Phone Lin et al.
Generalized Hamming Weights and Subcode Support Weight Distributions of Twisted Reed-Solomon Codes
Chao Liu, Hao Chen, Dabin Zheng et al.
RPA Decoding with Few Subspace Projections for Correcting Structured Error Patterns in RM Codes
Shiv Pratap Singh Rathore, Navin Kashyap
Learning Rules, Memorizing Facts: An Information-Theoretic View of Hallucination
Gengze Xu, Anxin Guo, Yifei Hu et al.