• Home
  • Search
  • Maximal Sum-Free Sets in Elementary Abelian p-Groups
  • Cite Icon14
  • https://doi.org/10.4153/cmb-1971-014-2Copy DOI Icon

Maximal Sum-Free Sets in Elementary Abelian p-Groups

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Given an additive group G and nonempty subsets S, T of G, let S+T denote the set ﹛s + t | s ∊ S, t ∊ T﹜, S the complement of S in G and |S| the cardinality of S. We call S a sum-free set in G if (S+S) ⊆ S. If, in addition, |S| ≥ |T| for every sum-free set T in G, then we call S a maximal sum-free set in G. We denote by λ(G) the cardinality of a maximal sum-free set in G.

Similar Papers
  • Research Article
  • Citations7

1-Saturating Sets, Caps, and Doubling-Critical Sets in Binary Spaces

  • Jan 01, 2010
  • SIAM Journal on Discrete Mathematics
  • David J Grynkiewicz +1
  • Book Chapter
  • Citations1

Nested designs from sum-free sets

  • Jan 01, 1975
  • Anne Penfold Street +1
  • Research Article
  • Citations2

Maximal sum-free sets in finite Abelian groups, III

  • Aug 01, 1973
  • Journal of Number Theory
  • Hian-Poh Yap
  • Research Article
  • Citations1

Maximal non-commuting set in 2-generated p-groups of class two

  • Aug 23, 2018
  • Journal of Algebra and Its Applications
  • Pradeep Kumar +1
  • Book Chapter

A Brief Tour of Operator Theory

  • Jan 30, 2023
  • PDF
  • Research Article
  • Citations4

Groups Containing Small Locally Maximal Product-Free Sets

  • Oct 13, 2016
  • International Journal of Combinatorics
  • Chimere S Anabanti +1
  • Research Article
  • Citations7

Direct and inverse theorems on signed sumsets of integers

  • Oct 22, 2018
  • Journal of Number Theory
  • Jagannath Bhanja +1
  • Research Article
  • Citations58

Independence polynomials of well-covered graphs: Generic counterexamples for the unimodality conjecture

  • Jun 13, 2005
  • European Journal of Combinatorics
  • Vadim E Levit +1
  • Conference Article
  • Citations12

Fast Algorithms for Finding Extremal Sets

  • Apr 28, 2011
  • Roberto J Bayardo +1
  • Research Article
  • Citations3

Bounds on 2-point set domination number of a graph

  • Feb 01, 2018
  • Discrete Mathematics, Algorithms and Applications
  • Purnima Gupta +1
  • Research Article
  • Citations2

EFFECTIVELY CLOSED INFINITE-GENUS SURFACES AND THE STRING COUPLING

  • Feb 10, 2005
  • International Journal of Modern Physics A
  • Simon Davis
  • Research Article
  • Citations7

A quadratic lower bound for subset sums

  • Jan 01, 2007
  • Acta Arithmetica
  • Matt Devos +3
  • Research Article

On open distance pattern coloring of graphs

  • Nov 20, 2025
  • Discrete Mathematics Algorithms and Applications
  • Linet Dsouza +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.