pishleback / pishleback/Algebraeon
Quotient rings of of Z[x]
Open
Nobody has claimed this yet.
enhancement
- Dominant language
- Rust
- Stars
- 82
- Forks
- 10
- PR merge metrics
- No merged PRs in 30d
Description
Z[x] is not a Euclidean domain, so this will need a special implementation. Possibly using the existing division with pseudo-remainders.
Questions:
- How can addition, multiplication, and equality be implemented efficiently?
- Could the implementation for Z[x] be extended to quotients of R[x] for other rings R?
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
The issue names existing division with pseudo-remainders as a possible starting point, but no file or test is identified. Review that implementation and determine how quotient-ring addition, multiplication, and equality should work for Z[x]. Done requires a defined implementation scope and an assessment of whether it extends to quotients of R[x].
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- backend
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100