Macaulay2 / Macaulay2/M2

Feature request: MutableIdeal

Open
#1,749 2 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Core
Dominant language
Macaulay2
Stars
435
Forks
297
Avg merge
4d 20h
Merged PRs (30d)
11

Description

I've seen a lot of cases where in each step of an iterative algorithm, an ideal is updated and the new ideal is used for some membership test. I think this is somewhat slow because:
- a new ideal is allocated and the old one is garbage collected in each step
- the groebner basis information of the old ideal may not survive

Would be good to add MutableIdeals that satisfy the two points above.

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

Research direction

Start by reading the issue's proposal for MutableIdeals and identify how iterative ideal updates and membership tests currently work. Clarify the required behavior for preserving Groebner basis information and avoiding repeated allocation. Done means the agreed MutableIdeals design satisfies both stated goals, with appropriate validation added.

Written by the indexing model from the issue text.

Assessment

Domain
backend
Issue type
Feature
Difficulty
5/5
Estimated time
Over a week
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
25/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.