Bounds on the Number of Maximal Sum-Free Sets

13 years 4 months ago

Download cs.haifa.ac.il

We show that the number of maximal sum-free subsets of {1, 2, . . . , n} is at most 23n/8+o(n) . We also show that 20.406n+o(n) is an upper bound on the number of maximal product-free subsets of any group of order n.

Guy Wolfovitz

Real-time Traffic

ENDM 2007 | Maximal Product-free Subsets | Maximal Sum-free Subsets | Upper Bound |

claim paper

» Deterministic Dominating Set Construction in Networks with Bounded Degree

» Fast Deterministic Distributed Maximal Independent Set Computation on GrowthBounded Graphs

» The number of extreme points of tropical polyhedra

» Wavelength Management in WDM Rings to Maximize the Number of Connections

» An optimal maximal independent set algorithm for boundedindependence graphs

» Theoretical Bounds for the Number of Inferable Edges in Sparse Random Networks

» Network Coding for Computing CutSet Bounds

» Constructing Stochastic Pyramids by MIDES Maximal Independent Directed Edge Set

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	ENDM
Authors	Guy Wolfovitz

Comments (0)

Sciweavers

Bounds on the Number of Maximal Sum-Free Sets

ENDM 2007 | Maximal Product-free Subsets | Maximal Sum-free Subsets | Upper Bound |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers