Back in the 60's when I was taking German in high school the books still
used the Eszett symbol. Also remember Stan Freberg's skit on the
Delcaration of Independence and the purfuit of happiness (Jefferson's
fancy spelling using an Eszett letter).
On 3/22/23 7:37 PM, Aaron Meurer wrote:
The oe spelling is common for Gröbner because in many code contexts,
the ö Unicode character is either not allowed or avoided. For
instance, in Python, even though we can use ö in variable names, such
usage is generally avoided to make things easier for people to type,
which is why the SymPy function is called groebner(). In SymPy
documentation either spelling can be used. An advantage of using
Groebner even in contexts where Gröbner would be fine is that it more
closely matches the name used in the Python API, and many readers may
not know that "ö" corresponds to "oe".
By the way, I find it interesting that almost no one maintains the ß
character in German words or names in Romanized transliterations (like
Gauß), but letters with accents are often maintained. I don't know if
there are grammatical or historical reasons for this, or if it's just
because English speakers are more accepting of Latin letters with
accents than with completely non-Latin letters.
Aaron Meurer
On Sun, Mar 19, 2023 at 5:22 AM <[email protected]> wrote:
Here’s just a little note on the German name Gröbner. The letters ä, ö, and ü
can be substituted by ae, oe, and ue and, in fact, the form oe is older than ö.
However, some proper names, such as Goethe, always use oe and not ö. The
Gröbner basis was named after the mathematician Wolfgang Gröbner, so we see
that the proper name in this case is Gröbner. If the substitution is applied,
the result is Groebner. In other languages, such a Finnish, the rules are
different.
Tom
(Dr. Thomas S. Ligon)
[email protected]
Frohnloher Str. 6a
81475 Muenchen
Germany
Tel. +49(89)74575075
From: [email protected] <[email protected]> On Behalf Of Chris Smith
Sent: Sunday, March 19, 2023 7:52 AM
To: sympy <[email protected]>
Subject: Re: [sympy] Self Introductory and Gröebner Bases
There is some preliminary work at https://github.com/sympy/sympy/issues/23665
that aims to improve exponentiation of certain types of polynomials. It might
be a good GSOC task.
/c
On Saturday, March 18, 2023 at 9:18:10 PM UTC-5 Chris Smith wrote:
update: When reviewing this it is not clear to me how much of this already made
it in in some form or another. Look for PRs be author:pernici that were
committed. Search also for lpoly.
/c
On Saturday, March 18, 2023 at 11:57:58 AM UTC-5 Chris Smith wrote:
There was some promising work (as I recall) that stalled at
https://github.com/sympy/sympy/pull/609. See discussion there for idea to get
that work from level 0 representation of Poly to level 1.
/c
On Friday, March 17, 2023 at 8:16:48 PM UTC-5 Oscar wrote:
On Fri, 17 Mar 2023 at 20:39, Aaron Meurer <[email protected]> wrote:
On Sun, Mar 12, 2023 at 3:04 PM Atahan Haznedar
<[email protected]> wrote:
Hello Oscar,
Sorry for the late reply, after seeing the post you have made, I can pretty
much can say that I am really excited! There are lots of things on the
polynomial side to be done as far as I can see. I am not that familiar with
Sympy at the moment so probably I am just going to tinker and try to get used
to using Sympy in my leisure time by implementing some examples and algorithms
that I have studied so far. So probably I am not going to be able to make a
contribution soon. Is this a problem for my submission on GSoC?
Most polynomial algorithms are already implemented in SymPy, but if
you find something that's missing that would definitely be a good
submission. Otherwise, I would recommend finding some bugs to fix
(e.g. from the sympy issue tracker). That's generally the best way to
learn about the codebase in my experience.
While many of the most needed algorithms are implemented there is
plenty of scope to improve those implementations or to implement
better algorithms. More commonly though the problem is that the
algorithms are not being used very well by the rest of SymPy. Groebner
bases are a good example here because the algorithms are there and
they work but:
1. By default Groebner uses the slower buchberger algorithm even
though f5b is implemented and similarly many places want a zero
dimensional basis but don't make use of the existing fglm algorithm.
2. The code that consumes the output of Groebner can be massively
improved. The code to solve systems of polynomial equations in solve
and nonlinsolve uses Groebner but really does not do a good job of
processing the output of groebner:
https://github.com/sympy/sympy/issues/24868
The number one priority around Groebner bases is not implementing new
algorithms to compute them but rather improving the way that the
existing algorithms are used in the codebase.
--
Oscar
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To view this discussion on the web visit
https://groups.google.com/d/msgid/sympy/3b6ac8d8-caed-4f24-a74f-fb9afca48daen%40googlegroups.com.
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To view this discussion on the web visit
https://groups.google.com/d/msgid/sympy/001401d95a55%24049a2070%240dce6150%24%40gmail.com.
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To view this discussion on the web visit
https://groups.google.com/d/msgid/sympy/7e1b243b-7150-7066-df19-ce121903bce2%40gmail.com.
