A variation on bisecting the binomial coefficients
From MaRDI portal
Abstract: In this paper, we present an algorithm which allows us to search for all the bisections for the binomial coefficients and include a table with the results for all . Connections with previous work on this topic is included. We conjecture that the probability of having only trivial solutions is . end{abstract}
Recommendations
Cites work
- A note on a conjecture concerning symmetric resilient functions
- Balancedness and correlation immunity of symmetric Boolean functions
- Bisecting binomial coefficients
- Diophantine Equations With Binomial Coefficients and Perturbations of Symmetric Boolean Functions
- Enumerating Boolean functions of cryptographic significance
- On the degree of univariate polynomials over the integers
- On the greatest common divisor of binomial coefficients
- Polynomials with two values
- Sporadic partitions of binomial coefficients
- The greatest common divisor of certain sets of binomial coefficients
- \(k\)th order symmetric SAC Boolean functions and bisecting binomial coefficients
This page was built for publication: A variation on bisecting the binomial coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801069)