The primary source code repository for Macaulay2, a system for computing in commutative algebra, algebraic geometry and related fields.

3 Open Issues Need Help Last updated: Jul 1, 2025

Open Issues Need Help

View All on GitHub

AI Summary: Implement a Macaulay2 method that constructs a permutation from a given integer partition. The method should create cycles based on the partition's parts and combine them into a single permutation. For example, the partition (4,3,2,1) should produce the permutation (8,9,10,7,5,6,4,3,2,1).

Complexity: 3/5
enhancement good first issue

The primary source code repository for Macaulay2, a system for computing in commutative algebra, algebraic geometry and related fields.

Macaulay2

AI Summary: Implement a helper method in Macaulay2 to construct the symmetric group S_n. This involves adding a new function that efficiently generates the symmetric group given an integer n, likely using existing group theory functionalities within Macaulay2. The implementation should be well-tested and adhere to Macaulay2's coding style and contribution guidelines.

Complexity: 3/5
enhancement good first issue

The primary source code repository for Macaulay2, a system for computing in commutative algebra, algebraic geometry and related fields.

Macaulay2

AI Summary: Implement a `majorIndex` method for permutations in the Macaulay2 system. This involves calculating the sum of indices where inversions occur within a permutation and adding this functionality as a new method.

Complexity: 3/5
enhancement good first issue

The primary source code repository for Macaulay2, a system for computing in commutative algebra, algebraic geometry and related fields.

Macaulay2