A method to count the positive 3-subsets in a set of real numbers with non-negative sum
From MaRDI portal
Publication:1864576
DOI10.1006/eujc.2002.0587zbMath1021.05003OpenAlexW1987300137MaRDI QIDQ1864576
Giampiero Chiaselotti, Giuseppe Marino
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
Related Items (19)
The adjacency matrix of a graph as a data table: a geometric perspective ⋮ Parallel rank of two sandpile models of signed integer partitions ⋮ Parallel and sequential dynamics of two discrete models of signed integer partitions ⋮ The minimum number of nonnegative edges in hypergraphs ⋮ Nonnegative \(k\)-sums, fractional covers, and probability of small deviations ⋮ A remark on the problem of nonnegative \(k\)-subset sums ⋮ Solution of a problem on non-negative subset sums ⋮ On a conjecture of Manickam and Singhi ⋮ Sand piles models of signed partitions with \(d\) piles ⋮ A minimum problem for finite sets of real numbers with nonnegative sum ⋮ A linear programming approach to the Manickam-Miklós-Singhi conjecture ⋮ An improved bound for the Manickam-Miklós-Singhi conjecture ⋮ The Manickam-Miklós-Singhi conjectures for sets and vector spaces ⋮ New results related to a conjecture of Manickam and Singhi ⋮ On some numbers related to extremal combinatorial sum problems ⋮ A note on the Manickam-Miklós-Singhi conjecture ⋮ On the number of nonnegative sums for certain function ⋮ On the number of nonnegative sums for semi-partitions ⋮ A linear bound on the Manickam-Miklós-Singhi conjecture
Cites Work
This page was built for publication: A method to count the positive 3-subsets in a set of real numbers with non-negative sum
