Disjoint direct product decomposition of a permutation group #38371
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
mantepse
reviewed
Jul 15, 2024
mantepse
reviewed
Jul 15, 2024
mantepse
reviewed
Jul 15, 2024
|
Documentation preview for this PR (built with commit 2d8e920; changes) is ready! 🎉 |
mantepse
reviewed
Jul 15, 2024
mantepse
reviewed
Jul 15, 2024
mantepse
reviewed
Jul 16, 2024
mantepse
reviewed
Jul 16, 2024
mantepse
reviewed
Jul 16, 2024
mantepse
reviewed
Jul 16, 2024
mantepse
reviewed
Jul 16, 2024
fchapoton
reviewed
Jul 16, 2024
|
Why doesn't the method appear in the table of methods on the Permutation Groups page in the doc preview? |
|
That seems to be a problem of |
mantepse
added
s: positive review
gsoc: 2024
5 tasks
vbraun
pushed a commit
to vbraun/sage
that referenced
this pull request
Nov 9, 2024
Related to sagemath#30727. We implement basic functionality for multivariate polynomial species, using its representation as a pair of a permutation group and a mapping between the domain of the permutation group and some variables. We provide addition, multiplication, and (partitional) composition (for some special cases). We also allow it to be constructed as a group action (or a sequence thereof). Atomic and molecular decompositions are automatically computed thanks to sagemath#38371. ### 📝 Checklist - [x] The title is concise and informative. - [x] The description explains in detail what this PR is about. - [x] I have linked a relevant issue or discussion. - [ ] I have created tests covering the changes. - [ ] I have updated the documentation and checked the documentation preview. URL: sagemath#38446 Reported by: Mainak Roy Reviewer(s): Mainak Roy, Martin Rubey, Travis Scrimshaw
vbraun
pushed a commit
to vbraun/sage
that referenced
this pull request
Nov 13, 2024
Related to sagemath#30727. We implement basic functionality for multivariate polynomial species, using its representation as a pair of a permutation group and a mapping between the domain of the permutation group and some variables. We provide addition, multiplication, and (partitional) composition (for some special cases). We also allow it to be constructed as a group action (or a sequence thereof). Atomic and molecular decompositions are automatically computed thanks to sagemath#38371. ### 📝 Checklist - [x] The title is concise and informative. - [x] The description explains in detail what this PR is about. - [x] I have linked a relevant issue or discussion. - [ ] I have created tests covering the changes. - [ ] I have updated the documentation and checked the documentation preview. URL: sagemath#38446 Reported by: Mainak Roy Reviewer(s): Mainak Roy, Martin Rubey, Travis Scrimshaw
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This PR implements the disjoint direct decomposition of a permutation group, which is a partition of its domain such that the group is isomorphic to the direct product of its projection onto each part of the partition. Each part is a union of orbits.
The algorithm used is an adaptation of https://arxiv.org/abs/2004.11618v3. Additionally, the output of this algorithm is guaranteed to be the finest such partition, that is the groups formed from each part are themselves d.d.p indecomposable.
An implementation of the algorithm in the paper by the authors is available at https://github.com/peal/DisjointDirectProdDecomposition.
📝 Checklist