S.Y. Lee

Yes, however, I also suspect that `earley` causes the performance problem though. https://github.com/sympy/sympy/blob/7bdc1123bbfec2216af01710d7a6cc2c20b02ef2/sympy/parsing/latex/lark/latex_parser.py#L55 The graph https://github.com/lark-parser/lark?tab=readme-ov-file#performance-comparison discourages `earley` for performance specifically.

> I also had an idea that we could interface with an LLM to do the LaTeX -> SymPy translation, but I don't think anyone's looked into it. I obviously...

I'm not sure if the arithmetic is too trivial there such that we don't need to implement the function for this.

I think that it's better to fix the definition in the documentation to make it reasonable (let's say, add some word like 'mirrored') than to fix the code because it...

I think that there are only two articles so far relevant to the discussion. https://academic.oup.com/comjnl/article/36/5/432/392361 https://core.ac.uk/download/pdf/82649664.pdf However, I'm not really sure if LC + Discriminants + Pairwise resultants can be...

> Our limited goal here maybe does not need as much as full CAD. I think that this applies to the limited CAD, like here as well. I think that...

> You can use Poly.real_roots rather than Expr. I thought that we should also avoid `Poly` as well, because that uses dense representation. Maybe we only need dense univariate polynomial...

> A full factorisation of everything would handle these cases but I'm not sure if that is a good idea: I think that Strzebonski's article does not worry about using...

I think that Strzebonski's article is good because it can be implementation with proof, and contains concrete algorithm such that we can extend with design/API issues.

QEPCAD also contains the test sets, which can be helpful to verify the implementation in some scale https://github.com/chriswestbrown/qepcad/tree/master/regressiontests