I think that you should add a new method like **intersect**. I'm sure that
intersections form a group, so it can be an another PermutationGroup, but
union may not.
On Sunday, February 16, 2020 at 4:32:05 AM UTC+9, Mohit Gupta wrote:
>
> Hello everyone,
>
> I was thinking of Implementing
Hi,
Yes, those algorithms are relevant to SymPy. For the first one, you might
be interested in completing this PR:
https://github.com/sympy/sympy/pull/2449. It should be possible to make it
work also with finite fields and rings.
Kalevi Suominen
On Sunday, February 16, 2020 at 7:52:26 PM
Hey sympy community, my name is Abhinav and i am from India. I have posted
a rough draft of gsoc proposal earlier and i need to confirm that if this
can be a Gsoc proposal.
Currently sympy uses special case factorization algorithms like pollard rho
etc. for integer factorization which works
Thanks, Aaron. I will research those. After I am done, should I discuss
those here or create a proposal and submit it somewhere (before actual
submission of proposal in GSoC website)? Also, do I need to contribute to
sympy before writing the proposal (I am new in this community)?
On Sunday,
The idea is somewhat open. There is already an existing LaTeX parser
that uses ANTLR, but it could be improved. If you determine that
another parser would be better, than we can switch. Also if you find
something that already knows how to generate an AST for LaTeX we can
look at using that as
