Graphs and Combinatorics

, Volume 3, Issue 1, pp 251–254 | Cite as

The maximum number of balancing sets

  • Zoltán Füredi


Leta1, ...,a n be a sequence of nonzero real numbers with sum zero.A subsetB of {1, 2,...,n} is called a balancing set if∑ a b = 0 (b ∈ B). S. Nabeya showed that the number of balancing sets is bounded above by\(\left( {\begin{array}{*{20}c} n \\ {{n \mathord{\left/ {\vphantom {n 2}} \right. \kern-\nulldelimiterspace} 2}} \\ \end{array} } \right)\) and this bound achieved forn even witha j =(−1) j . Here his conjecture is verified, showing a tight upper bound\(\left( {\begin{array}{*{20}c} {2k} \\ {k - 1} \\ \end{array} } \right)\) whenn = 2k + 1. The essentially unique extremal configuration is:a1 = 2,a2 = ... =a k = 1,a k+1 = ... =a 2k+1 = -1.


Real Number Nonzero Real Number Extremal Configuration 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bollobás, B.: Sperner systems consisting of pairs of complementary subsets. J. Comb. Theory (A)15, 363–366 (1973)Google Scholar
  2. 2.
    Brace, A., Daykin, D.E.: Sperner type theorems for finite sets. In: Combinatorics (Proc. Conf. Combinatorial Math. Oxford, 1972), pp. 18–37. Southend-on-Sea: Inst. Math. Appl. 1972Google Scholar
  3. 3.
    Erdös, P., Rado, R., Ko, C.: Intersection theorems for system of finite sets. Q. J. Math. Oxford (2)12, 313–320 (1961)Google Scholar
  4. 4.
    Kleitman, D.J., Spencer, J.: Families ofk-independent sets. Discrete Math.6, 255–262 (1973)Google Scholar
  5. 5.
    Nabeya, S.: On the maximum number of balancing subsets. J. Math. Econ.13, 123–126 (1984)Google Scholar
  6. 6.
    Peck, G.W.: Erdös conjecture on sums of distinct numbers. Stud. Appl. Math.63, 87–92 (1980)Google Scholar
  7. 7.
    Purdy, G.: A result on Sperner collections. Utilitas Math.12, 95–99 (1977)Google Scholar
  8. 8.
    Schönheim, J.: On a problem of Purdy related to Sperner systems. Canad. Math. Bull.17, 135–136 (1974)Google Scholar
  9. 9.
    Sperner, E.: Ein Satz über Untermengen einer endlichen Menge. Math. Z.27, 544–548 (1928)Google Scholar
  10. 10.
    Stanley, R.P.: Weyl groups, the hard Lefschetz theorem, and the Sperner property. SIAM J. Algebraic Discrete Methods1, 168–184 (1980)Google Scholar

Copyright information

© Springer-Verlag 1987

Authors and Affiliations

  • Zoltán Füredi
    • 1
    • 2
  1. 1.Department of MathematicsM.I.T.CambridgeUSA
  2. 2.AT&T Bell LaboratoriesMurray HillUSA

Personalised recommendations