
doi: 10.1007/bf01788547
Let \(a_ 1,...,a_ n\) be a sequence of nonzero real numbers such that \(\sum^{n}_{i=1}a_ i=0\). B is called a balancing set if \(\sum_{b\in B}a_ b=0\). Let f(n) be the maximum number of balancing sets. It is shown that \(f(n)=\left( \begin{matrix} 2k\\ k\end{matrix} \right)\) if \(n=2k\) and \(f(n)=2\left( \begin{matrix} 2k\\ k-1\end{matrix} \right)\) if \(n=2k+1\).
balancing set, maximum number, Combinatorial inequalities
balancing set, maximum number, Combinatorial inequalities
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
