Abstract
The paper presents three algorithms. The first algorithm determines the possibility of embedding a free nilpotent group in a given partially commutative nilpotent group of the same nilpotency class. The second algorithm determines the possibility of embedding one partially commutative nilpotent group of class two into another. The third algorithm determines the possibility of embedding an arbitrary partially commutative nilpotent group in a free nilpotent group of the same nilpotency class. It is shown how these embeddings are made. The results are presented without proofs. The paper is in the nature of a review. The full text describing the first of the above algorithms has been accepted for publication and will be published in [1].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
