On the maximum number of balancing subsets

DOI10.1016/0304-4068(84)90011-9MaRDI QIDQ801907zbMATH OpenOpenAlexWikidataFDO

Authors Seiji Nabeya

Publication date 1984

Published in Journal of Mathematical Economics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-4068(84)90011-9

zbMATH Keywords

combinatorial problemmaximum number of balancing subsets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Recommendations

• The maximum number of balancing sets
• On sets whose subsets have integer mean
• Balanced subset sums in dense sets of integers
• Properties of balancing, cobalancing and generalized balancing numbers
• ON MAXIMAL SUBSET-SUM-DISTINCT SEQUENCES

Cites work

• Walras degrees and probability of a blocking coalition at Pareto allocations

Cited in

(7)

• Balanced 2-subsets
• On structural decompositions of finite frames
• The maximum number of balancing sets
• On sets whose subsets have integer mean
• Balanced Maximum Counting Sequences
• Maximizing the Number of Nonnegative Subsets
• Walras degrees and probability of a blocking coalition at Pareto allocations

This page was built for publication: On the maximum number of balancing subsets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q801907)