A method to count the positive 3-subsets in a set of real numbers with non-negative sum

DOI10.1006/EUJC.2002.0587zbMATH Open1021.05003OpenAlexW1987300137MaRDI QIDQ1864576FDOQ1864576

Authors: Giuseppe Marino, G. Chiaselotti 

Publication date: 18 March 2003

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.2002.0587

Recommendations

• Solution of a problem on non-negative subset sums
• scientific article; zbMATH DE number 2095511
• The number of \((2,3)\)-sum-free subsets of \(\{1,\dots,n\}\)
• scientific article; zbMATH DE number 2147936
• A remark on the problem of nonnegative \(k\)-subset sums
• On the number and structure of sum-free sets in a segment of positive integers
• On the number of sum-free triplets of sets
• On the density of sets containing no three distinct numbers with all their sums
• A construction for sets of integers with distinct subset sums
• On sums of subsets of a set of integers

zbMATH Keywords

real numbers with nonnegative sum

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Other combinatorial number theory (11B75)

Cites Work

• Title not available (Why is that?)
• First distribution invariants and EKR theorems
• Title not available (Why is that?)
• The first distribution invariant of the Johnson-scheme
• On a problem concerning the weight functions
• Title not available (Why is that?)
• W-complement d-spreads, singleton systems

Cited In (20)

• The minimum number of nonnegative edges in hypergraphs
• The adjacency matrix of a graph as a data table: a geometric perspective
• On the number of nonnegative sums
• Solution of a problem on non-negative subset sums
• A minimum problem for finite sets of real numbers with nonnegative sum
• On some numbers related to extremal combinatorial sum problems
• A linear bound on the Manickam-Miklós-Singhi conjecture
• Parallel rank of two sandpile models of signed integer partitions
• The Manickam-Miklós-Singhi conjectures for sets and vector spaces
• A linear programming approach to the Manickam-Miklós-Singhi conjecture
• A note on the Manickam-Miklós-Singhi conjecture
• An improved bound for the Manickam-Miklós-Singhi conjecture
• On the number of nonnegative sums for semi-partitions
• On a conjecture of Manickam and Singhi
• Parallel and sequential dynamics of two discrete models of signed integer partitions
• Sand piles models of signed partitions with \(d\) piles
• On the number of nonnegative sums for certain function
• New results related to a conjecture of Manickam and Singhi
• A remark on the problem of nonnegative \(k\)-subset sums
• Nonnegative \(k\)-sums, fractional covers, and probability of small deviations

This page was built for publication: A method to count the positive 3-subsets in a set of real numbers with non-negative sum

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