Year: 2017
Type: preprint
Abstract: In this paper, we present an algorithm which allows us to search for all the bisections for the binomial coefficients $\{\binom{n}{k} \}_{k=0,...,n}$ and include a table with the results for all $n\le 154$. Connections with previous work on this topic is included. We conjecture that the probability of having only trivial solutions is $5/6$. \end{abstract}
Source: arXiv (Cornell University)
Author: Ionascu, Eugen J.
Institution: Columbus State University
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2949436791