Bisecting binomial coefficients

DOI10.1016/J.DAM.2017.04.035MaRDI QIDQ2357134zbMATH OpenOpenAlexFDO

Authors Thor Martinsen, Pantelimon Stanica, Eugen J. Ionascu

Publication date 19 June 2017

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1610.02063

zbMATH Keywords

Diophantine equationsbinomial coefficientssubset sum problem

Mathematics Subject Classification ID

Cryptography (94A60) Factorials, binomial coefficients, combinatorial functions (05A10) Diophantine equations (11D99)

Abstract: In this paper, we deal with the problem of bisecting binomial coefficients. We find many (previously unknown) infinite classes of integers which admit nontrivial bisections, and a class with only trivial bisections. As a byproduct of this last construction, we show conjectures Q2 and Q4 of Cusick and Li. We next find several bounds for the number of nontrivial bisections and further compute (using a supercomputer) the exact number of such bisections for n <= 51.

Recommendations

• A variation on bisecting the binomial coefficients
• On divisors of binomial coefficients. I
• ON DIVISIBILITY OF ${\fontsize{9}{11}\selectfont\Big(\!\!\begin{array}{c}n-i-1\\[2pt]i-1\end{array}\!\!\Big)}$ by i
• On the Prime Factors of \binom2nn
• scientific article; zbMATH DE number 4101293

Cites work

• scientific article; zbMATH DE number 4179290 (Why is no real title available?)
• scientific article; zbMATH DE number 4103173 (Why is no real title available?)
• scientific article; zbMATH DE number 3719153 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 1114507 (Why is no real title available?)
• scientific article; zbMATH DE number 1896943 (Why is no real title available?)
• scientific article; zbMATH DE number 5206441 (Why is no real title available?)
• scientific article; zbMATH DE number 3373676 (Why is no real title available?)
• A note on a conjecture concerning symmetric resilient functions
• An Effective Formula for the Number of Solutions of Linear Boolean Equations
• Computing Binomial Coefficients
• Enumerating Boolean functions of cryptographic significance
• Polynomials with two values
• Solving dense subset-sum problems by using analytical number theory
• Some unexpected connections between analysis and combinatorics
• Sporadic partitions of binomial coefficients
• The Diophantine equation \(x^2 - Dy^2 = N\), \(D>0\)
• \(k\)th order symmetric SAC Boolean functions and bisecting binomial coefficients

Cited in

(3)

• A variation on bisecting the binomial coefficients
• Construction and enumeration of balanced rotation symmetric Boolean functions
• Closed formulas for exponential sums of symmetric polynomials over Galois fields

This page was built for publication: Bisecting binomial coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2357134)