diegoofernandez

6 ms·

1.
by diegoofernandez 11mo ago
Yes, absolutely! Great that you can see it as simpler and more accessible. Oh, that's a great... mmm... secret, you could say? Or logical reasoning... simplifying and reducing any problem to steps makes it digestible :)
2.
by diegoofernandez 11mo ago
Exactly, it's a bit unbelievable when you consider that the symbology has some unnecessary abstraction. But yes, it's really great to then discover that it's almost elementary, so to speak. It's something that stays with
3.
by diegoofernandez 11mo ago
Oh, sorry... I shouldn't post links so often. In one post I introduced the engine... in this one I'm trying to explain the concept of Grobner's bases using metaphors. I'll be more careful with that.
4.
How the most feared algorithm in algebra is simple
13 points by diegoofernandez 11mo ago|4 comments
5.
Mathematics are easy — You just have to see them differently(romimath.pages.dev)
2 points by diegoofernandez 11mo ago|1 comments
6.
by diegoofernandez 11mo ago
When I built my symbolic algebra engine (RomiMath) in TypeScript, I didn't start from the symbols — I started from the mechanics and the abstraction. I understood Buchberger's algorithm and Gröbner bases in four hours — not by mem
7.
Gröbner Bases Explained: From Abstract Algebra to Real-World Optimization
10 points by diegoofernandez 11mo ago|3 comments
8.
by diegoofernandez 11mo ago
Hi! Thanks for the excellent questions. It shows you're looking past the demo and into the core architecture. Language / Platform: The entire Romimath core engine is built purely in TypeScript, compiled directly to JavaScript (ES6
9.
by diegoofernandez 11mo ago
Author here. The journey from fractions to Gröbner in 3 months was brutal but enlightening. Technical insights for the HN crowd: - Optimized pair selection beats naive Buchberger by 40% - AST memory pooling handles 7-variable polynomial ex
10.
I built a Gröbner Basis engine that solves 7-variable systems in the browser
7 points by diegoofernandez 11mo ago|4 comments