Guidici, M. and Hart, Sarah (2009) Small maximal sum-free sets. Electronic Journal of Combinatorics 16 (1), ISSN 1077-8926.
This is the latest version of this item.
|
Text
Shart815.pdf Download (224kB) | Preview |
Official URL: http://www.emis.de/journals/EJC/Volume_16/PDF/v16i...
Abstract
Let G be a group and S a non-empty subset of G. If ab∉S for any a,b∈S, then S is called sum-free. We show that if S is maximal by inclusion and no proper subset generates ⟨S⟩ then |S|≤2. We determine all groups with a maximal (by inclusion) sum-free set of size at most 2 and all of size 3 where there exists a∈S such that a∉⟨S∖{a}⟩.
Metadata
| Item Type: | Article |
|---|---|
| Additional Information: | First published in Electronic Journal of Combinatorics 16, (1), 2009, Research Paper 59, published by the American Mathematical Society. |
| Keyword(s) / Subject(s): | sum-free sets, groups |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hart |
| Date Deposited: | 03 Nov 2009 17:32 |
| Last Modified: | 09 Aug 2023 12:29 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/815 |
Available Versions of this Item
-
Small maximal sum-free sets. (deposited 10 Jan 2007)
- Small maximal sum-free sets. (deposited 03 Nov 2009 17:32) [Currently Displayed]
Statistics
Downloads
Activity Overview
6 month trend
6 month trend
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
Edit/View Item