Proposal for GSoC 2025 – Fixing direct_product and Related Methods in Permutation Groups (Issue #34504)

[Sudarshan Dandgawal]

Hi SageMath Community,

I'm Sudarshan Dandgawal, a computer engineering student interested in contributing to SageMath through Google Summer of Code (GSoC) 2025. I have been exploring Issue #34504, which addresses inconsistencies in direct_product, semidirect_product, and direct_product_permgroups for permutation groups.

Currently, these methods do not properly retain the original domains of the input groups when computing their products. This leads to incorrect behavior, especially when the groups operate on disjoint domains. My proposed solution involves:

1. Ensuring the resulting permutation group correctly reflects the union of the original domains.

2. Implementing relabeling mechanisms to maintain consistency.

3. Adding comprehensive test cases to verify correctness.

I would like to know if this issue could be considered as a suitable GSoC 2025 project. If so, I would be happy to draft a detailed proposal around it. Additionally, I’d appreciate any insights from the community regarding:

• Potential challenges or edge cases I should consider while working on this.

• Preferred approaches for handling domain mapping and relabeling.

• Any other guidance to ensure my proposal aligns well with SageMath’s development goals.

Looking forward to your feedback and suggestions!

Best regards,
Sudarshan Dandgawal

[Travis Scrimshaw]

Dear Sudarshan,

   Thank you for your interest in GSoC. However, this mailing list is for issues related to development of Sage, not for GSoC proposal discussions. Please post such messages to the sage-gsoc list.

Thank you,
Travis