D-sets Generated by a Subset of a Group
Keywords:
groups, D-sets, index minimumAbstract
A subset D of a group G is a D-set if every element of G, not in D, has its inverse in D. Let A be a non-empty subset of G. A smallest D-set of G that contains A is called a D-set generated by A, denoted by <A>. Note that <A> may not be unique. This paper characterized sets A with unique <A> and sets whose number of generated D-sets is equal to the index minimum.Downloads
Published
2016-01-27
Issue
Section
Computer Science
License
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.
How to Cite
D-sets Generated by a Subset of a Group. (2016). European Journal of Pure and Applied Mathematics, 9(1), 34-38. https://www.ejpam.com/index.php/ejpam/article/view/2473