3 papers
math.CO2025
On extremal properties of perfect 2-colorings
Vladimir N. Potapov
A coloring of vertices of a graph is called perfect if, for every vertex, the collection of colors of its neighbors depends only on its own color. The correspondent color partition…
cs.IT2024
Upper bounds on the numbers of binary plateaued and bent functions
Vladimir N. Potapov
The logarithm of the number of binary n-variable bent functions is asymptotically less than as n tends to infinity. Keywords: boolean function, Walsh--Hadamard transfo…
math.CO2024
An upper bound on the number of frequency hypercubes
Denis S. Krotov, Vladimir N. Potapov
A frequency -cube is an -dimensional -by-...-by- array, where , filled by numbers with the property that each…