[sage-devel] Re: On changing Bernoulli(1) to +½

tl;dr, 80 lines, sorry. I think there is a better alternative than changing the current implementation of the Bernoulli numbers. Fredrik: "The sign convention for B_1 is fairly arbitrary, ..." Calling the question a 'convention' sets a wrong framing from the start. Conventions are treated diff

Re: [sage-devel] Native Windows version

> If I had to run Sage on Windows for some reason today, > I would use Docker or VirtualBox. I’ve been using Sage for many years mainly on Windows. First with the Virtual box. This had many disadvantages. On the one hand the VirtualBox was error-prone and often did not work as expected. It als

[sage-devel] Dead sequences

Hi! Occasionally a sequence in the OEIS is marked with the keyword 'dead'. For various reasons. But it's meaning is clear: * "Here is nothing of interest. Move on."* In Python this is expressed by 'None' or in Julia by the constant 'nothing'. Normally, if there is nothing of interest you don'

[sage-devel] Re: What the hell is JSAGE ?

> > (2) Anything new about the SageMath Foundation ? > https://wiki.sagemath.org/Foundation > * Make it easy to donate, for example add a button like this one: https://www.paypal.com/donate/?token=H34MRIr2S0JuWnaiSIFd5W06M0hPGFXpKUaA_kKSX8J2YSSX369t4nu89WNfyGrSvnsdmG&country.x=US&local

Re: [sage-devel] Re: Suggestion for the SageMath website

Sébastien Labbé: > > > My opinion is that the vast majority of people will not click on that > link. On the contrary, with the list of few random packages, the vast > majority will see some packages at each visit and each package will be > shown a nonzero ratio of the number of visits. > I don'

Re: [sage-devel] Re: Suggestion for the SageMath website

> Instead, a phrase like "consists of many packages", where > "many packages" is a hyperlink to the component page. That > component page is the alphabetically sorted list of all > what's in sagemath Why not integrate this list into the page? That binds things closer together. Like it is done he

[sage-devel] Re: Improving code with AI?

rjf> The chance that Machine Learning AI programs will find rjf> important algorithmic efficiency fixes in algebraic rjf> mathematical implementations seems pretty slim. Improving code is something other than improving algorithmic efficiency of high-level algorithms, of whatever kind. The latt

Re: [sage-devel] Re: Improving code with AI?

> > The most complicated thing is to make a special-purpose github account to > run this on (because no-one > in their right mind is going to give some shady startup access to their > actual github account, right? > I do not think you need to do this. You can limit access to certain reposito

Re: [sage-devel] Re: Improving code with AI?

> I'm old enough to have lived through the first AI winter > , and to become *extremely* > wary of anything hyped to the level currently used about anything > "AI"-labeled. > With all due respect to your experiences, the AI in the 80s couldn't play chess mu

Re: [sage-devel] Improving code with AI?

> > I have my doubts ... > Not me, in the following sense, independent of the software mentioned: Why would an AI-Lint (to call it that) not be able to deliver useful results? And have the potential to far surpass that of the ordinary Lint? Projects like the Stochastic Program Optimization eve

[sage-devel] Improving code with AI?

Hi, does such a thing make sense for use in the SageMath development? The website says: Free Forever for GitHub open source. https://techcrunch.com/2018/04/26/deepcode-cleans-your-code-with-the-power-of-ai/ P. -- You received this message because you are subscribed to the Google Groups "sag

[sage-devel] Re: Running Sage from an IDE like PyCharm on Windows.

> > I do not like notebooks such as this one and Mathematica because they do > not go well with a VCS. > With Eclipse you have a powerful IDE for Mathematica. Called Wolfram Workbench. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsub

[sage-devel] Re: Calculation Error

For twenty years in the FAQ of sci.math: http://www.faqs.org/faqs/sci-math-faq/0to0/ -- 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...@goog

Re: [sage-devel] Re: Sage Windows Installer (take 2b)

Am Mittwoch, 14. Dezember 2016 20:19:04 UTC+1 schrieb Erik Bray: >>> Please give this new build a try: > >>> > https://github.com/embray/sage-windows/releases/download/0.1a3-7.4/SageMath-7.4.exe > > Will there be a Windows installer for SageMath-8.0? Peter -- You received this message bec

Re: [sage-devel] Re: is handling of Inf/Infinity/infinity affected by the 1st call to symbolics?

> > This is now > https://trac.sagemath.org/ticket/22201 > Thanks! P.S. Do you know that there are functions which work correctly but advertise to use instead functions which are buggy? Hint: 22069 -- You received this message because you are subscribed to the Google Groups "sage-devel" group.

Re: [sage-devel] Re: is handling of Inf/Infinity/infinity affected by the 1st call to symbolics?

R> Actually the example makes it necessary to completely abandon R> the original GiNaC series code and use Maxima as fallback in the R> cases that cannot be handled by the fast rational Pynac series code. Unfortunately this will not help much. Maxima/taylor is also unable to compute these function

[sage-devel] Re: is handling of Inf/Infinity/infinity affected by the 1st call to symbolics?

Hi Ralf! R> there is no need for taylor() (Maxima) R> if you use series() (Pynac) which is way faster. I cannot reproduce your claim, in the contrary. Please consider this simple example: def num(m, n, ser): z = var('z') w = exp(2 * pi * I / m) o = sum(exp(z * w^k) for k in range(m))

Re: [sage-devel] Re: Sage Windows Installer (take 2b)

> I replaced the existing binary with a new one at BRAVO! All works fine. (only plot() gives no output) Peter -- 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 sag

Re: [sage-devel] Re: Sage Windows Installer (take 2b)

> > Could you tell me what kind of CPU you have? And remind me, was this > running in a VM (it shouldn't matter but I'm curious)? > No, no, it ran on bare iron. Peter -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this

Re: [sage-devel] Re: Sage for Windows installer (take 2)

> > What path did you install into? The default (under Program Files)? > > The program is installed in C:\Program Files\SageMath It was a one-click installation in which I did not intervene manually. Peter -- You received this message because you are subscribed to the Google Groups "sage-deve

[sage-devel] Re: Recurrences and Sequence Formula Guessing Functions in Sage

> One of the (sets of) functions haven't yet found a suitable open source alternative > for is related to guessing formulas and generating functions for an input sequence > (as in Mathematica's FindSequenceFunction and FindGeneratingFunction). I am amazed that no one has yet mentioned Gfun, the

[sage-devel] Re: Coming SageMathCell upgrade - please test!

--- ImportError Traceback (most recent call last) in () > 1 load('http://') 2 load('http://') 3 /home/sc_serv/sage/src/sage/structure/sage_object.pyx in sage.structure.s

Re: [sage-devel] Request to extend the binomial function by the reflection formula

> Sage seems to use the definition from Concrete Mathematics by Graham, > Knuth and Patashnik: > That gives e.g. > sage: binomial(-4, 5) > -56 Right. GKP call it "upper negation". If you look at my demo-function you will see that this condition is preserved in the suggested extension (case 3).

[sage-devel] Request to extend the binomial function by the reflection formula

1-647 [WP] Pascal's triangle https://en.wikipedia.org/wiki/Pascal's_triangle#Extensions [MJK] M. J. Kronenburg; The Binomial Coefficient for Negative Arguments; arXiv:1105.3689v2 [RS] Renzo Sprugnoli; Negation of binomial coefficients; Discrete Mathematics 308 (2008) 5070–5077 [PL] Peter

[sage-devel] Re: Definition of multifactorial #5415

Nils Bruin> "It may well be (and that is what the ticket indicates too) that sage's documentation does not agree with common mathematical convention." The standard common mathematical use of various types of multifactorials is well documented in the OEIS. But what also is well documented in th

Re: [sage-devel] Porting SageMath to Windows 64

7. Oktober 2015 20:05:11 UTC+2, bluescarni: > > Practically, it's an architecture that supports "natively" 64 bit ints but > the pointers are 32 bits wide. AFAIK, this is supposed to improve > performance for pointer-heavy workloads that do not need to allocate much > RAM but still benefit from

[sage-devel] Re: proposed amendment to code of conduct

Am Freitag, 28. November 2014 13:39:51 UTC+1 schrieb Volker Braun: > > On Thursday, November 27, 2014 3:27:23 AM UTC, Nathann Cohen wrote: > > I think that it is a good clause, and I hope that the document to which it >> could eventually belong will be a "Guidelines" one and not a code. > > > I

[sage-devel] Re: Request to extend binomial(n,k) to negative integers

> > do you know how to open a trac ticket? As you say, this extension can > easily be done and thus does probably not require a poll on sage-devel. > It is now http://trac.sagemath.org/ticket/17123#ticket -- You received this message because you are subscribed to the Google Groups "sage-de

[sage-devel] Re: Request to extend binomial(n,k) to negative integers

> > do you know how to open a trac ticket? As you say, this extension can > easily be done and thus does probably not require a poll on sage-devel. > No, but I will try to learn it. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscr

[sage-devel] Request to extend binomial(n,k) to negative integers

A simple and coherent extension of the binomial function to negative integers n, k was outlined by M. J. Kronenburg in The Binomial Coefficient for Negative Arguments, http://arxiv.org/abs/1105.3689 This extension amounts to define def BINOMIAL(n, k): if n >= 0 and k >= 0: return b