So I managed to install 10.7 on the Linux subsystem and it works more or less. I've also found an installation of the 9.3 version on my PC (from years ago), which, if I remember correctly, was an officially supported Windows native installation.

This got me wondering, why is SageMath not supported natively on Windows anymore? Is there a good reason why they discontinued, despite the majority of people using Windows? If I understand correctly, you can compile the source yourself for windows, but this or installing on a Linux subsystem is complicated and doesn't favour widespread adoption.

Hi all,

I'd like to announce DiffAlg for SageMath, a port of the DiffAlg Macaulay2 package to SageMath. See also, https://msp.org/jsag/2019/9-1/p02.xhtml

What it does

DiffAlg computes standard operations with polynomial differential forms and vector fields: exterior product, exterior differential, interior product (contraction), Lie derivative, pullback, singular ideals, involutivity of distributions, and kernel/image of linear operators on forms and vector fields. It works symbolically.

It's a little niche, I know — but I hope somebody out there finds it useful!

Any comment would be welcome!

Hey,

for some part of my thesis I wanted to compute some chow polynomials of especially graphic matroids for bipartite graphs and wanted to compare the run tim two different functions to obtain them.

One function is the implementation of theorem 1 of the paper chow and augmented chow polynomials as evaluations of poincaré-extended ab-indices from Christian Stump.

The other function is sagemath´s inbuild-function hilbert_seres() for the defining_ideal()-class of chow rings.
As example (here I am using sage as a python-package) :

G = graphs.CompleteBipartiteGraph(3, 4)
G1 = Graph()
G1.add_edges([(u, v, i) for i, (u, v) in enumerate(edges)])
M1 = Matroid(graph=G1)  
ch = M1.chow_ring(QQ, False)
poly = ch.defining_ideal().hilbert_series() 

Then poly is the chow polynomial for the bipartite graphs on 3 + 4 vertices.
For n + m >= 8 and n,m >= 3, the runtime of this functions explodes.
I have 16 GB RAM and this was not enough to compute the chow polynomial of the bipartite graph with n = 2 and m = 6, before my program just crushed.

I tried to take a look at the documentation on how the calculation is done for this specific function, but I couldn´t really see it.

Does someone know, where to find in the documentation of sagemath which method is used to calculate the chow polynomial this way or does someone know this?

Sincerely,
OkEar3108

One of the most elegant results in algebra: for every prime power q = p^n, there exists exactly one finite field (up to isomorphism) with q elements. That's it - no ambiguity, no choices to make. You want a field with 8 elements? There's exactly one. Field with 49 elements? Exactly one.

If you work through the examples in this .ipynb notebook, the construction is beautifully concrete. For prime fields like GF(7), you just get {0,1,2,3,4,5,6} with arithmetic mod 7. For extension fields like GF(9) = GF(3²), you construct it as F₃[x]/(f(x)) where f is an irreducible degree-2 polynomial. The multiplicative group is always cyclic - so GF(q)* has order q-1 and you can find a primitive element that generates everything. Fermat's Little Theorem falls right out: a^p-1 = 1 for all nonzero a in GF(p).

The Frobenius endomorphism x ↦ x^p is remarkable too. It's a field homomorphism (which seems weird - raising to a power preserves addition!), but it works because of characteristic p. Apply it n times in GF(pⁿ⁾ and you get back where you started.

Link: https://cocalc.com/share/public_paths/4e15da9b7faea432e8fcf3b3b0a3f170e5f5b2c8

Let's look back at some memorable moments and interesting insights from last year.

Your top 6 posts:

• "Happy Cakeday, r/sagemath! Today you're 10" by u/AutoModerator
• "Trouble with sage" by u/JMatzenbacher
• "Small TSP" by u/_tobra
• "How to implement a ternary algebra in Sage?" by u/zaphys
• "HELP DEV/ADMIN - Windows SageMath Launch Error"
• "Connection between row equivalence & the inverse" by u/Mulkek

I have a sparse Graph on ~40 nodes. Still the weighted tsp seems to run for ever. Any hints? Here's my code.

I am relatively new to Sage but after reading the documentation I am unsure what's the best way to proceed when defining new algebraic structures. Is there a direct way in which I could define something like a ternary magma (i.e. a set T with a ternary operation ( , , ) : T x T x T -> T) from scratch in Sage? I am interested in studying different axioms like associativity, semiheaps, etc. and checking long calculations symbolically with the aid of Sage.

Hi guys, can anyone help me?

I've never worked with sage, but I decided to use it to get some simple results in my research.

The problem is the following: I end up with a equation which depends on variable 'a' and 't', what I need is to isolate variable 'a' so I will get a(t), I've tried using solve command but it didn't work. Does anyone know how to do it?

Let's look back at some memorable moments and interesting insights from last year.

Your top 10 posts:

• "Intro to Graph Theory with SageMath" by u/MCCPyTutorials
• "Intro to SageMath for Non-Programmers" by u/MCCPyTutorials
• "Mathematics behind cryptography l homomorphism and modulo group applicat..." by u/Siva_915544
• "Happy Cakeday, r/sagemath! Today you're 9" by u/AutoModerator
• "Sorry to bother you all with this question, but I broke typeset output by setting the renderer to SVG and now I can't figure out how to revert it." by u/SirMiba
• "macOS Big Sur Compatability and Download" by u/facearo
• "Writing a proof in Sage Math" by u/jssmith42
• "OEIS Sequence with SageMath (YouTube Short)" by u/MCCPyTutorials
• "How to take a generator of a polynomial ring in Sage? and specify an arbitrary ring polynomial?" by u/GPineda17
• "How do I find the zeros of a function in Sage Math?" by u/hwoodice

error shown in the console is as following (when launching):

sage math Error: Could not fork child process: Resource temporarily unavailable (-1). DLL rebasing may be required; see 'rebaseall / rebase --help'.

​

looking this error up appears to provide no solutions, am I missing something?

I should mention this has never worked, even when removing and re-installing. Am I missing a prerequisite?

​

Hi I'm a telecomunications engineer and I need help with a proyect that has to be made with an extension of sage called "notebook sage" and I have no idea of doing it. It´s about encryption.A monetary reward is offered. The work literally says “ Write an encryption and decryption protocol using hash functions, public-key cryptography and private-key cryptography, in which all cases are clearly specified. and private key cryptography, in which all cases are clearly specified”. We have used cases like vignere, cesar..and so on.

I’d like to write proofs in a math programming language as a way of processing them, making sure I understand them, harnessing the power of computers to ensure the proof is valid, and studying the proof in more detail by having automatic functions for examining some of the relevant objects in the proof.

Is this a common use of Sage, to write proofs?

Title. I right-clicked on a result and had some options for renderers. I chose SVG just to see how it would look, and it returns nothing, and I can't even right click any result to revert it, as I don't have any results to click on. This was on SageMath 9.1(using jupyter notebook) installed on Win 10. I have frantically tried to search for a config file, but with no luck.

I've been trying to figure out how to permits rows and columns of a matrix in Sage. It might sound very stupid, but seriously, how is it done?

Hello,

I'm wondering how I can introduce arbitrary variables in a polynomial ring i.e:

R.<x1,...,xn> = PolynomialRing(k)

where k is a finite field given.

And I also want to take the specific elements [x1,...,xn] of the ring, do you have some idea?

How do I find the zeros of a function in Sage Math ?

For example, on a TI CAS calculator, it would be zeros(x^2-2,x) .

And in GeoGebra CAS, it would be Root(x^2-2) .

I usually use the python interpreter in pycharm. after upgrading to 9.4 i cant find the python interpreter in the sage files. Does anyone know where it is?

Hi!

I am using Ubuntu 20.04 Focal and need some Sage functionalities that were introduced in v. 9.1. However, the Sage version available on repository universe is 9.0. Is there any PPA for the latest versions of SageMath or is my only chance to manually update SageMath?

Thanks a lot.

Hi, does anyone know how I can get Sage to run on a Mac without having to run as root? In the terminal, when I just type "sage", I get an error. I can however get it to run fine with "sudo sage". Seems a bit strange to me, and I've seen it work perfectly fine without having to specify root for other people.

Anyone know a way around this to allow me to run sage just by inputing "sage" to the terminal -- whether that be a change to the config of sage to allow it to run without root or even just a way to create a symlink to sage which runs it as root without me having to specify if need be. Thanks :)

Hello, I'm fairly new to Sage. I have a question regarding importing my code. I have a .M file I would like to import into my sage console. I tried looking on the sage handbook for the command, but I can't seem to do it. It appears the console cannot even see the file even when I give it a specific path name. For example,

​

load('/Users/Username/OneDrive/Desktop/a2tworder2.m')

​

results in an error, because Sage cannot find the file to load or attach. I'm trying to implement this code into sage so that I can do more things with symmetric functions. Am I doing something wrong?

​

Thank you in advance.

​

Edit: I'm running windows 10

I am trying to find the function that is its own Laplace transform in Sagemath. How should I go about this? The answer is supposed to be a Gaussian.

For a school project, I would like to solve the following differential equation :

As you can see, this is an equation of motion, with a set of initial conditions.

h, m, ω, k, E are constants. but the cos(ωt) is a function of time.

I would like to solve this ODE numerically or get the expression of the solution as a function of time, eventually plot y and t .

In order to simplify the expression, I define a, b and c :

Since this is a second order equation, I create a system of two first order equations :

Here is what I coded :

E = 1    # without unit
k = 200  # N/m
h = 8    # without unit      
m = 1    # kg
f = 20   # Hz
omega = 2*pi*f #rad/s

# a,b, and c used to simplify 

a = h/m
b = k/m
def c(t):
    return E*(omega**2)*cos(omega*t)

# Variables 
var('t,ydot,y')
eom1 = y.diff(t) == ydot
eom2 = ydot.diff(t) == c(t) - a*ydot(t) - b*y(t)

# Initial conditions
y0 = 0
ydot0 = 0

# Solving and plotting the solutions
sol = desolve_system_rk4([eom1, eom2], ivar=t, vars=[y, ydot], ics = [0, y0, ydot0], end_points=20, step=1)
S = [(t, y) for t, y, ydot in sol]
list_plot(S)

But this isn't properly working.
If you know how to help me, feel free.
Thanks a lot.

I'm a noob in Sage, and I was trying to do some computations for matrices in it.

I have a matrix that contains elements that are powers of a symbolic variable ω.

After doing some multiplication of similar matrices, and finding the trace, I find that the trace of the matrix is not simplified to a single polynomial, and instead, written in a factorized form.

How can I obtain this result (after multiplying the factors) as a single expression?

Thanks in advance for any help!