An upper bound on binomial coefficients in the de Moivre-Laplace form
Combinatorics
2022-05-17 v1
Abstract
We suggest an upper bound on binomial coefficients that holds over the entire parameter range and whose form repeats the form of the de Moivre-Laplace approximation of the symmetric binomial distribution. Using the bound, we estimate the number of continuations of a given Boolean function to bent functions, investigate dependencies into the Walsh-Hadamard spectra, obtain restrictions on the number of representations as sum of squares of integers bounded in magnitude.
Cite
@article{arxiv.2205.07120,
title = {An upper bound on binomial coefficients in the de Moivre-Laplace form},
author = {Sergey Agievich},
journal= {arXiv preprint arXiv:2205.07120},
year = {2022}
}