The maximum number of balancing sets
From MaRDI portal
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\).
Recommendations
- On the maximum number of balancing subsets
- On the maximum number of constraints for some balanced arrays
- scientific article; zbMATH DE number 3846696
- Balanced Maximum Counting Sequences
- Lower bound for balanced sets
- Maximizing the number of independent sets of a fixed size
- On the maximum number of maximum independent sets
- On linear balancing sets
- On k-balancing numbers
Cites work
- A finite set covering theorem II
- Erdös Conjecture on Sums of Distinct Numbers
- Families of \(k\)-independent sets
- scientific article; zbMATH DE number 3573875 (Why is no real title available?)
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On A Problem of Purdy Related to Sperner Systems
- On the maximum number of balancing subsets
- Sperner systems consisting of pairs of complementary subsets
- Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
Cited in
(6)
This page was built for publication: The maximum number of balancing sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1092046)
