Upper bounds on the numbers of binary plateaued and bent functions

03/29/2023
by   Vladimir N. Potapov, et al.
0

The logarithm of the number of binary n-variable bent functions is asymptotically less than (2^n)/3 as n tends to infinity. Keywords: boolean function, Walsh–Hadamard transform, plateaued function, bent function, upper bound

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/30/2021

An Upper Bound on the Number of Bent Functions

The number of n-ary bent functions is less than 2^3·2^n-3(1+o(1)) as n i...
research
07/07/2020

Near-tight closure bounds for Littlestone and threshold dimensions

We study closure properties for the Littlestone and threshold dimensions...
research
09/08/2023

Existence of balanced functions that are not derivative of bent functions

It is disproved the Tokareva's conjecture that any balanced boolean func...
research
09/25/2018

An upper bound on ℓ_q norms of noisy functions

Let T_ϵ be the noise operator acting on functions on the boolean cube {0...
research
07/06/2020

On the weight and density bounds of polynomial threshold functions

In this report, we show that all n-variable Boolean function can be repr...
research
04/10/2019

Testing Unateness Nearly Optimally

We present an Õ(n^2/3/ϵ^2)-query algorithm that tests whether an unknown...
research
04/16/2021

Sharp bounds for the number of regions of maxout networks and vertices of Minkowski sums

We present results on the number of linear regions of the functions that...

Please sign up or login with your details

Forgot password? Click here to reset