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

1
vote
1answer
22 views

Prevent Maple to evaluate before simplify a function

I have been trying to find a domain of $f(x)=\frac{x}{\frac{(x+2)}{(x-3)}}$ using different kind of software ( its clear the domain of this function is $\mathbb{R}\backslash \{-2,3\}$ ). When I tried ...
1
vote
1answer
17 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) ...
0
votes
1answer
57 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
87 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
97 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
143 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 ...
2
votes
0answers
22 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
45 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
41 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
54 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
64 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

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
13 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 ...
1
vote
0answers
31 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 ...
1
vote
0answers
188 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
70 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
86 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
63 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
37 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
669 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
133 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 ...
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
42 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 ...
0
votes
0answers
56 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
22 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
31 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
0answers
25 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
0answers
25 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
32 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
24 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 ...
0
votes
0answers
52 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
32 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
25 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 ...
0
votes
0answers
28 views

How to use computer software for q-series calculations?

I have been reading about the dissections of cranks and there are lot of calculations with q-series identities which are very tedious by hand. What kind of computer algebra packages can we use in ...
0
votes
0answers
47 views

Computing a linear combination in $\mathbb{Z}_p[r,s,t,u,v]$

Let $F, f_1, \ldots f_5$ be polynomials in $\mathbb{Z}_p[r,s,t,u,v]$, the ring of polynomials in 5 variables over the integers modulo an odd prime $p$. By forming the ideal $J:=< f_1, \ldots ...
0
votes
0answers
173 views

A (contour?) integration (even if by using Mathematica!)

I need to be able to calculate integrals of this type where the sum over $R$ is the sum over representations of a Lie group $G$ on whom $dU$ is the Haar measure and $\chi _ R ()$ is the character of ...