z-logo
open-access-imgOpen Access
Groups Containing Small Locally Maximal Product-Free Sets
Author(s) -
Chimere S. Anabanti,
Sarah B. Hart
Publication year - 2016
Publication title -
international journal of combinatorics
Language(s) - English
Resource type - Journals
eISSN - 1687-9171
pISSN - 1687-9163
DOI - 10.1155/2016/8939182
Subject(s) - algorithm , artificial intelligence , computer science
Let G be a group, and S a non-empty subset of G. Then S is product-free if ab is not in S for all a, b in S. We say S is locally maximal product-free if S is product-free and not properly contained in any other product-free set. A natural question is to determine the smallest possible size of a locally maximal product-free set in G. Alternatively, given a positive integer k, one can ask: what is the largest integer n_k such that there is a group of order n_k with a locally maximal product-free set of size k? The groups containing locally maximal product-free sets of sizes 1 and 2 are known, and it has been conjectured that n_3 = 24. The purpose of this paper is to prove this conjecture and hence show that the list of known locally maximal product-free sets of size 3 is complete. We also report some experimental observations about the sequence n_k

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom