A computer algebra system (CAS) is a program which is able to carry out various symbolic manipulations with mathematical expressions. Some well-known computer-algebra systems: Mathematica, Maple, Wolfram Alpha, GAP. For questions about Mathematica please see the ...

learn more… | top users | synonyms

3
votes
1answer
40 views

Square-free factorization of polynomials over finite fields

For any $f\in\mathbb{F}_q[X]$, I want to derive an algorithm which computes a factorization $$f=\prod_{i=1}^kf_i^i\tag{1}$$ with square-free polynomials $f_i$. My Ideas: If $f'=0$, we're done ...
2
votes
1answer
14 views

Computing intersection of vector spaces spanned by two lists

Assume that I'm given two lists of vectors $l_1$ and $l_2$, where all the vectors have equal dimension. I want to compute a basis for the intersection of their spans. What is the easiest setup for ...
1
vote
1answer
47 views

Number of monic irreducible polynomials over a finite field

Let $\mathbb{K}=\mathbb{F}_q$ and $\nu_n$ denote the number of monic irreducible polynomials over $\mathbb{K}$. It holds $$\nu_n=\frac{1}{n}\sum_{d\mid n}\mu\left(\frac{n}{d}\right)q^d$$ What I need ...
1
vote
1answer
52 views

In SAGE, what function factors a polynomial whose coefficients are parameters?

In SAGE the function "factor" will factorize elementary polynomials with coefficients in $\Bbb Q$. For example: x,y = var('x,y') poly = x^3-y^2*x factor(poly) SAGE: x*(x-y)*(x+y) ...
1
vote
1answer
72 views

Silverman exercise 3.1 proving that two polynomials are relatively prime iff the discriminant is non-zero

Silverman, p. 104: Show that the polynomials $$f=x^4−b_4x^2−2b_6x−b8 \qquad \text{and}\qquad g=4x^3+b_2x^2+2b_4x+b_6$$ appearing in the duplication formula (III.2.3d) are relatively prime if ...
0
votes
1answer
42 views

How to detect carry and overflow?

Let's say that 0011 + 0111 = 1010 How to detect whether the operation generate carry and overflow?
0
votes
1answer
35 views

Marking the roots of a quadratic function in Scilab

I have 2D plotted a simple quadratic function in Scilab and now have to mark the roots with an X. Is there any simple way of doing that? I have written a function that calculates the roots and ...
0
votes
1answer
32 views

Risch differential equation algorithm by Bronstein

I was implementing the algorithm by Manuel Bronstein for solving the Risch differential equation. My question is: What does Bronstein mean by "Order" in the algorithm poly_DE (exponential case, ...
0
votes
1answer
61 views

How to get 2 percentages to a 100%

First of im new to this site and I've never been the sharpest at math, im a web developer by trade. My question is math related but ill just give you a quick background about my website so that you ...
0
votes
1answer
34 views

Printing long lines in MAGMA without line break

In MAGMA, how do I print a long list of items to a file without automatic line breaks? It seems to me that there is an internal length limit and anything longer than it will result in a automatic ...
0
votes
1answer
104 views

Vectorfields on Surfaces with MuPAD

i am working with MuPAD. I can make vectorfields in 3D and also Surfaces in 3D via plot::VectorField3D and plot::Surface. But now i want to draw a vectorfield ON a surface. If $X$ is a vectorfield ...
4
votes
0answers
129 views

How to integrate $\left(1+\ln(x)\right)\sqrt{1+(x\ln(x))^2}$ with Risch algorithm?

How would you integrate $\left(1 + \ln\left(x\right)\right)\, \sqrt{1 + \left(x\ln\left(x\right)\right)^{2}\,}$ using the Risch algorithm? I want to know this because Mathematica is using the Risch ...
4
votes
0answers
161 views

Test for equivalence of algebraic expressions

We are looking for the most efficient (most recent, or best) techniques to check if two algebraic expressions (elementary, Calculus-type functions) are equivalent (or if an expression is equivalent to ...
3
votes
0answers
50 views

Adjoint action of a Lie algebra in MAGMA

Let's say I have a Lie algebra $L$ and an element $x$ in $L$. I need to compute $(\mathrm{ad} \ x)^n(y)$ for several values of $y$ and a particular value of $n$. I thought the best way to do this ...
3
votes
0answers
64 views

Computing the decomposition of a representation of $S_n$

I have an explicitly defined representation of the symmetric group that I would like to decompose into irreducibles. How to do this most easily? The best approach I have so far is as follows: Find a ...
2
votes
0answers
60 views

How to solve this complicated differential equation?

I need to know how to solve this complicated differential equation in $z$ either analytically or numerically : \begin{eqnarray} \frac{dx_1}{dz} &=& -ib_1x_1 - ikx_2 \\ \frac{dx_2}{dz} ...
2
votes
0answers
53 views

Are there high performance computing applications for symbolic integration?

Currently there are a number of applications for numerical integration in applied mathematics and physics. Many of these are integral transforms (often Fourier or Laplace), or solving definite ...
2
votes
0answers
36 views

Muirhead's Inequality (software?)

I just started learning about inequalities: Schur's, Karamata's, Muirhead's, etc... They are beautiful but it seems that in the case of more than two variables, some of the computations become a ...
2
votes
0answers
65 views

Todd-Coxeter algorithm: coincidences

I'm trying to understand the Todd-Coxeter algorithm with the help of a multiplication and relator table, but there is one thing about coincidences that is not really clear. For some small groups (for ...
2
votes
0answers
94 views

How does one solve equations over finite fields in SAGE?

Sage has the method solve (or function, I'm not sure what's the correct terminology) that finds solutions to 'symbolic expressions'. In particular, if one wants to find solutions for a given set of ...
2
votes
0answers
45 views

Is there a known algorithm for approximating all the real and imaginary zeros of any well behaved equation of a single variable?

Does there currently exist a general algorithm (or set of algorithms used together) that will approximate all the zeros of any well behaved non-differential equation of a single variable which has a ...
2
votes
0answers
58 views

Minimal set of algebraically independent numbers

Suppose we have a set of polynomials $f_1, f_2, \ldots, f_n \in \mathbb{Q}[x]$. Consider the set $$S := \{\alpha \in \mathbb{C} \; | \; f_i(\alpha) = 0 \text{ for some } i \}$$ of complex roots of ...
2
votes
0answers
66 views

Free software for expresing a resolvent as function of coefficients

This relates to question "Expressing a symmetric polynomial in terms of elementary symmetric polynomials using computer?" I would like to try absolute resolvent for group $C_5$ in $S_5$. For example ...
2
votes
0answers
144 views

How do mathematicians handle functions of functions that may change?

E.g. let $f(x) = $ some function. Now define $h(x) = f(g(x))$. Now suppose the definition of $g(x)$ changes around in a discussion. Do we still refer to $h(x)$ as the original $h(x)$ or only when ...
2
votes
0answers
155 views

What is a good software package for ( assisted ) theorem proving and documenting?

Background: An issue in my math study is that I haven't found a good way of storing the theorems ( mostly abstract algebra ) I studied and want to (re-)use in proofs. At the moment I use a personal ...
1
vote
0answers
25 views

Recent benchmarks of CAS programs? (HNF, Groebner)

I've been trying to find recent benchmarks of CAS systems for computing the Hermite Normal Form as well as Groebner basis over both $\mathbb{Q}$ and $\mathbb{C}$. I've been unable to find anything ...
1
vote
0answers
29 views

Revealing output slowly in Magma

When working in Magma, is there a command to gradually reveal the output. For example, if you have a finite group $G$ and you want to calculate SubgroupLattice(G), then the output may be thousands of ...
1
vote
0answers
366 views

Solving large, sparse system of linear equations

I have a system of linear equations as follows: $$(A+I)x=B$$ where $I$ is the $n\times n$ identity matrix, $A$ is a $n\times n$ matrix such that the first and last rows are blank, and, for every ...
1
vote
0answers
13 views

Tools for optimizing asymptotic bounds.

Is there any tool for this task ? Given the asymptotic bound in term of $n$ and other paramaters $t_1,\dots,t_r$, then return the value for each $t_i$ which optimizes the expression in term of $n$, ...
1
vote
0answers
85 views

How to solve an equation in three variables fixing two of the variables?

Also, I have the following equation, I want to solve it for $b$ keeping $a$ and $c$ fixed. $5b^5+(60-5a)b^4+(125+50c-80a)b^3+(594c-445a-775)b^2+(2324c-1005a-3270)b+3000c-750a-3000=0.$ Also how to ...
1
vote
0answers
89 views

Flatten kronecker product in CAS?

I am a new user of Maxima, and I need to trace the elements of a big messy kronecker product of symbolic matrices. I tried the following to get my feet wet, but I don't get a simple, flat matrix -- ...
1
vote
0answers
71 views

Looking for a binomial system solver

I am interested in solving binomial systems of the form $$ \begin{cases} a_1 x_1^{d_{11}} x_2^{d_{12}} \cdots x_n^{d_{1n}} + b_1 x_1^{d_{11}} x_2^{d_{12}} \cdots x_n^{d_{1n}} &= 0 \\ ...
1
vote
0answers
41 views

CAS for counting points of varieties over finite fields

I am looking for a computer algebra system, which is able to some of the following (in theory equivalent) things for a smooth projective variety defined over a finite field: -Count the number of ...
1
vote
0answers
733 views

Simple example application of Karush-Kuhn-Tucker conditions to minimization problem

I am wondering if there is a simple example application of the Karush-Kuhn-Tucker conditions to show that a minimum exists for a multivariate minimization/optimization problem. Could anyone suggest a ...
1
vote
0answers
60 views

Computing relations on the columns of a matrix

Given an $m\times n$ (with $n>m)$ matrix $M$ over a polynomial ring $R=k[x_1,...,x_n]$, suppose that every column of $M$ is an $R$-linear combination of $m$ specified columns. I would like to ...
0
votes
0answers
9 views

Gram-Schmidt-procedure with PARI/GP

Can the Gram-Schmidt-procedure to find an orthogonal basis of a vector space spanned by given linear independent vectors be easily done in PARI /GP or do I have to program the procedure ?
0
votes
0answers
48 views

Can a Computer Algebra System 'experiment' with expressions?

I have recently been reading about software for symbolic manipulation, and I can see its use as a tool for performing large calculations that would be unfeasible otherwise. Given that these systems ...
0
votes
0answers
38 views

How to reduce a graph via decomposition?

Is there a Java / C# library that can be used to reduce a graph via decomposition? Or could someone point me to a good tutorial where I can learn all these? E.g.
0
votes
0answers
15 views

Changing the “Type” of an object in Magma

The computer algebra system Magma can store groups as one of many different types. For example, using AbelianGroup([2,2]) we obtain the Klein $4$-group stored as type GrpAb. However, we can also ...
0
votes
0answers
20 views

Why $face_w(New(f))=New(in_w(f))$?

Is there anyone who can help me with this problem? Any hint to the solution would be appreciated! Let $f\in \Bbb K[x_1,\ldots,x_n], w\in \Bbb R^n$ and $New(f)$ be the Newton polytope of $f$. Why ...
0
votes
0answers
57 views

Why are these CAS calculated integrals equal

I let Wolfram evaluate this integral: $$\int\frac{-2\sin(x)\cos(x)}{2\cos^2(x)+\cos(x)-1}dx$$ 1st result from WolframAlpha online was $$\frac43 \log(\cos(\frac{x}2))+\frac{1}{3\log(1-2 \cos(x))}+C$$ ...
0
votes
0answers
38 views

Graded piece of ring in Macaulay2

I apologize for the basic question, but I couldn't figure how to do this. I'm looking at the homogenous ring $R = QQ[w,x,y,z]$, I take $I = ideal(w*z-x*y)$ and $S=R/I$. Then I construct some ideal $J$ ...
0
votes
0answers
28 views

Coercing a vector into a module in MAGMA.

Given a $1\times n$ row vector $v$ over a ring $R$, and an $n$-dimensional $R$-module $M$, is there any way to coerce the vector $v$ into $M$ (the obvious $M!v$ does not work).
0
votes
0answers
33 views

Can Maple solve recurrence relations when n is only certain numbers?

If you have an equation $a(n)=a_{n-1}+2a_{n-2}$ only defined when n is powers of 2, how would convey that to Maple that n has a restriction? What if you wanted only $n \ge 2$?
0
votes
0answers
65 views

R code for triple integration

I am trying to write R code for triple integration. Here, I am just using a simple function as an example: f(x,y,z) = x^2*y+z. Here's what I have : fvec = function(x,y,z) sapply(x, function(t,y,z) ...
0
votes
0answers
42 views

Evaluating polynomials at elements of algebras in Magma

I've defined a $2$ dimensional algebra, $A$ in Magma as follows: R:=FieldOfFractions(PolynomialRing(GF(2),10)); A:=Algebra< R,2|[1,0,0,1,0,1,1,1]>; The sequence of $1$'s and $0$'s just ...
0
votes
0answers
40 views

Picking out Vector Coefficients in Magma

Suppose $K/k$ is a finite field extension, with fixed basis $e_1,\ldots,e_d$, and $f\in K[x_1,\ldots,x_n]$. Using our basis, $f$ has a unique expression as a sum of polynomials in ...