**2**

votes

**1**answer

301 views

### Computer algebra system (CAS) with good re-presenting or transformation support

Such heavy-weight transformations as expanding or factoring are provided by most of CAS-es, but what about light-weight, but a useful transformations, like "reorder some terms to make expression more ...

**10**

votes

**3**answers

486 views

### Algorithms in Invariant Theory

Let $V$ be a polynomial representation of the general linear group $\Gamma:=\DeclareMathOperator{\Gl}{Gl}\Gl_n(\newcommand{\C}{\mathbb C}\C)$.
In chapter 4.6 of his book "Algorithms in Invariant ...

**1**

vote

**0**answers

139 views

### Randomized alternative to Buchberger's algorithm

Richard Lipton's blog describes a A New Way To Solve Linear Equations by Prasad Raghavendra.
Can the ideas in this algorithm be generalized to systems of polynomial equations to provide a randomized ...

**7**

votes

**2**answers

349 views

### Computing determinants of matrices of linear forms

Suppose we have three $n \times n$ matrices $A$, $B$, $C$ with floating point entries. We would like to compute the polynomial $\det (xA+yB+zC)$. At least in Mathematica, and I think in all computer ...

**12**

votes

**1**answer

448 views

### How can I tell if a variety is normal?

Suppose $R$ is a subalgebra of ${\mathbb C}[x_1,...,x_N]$ generated by polynomials $p_1,...,p_k.$ I know that ${\mathbb C}[x_1,...,x_N]$ is the integral closure of $R$.
Is there an algorithm to ...

**5**

votes

**4**answers

975 views

### computer algebra system for polynomial algebras over finite fields

Is there a computer algebra system that can do arithmetic over polynomial algebras over finite fields where I can specify the extension?
Exempli gratia, if $f(x), g(x) \in ...

**4**

votes

**0**answers

288 views

### On finding A-polynomials

I have two questions to obtain the explicit forms of A-polynomials.
Takata used the mathematica pacage qMultisum.m to obtain the recursion relation of the colored Jones polynomials for twist knots. ...

**1**

vote

**2**answers

118 views

### Non-Uniform Root of Polynomial in Open Cube

I'm looking to find a root $(x_1,\dots,x_n)$ of a polynomial $p \in {\mathbb R}[x_1,\dots,x_n]$ such that $0 \leq x_i < 1$ for all $i$. Further, I know in advance that setting $x_1 = \cdots = x_n$ ...

**5**

votes

**1**answer

352 views

### Reasonable implementation of finding Gröbner bases over non-field coefficient rings

Gröbner bases are usually considered in the ring of polynomials over a field. However, there are useful definitions and algorithms for Gröbner bases over other coefficient rings; see, for instance, ...

**0**

votes

**0**answers

103 views

### What is the largest computed summatory liouville interval ?

I am interested to know the largest computed summatory liouville interval, an implementation of which is detailed in Section 4.1 of [1].
The wikipedia page [2] for the function charts summatory ...

**1**

vote

**3**answers

349 views

### Finding maximum value of degree-3 homogeneous polynomials when variables sum to 1

I would like to be able to find maximum values of degree-3 homogeneous polynomials, when the variables are non-negative real numbers that sum to 1. For example,
For example, the maximum value of ...

**7**

votes

**0**answers

234 views

### Computer Algebra solution for simplicial resolutions for André-Quillen cohomology

Hello,
I would like to experiment with André-Quillen (co)homology. Especially for singular rings.
A key problem is that the construction of a simplicial resolution of a ring seems to require a rather ...

**19**

votes

**7**answers

1k views

### Computer package for representation theory of the symmetric group

Is there a computer algebra package in which I can compute the following for representations of a specific symmetric group (e.g. $S_7$):
(1) $V \otimes W$
(2) $S_\lambda V$, where $S_\lambda$ is a ...

**1**

vote

**3**answers

398 views

### the Richardson theorem and the base identities problem

In the fields related to school mathematics there is some acitivity on proving (or disproving) deducibility/decidability for some classes of school identities. In particular,
1) In logic they ...

**8**

votes

**4**answers

1k views

### Program for computing group cohomology

Is there any computer program with which I can compute the group cohomology H^n(G,V) for a group G acting linearly on a vector space?
I mainly care about infinite groups.

**1**

vote

**3**answers

338 views

### Checking for invertibility of large matrices in MAGMA

If you have a number of large matrices, and you wish to determine whether each matrix has determinant zero or not, what is the most efficient way to do this in MAGMA
(it appears that calculating the ...

**18**

votes

**3**answers

593 views

### Is there a way of canonically labelling permutation groups?

When working with large numbers of graphs, a canonical labelling routine is essential as, after the initial cost of canonically labelling each graph, it permits isomorphism checks to be replaced with ...

**5**

votes

**0**answers

229 views

### What became of PoSSo and FRISCO

I know PoSSo and FRISCO were pretty big projects involving many European universities.
Interestingly, I couldn't find much information about these projects
(the the top of the PoSSo homepage says ...

**8**

votes

**2**answers

283 views

### Monomial orderings in noncommutative setting

An ordering of monomials in the free associative algebra $k\langle x_1,\ldots,x_n\rangle$ is called a monomial ordering (EDIT: it seems that an equally common term used in this context is "term ...

**4**

votes

**1**answer

358 views

### Basis of a Finite Dimensional Algebra with a Finitely Generated Relation Set By Computer

Let $A$ be a noncommutative finitely generated algebra with a finitely generated set of relations. Moreover, assume that $A$ is finite dimensional as a vector space.
What I want to know is, can ...

**0**

votes

**0**answers

183 views

### Magma Coercion Syntax

Any Magma experts who know what I should write below in place of "Roots(ysoln)"? I basically want the roots of a FldFunRatMElt (variable here happens to show as "$.2"). I would guess there's some ...

**2**

votes

**2**answers

1k views

### Solving a system of equations/inequalities that have trigonometric functions on the left-hand side

Is there any known (symbolic) method that solves a system of equations/inequalities that have trigonometric functions on the left-hand side of the system?
Ex) Find $x,y,\theta \in \mathbb{R}$ that ...

**4**

votes

**2**answers

1k views

### Computing the fixed field of an automorphism of a function field

Let say we have a function field $k(x,y)$ defined by $f(x,y)$ over $k$, with $\sigma \in Aut(k(x,y)/k)$ and. Suppose, I'm not that out of luck, so that either of $\prod \sigma^i(x)$ or $\sum ...

**1**

vote

**1**answer

308 views

### Homomorphisms and their restrictions in MAGMA

I am trying to look at a representation (so a homomorphism) of a group G, and see what the restriction of the representation to a subgroup of G will be. Is there an easy way (or any way!) to do this ...

**4**

votes

**1**answer

411 views

### Finding Presentations of Groups with GAP

Group $A_5$ has presentation $〈 a, b | a^2 = b^3 = (ab)^5 = 1 〉$. Items equal to 1 are relators, so a presentation of $A_5$ as a set of relators could be
$(a^2, b^3, (ab)^5)$
$Q_{16}$ is ...

**5**

votes

**2**answers

1k views

### How to do integrals involving two Bessel functions and another function?

I often encounter the integrals in the following form:
$\int_0^\infty{\rm Bessel}(ax)\cdot{\rm Bessel}(bx)\cdot f(cx)dx$,
where Bessel can be $J$, $N$, $H^{(1)}$, $H^{(2)}$, $I$, or $K$; and $f(x)$ ...

**6**

votes

**3**answers

1k views

### Using MAGMA for Group Theory

I've just started a PhD in Group Theory and need to use the computer programme MAGMA. I wonder if anyone could help me with a couple of (probably very basic things).
I need to produce a Hasse ...

**16**

votes

**5**answers

3k views

### Fastest Algorithm to Compute the Sum of Primes?

Can anyone help me with references to the current fastest algorithms for counting the exact sum of primes less than some number n? I'm specifically curious about the best case running times, of ...

**1**

vote

**1**answer

223 views

### Reference for complexity of primitive polynomials

What is the fastest known way to check if a given polynomial of degree $n$ in $F_{2}[X]$ is primitive?
In response to Greg Kuperberg's answer. If we known factorization of $2^{n} - 1$, then what is ...

**9**

votes

**4**answers

930 views

### Is Gauss-Seidel guaranteed to converge on *semi* positive definite matrices?

I know that the Gauss-Seidel method is guaranteed to converge given that the matrix you want to solve is positive definite. I've looked at the proofs of convergence, and it appears that one cannot ...

**5**

votes

**2**answers

544 views

### Is it possible to check two curves on birational equivalence by some computer algebra system?

I have two curves, for example hyperelliptic:
\begin{align}
&y^2 = x^6 + 14x^4 + 5x^3 + 14x^2 + 18, \\\\
&y^2 = x^6 + 14x^4 + 5x^3 + 14x^2 + 5x + 1
\end{align}
Is it possible to check them ...

**5**

votes

**5**answers

1k views

### Computer algebra system for calculation of characteristic polynomial of sparse matrix

I have a $n \times n$ matrix, for which i need to calculate the characteristic polynomial. The matrix is over $GF(2)$, and $n \approx 10^4$. However the matrix is very sparse, with around $ n $ non ...

**0**

votes

**1**answer

433 views

### Polynomial of degree N with integer coefficient for a given root.

Is it possible to construct a polynomial of degree N, with all of them as integer coefficient have a root as the given value. ...

**6**

votes

**1**answer

2k views

### Constructing a unitary matrix

Setting:
Given a set of $n\times n$ matrices $A_i$, I would like to find a linear combination of these matrices $Q = \sum_i A_i x_i$ with $x_i$ a set of complex numbers, such that $Q$ is unitary: ...

**4**

votes

**1**answer

161 views

### Expressing a element of a Matrix subgroup in terms of subgroup generators

I'm no (computational) algebraist, and my searches have been pretty unyielding (probably due to the vast amounts written on the key words), but perhaps someone may know if this is possible, and if so, ...

**8**

votes

**2**answers

697 views

### Homological computations

Suppose I have a group acting on some Hadamard manifold, and I want to understand as much as possible about the (co)homology of the quotient. In my case I can find a fundamental domain for the action ...

**4**

votes

**0**answers

195 views

### Algorithm/denominators of elements of a rational affine space

I hope it's not a trivial question... Suppose I have a finite dimensional vector space $V$ over $\mathbb{Q}$ with a distinguished basis (in my case it's the $k$th graded piece of the free associative ...

**5**

votes

**3**answers

629 views

### Is there a MAGMA function to calculate the absolutely irreducible components of an algebraic curve defined over the rationals?

Given a curve defined over the rationals, is it computationaly possible to find all its absolutely irreducible components?
Is there an implementation of this in the MAGMA program?

**15**

votes

**3**answers

1k views

### What to do when your research runs into a computationally challenging problem?

Occasionally, but more frequently lately, I would like to perform some hard computations. As an example, yesterday the following question came up:
What is the projective dimension of the edge ...

**2**

votes

**0**answers

222 views

### Efficient computing critical points of algebraic function involved radical expression

I am interested in finding local optima of an algebraic function $f(X,Y)$. Suppose, that this expression involves radicals, for example $f(X,Y)= \frac{1}{2}(X+Y)-\sqrt{XY}$. The approach in which i am ...

**2**

votes

**0**answers

209 views

### How to ask Magma to compute the induced morphisim on divisor group

Suppose Magma has computed homomorphism $h$ between function fields $F1 \to F2$. Then we have an induced homomorphism $h$ on the divisor group. Now my question is that if there's a better way to ...

**6**

votes

**0**answers

416 views

### Where can I find tables of dual canonical basis vectors?

Leclerc (arXiv:math/0209133) has given us an algorithm for computing the dual canonical basis of the upper part of a quantised enveloping algebra.
Now presumably this algorithm has been implemented ...

**5**

votes

**1**answer

403 views

### Does a variety contain a cartesian product of two curves?

We are given an affine variety $V\subset \mathbb{A}^n\times\mathbb{A}^n$, and wish to know if it contains a product of the form $C_1\times C_2$, where $C_1$ and $C_2$ are two curves in $\mathbb{A}^n$. ...

**6**

votes

**1**answer

868 views

### A 2F1 Hypergeometric identity from a Feynman integral

Using two different approaches to evaluating the dimensionally regularized ($d=4-2\epsilon$ dimensional Euclidean space), equal mass ($x=m^2$), 2-loop vacuum Feynman diagram
$$
\begin{align}
I(x) ...

**0**

votes

**1**answer

158 views

### the maximal length of a special dicksonian sequence

First, we define a sequence $t_{1},t_{2},\cdots,t_{k}$ of n-tuples dicksonian, if $\forall 1\leq i < j\leq k,$ there does not exist a non-negative n-tuple t such that
$t_{i}+t=t_{j}.$ For example, ...

**6**

votes

**4**answers

2k views

### how to determine whether an ideal is prime or not by an algorithm

Given polynomials $f_{1},\cdots,f_{n}\in \mathbb{C}[x_{1},\cdots,x_{m}]$, do we have an algorithm to determine whether the ideal $I=(f_{1},\cdots,f_{n})$ is prime ideal or not? Of course, we assume ...

**3**

votes

**0**answers

281 views

### Rank of Subgroup of Elliptic Curve

I'm currently looking at two rational points $ p, q $ on an elliptic curve $E$ over $ \mathbb{Q} $. SAGE tells me that $E$ has rank 5 and no torsion, and that $p$ and $q$ both have infinite order. ...

**4**

votes

**3**answers

1k views

### Differential Geometry/General Relativity Computer Algebra

Hi,
could anybody recommend a CAS suited to DG/GR applications such as computation of connection coefficients or generating (and possibly solving) PDEs for, for example, an unknown metric of given ...

**9**

votes

**5**answers

1k views

### Multipolynomial resultants

We know that the resultant of two polynomials can be computed as the determinant of their Sylvester matrix ( http://en.wikipedia.org/wiki/Sylvester_matrix ). How do we compute the resultant of more ...

**31**

votes

**3**answers

3k views

### Is there a systematic method for differentiating under the integral sign?

This MO question by Tim Gowers reminded me of a question I've wondered about for some time. In the delightful book Surely You're Joking, Mr. Feynman!, Feynman praises the technique of differentiating ...