[sage-devel] Syntax for callable symbolic expressions causes too much confusion

Dear sage-devel, The syntax for ​callable symbolic expressions ( http://doc.sagemath.org/html/en/reference/calculus/sage/symbolic/callable.html) works in the simplest cases, but beyond that it breaks down and causes much confusion, as can be often seen on ​Ask SageMath

[sage-devel] is_galois() / automorphisms() can be made faster

Dear sage-devel, For a number field K, I believe the methods K.is_galois() and/or K.automorphisms() can be made faster. In short: the methods use PARI, and in PARI it is faster to call nfgaloisconj(f) instead of nfgaloisconj(nfinit(f)), because nfinit(f) computes the full factorization of the

[sage-devel] FTP mirrors' HTML is downloaded instead of rendered in Chromium / Chrome

Dear sage-devel, on the downloads page http://www.sagemath.org/download.html there are links to several mirrors, and one of them (FU Berlin) uses the FTP protocol: ftp://ftp.fu-berlin.de/unix/misc/sage/index.html This page can be viewed in Firefox, but not in Chromium or Google Chrome,

Re: [sage-devel] f.reduce(I) output is incorrect for lex order (tail reduction is forgotten)

On Friday, April 17, 2020 at 4:04:10 PM UTC+2, Dima Pasechnik wrote: > I think this is > https://trac.sagemath.org/ticket/27508 > which needs an effort to fix, as it's far from easy. > > Dear Dima, If I'm not mistaken: For the documentation of SageMath's reduce to become correct ("No term in

[sage-devel] f.reduce(I) output is incorrect for lex order (tail reduction is forgotten)

Dear sage-devel, Consider the following example, sent to me by Theo de Jong (Mainz): sage: R. = PolynomialRing(QQ, order='lex') sage: I = R.ideal([x^2 + y^3 - 2*y^2, x*y^2 - 3*x*y + x, y^4 - 3*y^3 + y^2]) sage: f = x^2*y + x*y^2 sage: f.reduce(I) 3*x*y - x - y^4 + 2*y^3

[sage-devel] The PolynomialRing that isn't

Dear sage-devel, I would like to drag up this old issue because it is a source of confusion and frustration for new users. The problem is that PolynomialRing uses (lib)Singular's ring without restricting the possible term orderings. Singular's ring is a polynomial ring _only if_ it is passed a

[sage-devel] Re: keywords in github

As for another way to achieve something similar: there are Projects where you can make a table of issues (and you can add extra columns to the table, such as a Notes column). You can do it privately:

[sage-devel] Re: Poll: deprecate backslash operator

Deprecate the pre-parsing of \ the backslash operator please. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To view

[sage-devel] Re: VOTE: move Sage development to Github

+1 for GitHub On Wednesday, September 21, 2022 at 7:23:36 PM UTC+2 David Roe wrote: > Dear Sage developers, > Following extensive discussion, both recently > > (prompted > by issues upgrading the trac server) and over >

[sage-devel] Re: Issue templates

Another option would be to open a pull request as a draft (with initial changes in any state of completion, which can anyway be overwritten later using a force push). The draft state (which can be chosen when opening a PR, and can be toggled afterward as well) blocks the PR from being merged

[sage-devel] Re: Build test on a PR is giving an error while code is wroking on my machine

On Wednesday, February 28, 2024 at 7:23:45 PM UTC+1 Ruchit Jagodara wrote: I recently made a PR regarding the implementation of the minimum_generating_set function in polynomial time,#37481 . However, in this PR, one of my build tests is failing and