Y. Tarannikov

activity

20212026

most citedAn asymptotic lower bound on the number of bent functions

10 citations · 10 across the 3 of their papers we have counts for

collaborators

3 papers

cs.CC2026

On a Boolean function without bold folding in the spectrum support and implications for greedy approaches to PDT depth

Yuriy Tarannikov

We study Boolean functions and their Fourier spectrum supports in the context of parity decision trees (PDTs). Recently, H.~Hatami et al.~\cite{HHL+} constructed examples whose Fou…

math.CO2025

On the number of partitions of the hypercube $Z_{q}^{n}$ into large subcubes

Yuriy Tarannikov

We prove that the number of partitions of the hypercube $Z_{q}^{n}$ into $q^{m}$ subcubes of dimension $n - m$ each for fixed $q$ , $m$ and growing $n$ is asymptotically equal to $n^{…

math.CO2021★ 10 cited

An asymptotic lower bound on the number of bent functions

V. N. Potapov, A. A. Taranenko, Yu. V. Tarannikov

A Boolean function $f$ on $n$ variables is said to be a bent function if the absolute value of all its Walsh coefficients is $2^{n /2}$ . Our main result is a new asymptotic lower bo…

On a Boolean function without bold folding in the spectrum support and implications for greedy approaches to PDT depth

On the number of partitions of the hypercube Zqn​ into large subcubes

An asymptotic lower bound on the number of bent functions

On the number of partitions of the hypercube $Z_{q}^{n}$ into large subcubes