Bisecting binomial coefficients

DOI10.1016/J.DAM.2017.04.035zbMATH Open1365.05011arXiv1610.02063OpenAlexW2963308907MaRDI QIDQ2357134FDOQ2357134

Eugen J. Ionascu, Pantelimon Stanica, Thor Martinsen

Publication date: 19 June 2017

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

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.

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Enumerating Boolean functions of cryptographic significance
• Polynomials with two values
• Sporadic partitions of binomial coefficients
• A note on a conjecture concerning symmetric resilient functions
• Title not available (Why is that?)
• \(k\)th order symmetric SAC Boolean functions and bisecting binomial coefficients
• Computing Binomial Coefficients
• Title not available (Why is that?)
• An Effective Formula for the Number of Solutions of Linear Boolean Equations
• Solving dense subset-sum problems by using analytical number theory
• Some Unexpected Connections Between Analysis and Combinatorics
• The Diophantine equation \(x^2 - Dy^2 = N\), \(D>0\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Construction and enumeration of balanced rotation symmetric Boolean functions
• A variation on bisecting the binomial coefficients
• 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)