**87**

votes

**68**answers

14k views

### Most helpful math resources on the web

What are really helpful math resources out there on the web?
Please don't only post a link but a short description of what it does and why it is helpful.
Please only one resource per answer and let ...

**67**

votes

**33**answers

16k views

### Computer Algebra Errors

In the course of doing mathematics, I make extensive use of computer-based calculations. There's one CAS that I use mostly, even though I occasionally come across out-and-out wrong answers.
After ...

**44**

votes

**2**answers

1k views

### Reasons to prefer one large prime over another to approximate characteristic zero

Background:
In running algebraic geometry computations using software such as Macaulay2, it is often easier and faster to work over $\mathbb F_p = \mathbb Z / p\mathbb Z$ for a large prime $p$, rather ...

**33**

votes

**21**answers

8k views

### Open source mathematical software.

I want some recomendation on which software I should install on my computer, an open source program for general abstract mathematical purposes (as opposed to applied mathematics).
I would likely use ...

**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 ...

**29**

votes

**1**answer

1k views

### Algebraic dependency over $\mathbb{F}_{2}$

Let $f_{1},f_{2},\ldots,f_{n}$ be $n$ polynomials in $\mathbb{F}_{2}[x_{1},x_{2},\ldots,x_{n}]$
such that $\forall a=(a_1,a_2,\ldots,a_n)\in\mathbb{F}_{2}^{n}$ we have $\forall ...

**23**

votes

**4**answers

2k views

### Can Gröbner bases be used to compute solutions to large, real-world problems?

In particular, suppose I have an affine algebraic variety over $\mathbb{R}^n$ described by generators of a radical ideal $I$ and I want to find (perhaps not all of the) points in the variety. Several ...

**21**

votes

**5**answers

6k views

### The unification of Mathematics via Topos Theory

When the paper The unification of Mathematics via Topos Theory by Olivia Caramello, says "one can generate a huge number of new results in any mathematical field without any creative effort." is this ...

**18**

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 ...

**17**

votes

**1**answer

748 views

### Main open computational problems in quantifier elimination?

A language is said to have quantifier elimination if every first-order-logic sentence in the language can be shown to be equivalent to a quantifier-free sentence, i.e., a sentence without any ...

**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 ...

**16**

votes

**2**answers

710 views

### Where to publish computer computations

In a paper I developed some theory; some of the applications require extensive computations that are not part of the paper. I wrote a Mathematica notebook. I want to publish a PDF and .nb version ...

**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 ...

**13**

votes

**6**answers

2k views

### “Oldest” bug in computer algebra system?

The goal of this question is to find an error in a computation by a computer algebra system where the 'correct' answer (complete with correct reasoning to justify the answer) can be found in the ...

**13**

votes

**2**answers

510 views

### Codimension of the range of certain linear operators

Assume that $P(x,y), Q(x,y) \in \mathbb{R}[x,y]$ are two polynomials. We define a linear map
$D$ on $\mathbb{R}[x,y]$ with $D(U)=PU_{x}+QU_{y}$. In fact $D$ is the derivational operator correspond ...

**12**

votes

**3**answers

2k views

### Computing (on a computer) higher ramification groups and/or conductors of representations.

I am supervising an undergraduate for a project in which he's going to talk about the relationship between Galois representations and modular forms. We decided we'd figure out a few examples of weight ...

**12**

votes

**4**answers

999 views

### An experiment on random matrices

A bit unsure if my use/mention of proprietary software might be inappropriate or even frowned upon here. If this is the case, or if this kind of experimental question is not welcome, please let me ...

**12**

votes

**1**answer

729 views

### Computational Question about finite local rings:

Let $(A,\mathfrak{m})$ be a local Artinian ring with
finite residue field, which I'm happy to assume is $\mathbf{F}_3$.
(In particular, $A$ has finitely many elements.)
I would like to do some ...

**12**

votes

**2**answers

524 views

### Faster multiplication with a restricted set of multiplicands?

Let $A$ be a set of $k>1$ distinct elements from a semigroup. We wish to compute the product
$$ p=b_1 b_2 \cdots b_n$$
where each $b_i\in A$.
Clearly $n-1$ multiplications suffice to compute $p$; ...

**12**

votes

**1**answer

446 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 ...

**10**

votes

**2**answers

357 views

### Counting points on varieties of low codimension

The graduate students here at MIT have been thinking about questions like the following: Over $\mathbb{F}\_q$, how many symmetric matrices are there with nonzero determinant and $0$'s on the diagonal? ...

**10**

votes

**3**answers

473 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 ...

**9**

votes

**9**answers

2k views

### Is there a non self-referencing non-computable function?

I've seen in college that some functions are not computable.
The proof for that was the case of Halt(x,y) function.
The thing is, the proof used a very artificial (IMHO) case
which is evaluating ...

**9**

votes

**8**answers

3k views

### Which computer algebra system should I be using to solve large systems of sparse linear equations over a number field?

This is related to Noah's recent question about solving quadratics in a number field, but about an even earlier and easier step.
Suppose I have a huge system of linear equations, say ~10^6 equations ...

**9**

votes

**2**answers

1k views

### Compute Lie algebra cohomology

Is there a computer algebra system that is able to compute the Lie algebra cohomology in a given representation? What if the Lie algebra is finite dimensional?
In my case I would like to be able to ...

**9**

votes

**5**answers

958 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 ...

**9**

votes

**4**answers

864 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 ...

**9**

votes

**3**answers

1k views

### Is there a stable algorithm for polynomial division (in several variables)?

Suppose you have a homogeneous ideal $I$ inside the algebra $\mathbb{C}[x_1,...,x_d]$ of complex polynomials in $d$-variables. Can one find a basis for $I$, say $\{f_1,...,f_k\}$, such that every $h ...

**9**

votes

**5**answers

582 views

### is there a good computer package for working with bicomplexes?

I'm interested in working with bicomplexes of modules over polynomial rings, specifically tensoring them together, and the operation of taking cohomology in one direction, and then the other. Is ...

**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.

**8**

votes

**2**answers

672 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 ...

**8**

votes

**4**answers

299 views

### Fast computation of a Groebner basis - What is Possible

I need to compute a Groebner basis of 18 polynomials in 19 variables the terms of which have degree at most 3. My aim is to exploit a symmetry in a PDE problem and I am not an expert in algebra or ...

**8**

votes

**2**answers

219 views

### Ideal Membership without Certificate?

I have a homogeneous ideal $I=\langle f_1,\ldots,f_r\rangle$ of the polynomial ring $\mathbb C[X_1,\ldots,X_n]=:R$ where each of the $f_i$ is actually over $\mathbb Z$. My computations are usually ...

**8**

votes

**2**answers

279 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 ...

**7**

votes

**4**answers

2k views

### Basis for modular forms of half-integral weight.

Given a character $\chi$ and $k$ odd how can one compute a basis for the space of modular forms $M_\frac{k}{2}(\Gamma_0(4),\chi)$. By compute a basis I mean, finding the beginning of the Fourier ...

**7**

votes

**5**answers

3k views

### Finding minimal or canonical expressions for Boolean truth tables

This is not an urgent question, but something I've been curious about for quite some time.
Consider a Boolean function in n inputs: the truth table for this function has 2n rows.
There are uses of ...

**7**

votes

**1**answer

498 views

### Mathematical software for computing in integral group rings of discrete groups?

I'm doing computations in the integral group ring of a discrete group,
in particular the discrete Heisenberg group. In this case elements
are integral combinations of monomials $x^k y^m z^n$, where ...

**7**

votes

**1**answer

489 views

### Are there any sofware packages for computing Picard numbers?

Are there any computer algebra systems (e.g. Macaulay2 og singular) that allows one to compute the Picard number (i.e. the rank of the Neron-Severi group) of a given variety?

**7**

votes

**2**answers

341 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 ...

**7**

votes

**0**answers

229 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 ...

**6**

votes

**6**answers

1k views

### What are you using for symbolic computation?

What are the pluses and minuses of different software packages? Anything new worth checking out?
I'm especially interested in open source packages.

**6**

votes

**4**answers

1k 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 ...

**6**

votes

**3**answers

1k views

### Computing only the order of Galois group (not the group itself).

My question is related to this one: Computing the Galois group of a polynomial.
I was wondering if there is a faster algorithm just to compute the order of the group rather than the group itself.
...

**6**

votes

**3**answers

2k views

### Rational exponential expressions

Consider the following extension of polynomials. The rational exponential expressions (REXes) are given by:
The leaves 1 and $x$ for $x$ drawn from a class of variables; and
Closed under the binary ...

**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 ...

**6**

votes

**1**answer

318 views

### Using math software to show that the following groups are infinite?

I would like to show that the following finitely presented group in 3 generators $P, Q, R$ is infinite in certain cases:
$$P^p, Q^q, R^r, (PQ)^2, (QR)^2, (PQR)^2, (QR^{r/2+1})^a (RQR^{r/2})^b$$
For ...

**6**

votes

**1**answer

518 views

### Is there a good computer package for working with complexes over non-commutative rings?

I'm interested in doing computations with certain non-commutative rings, most of which involve taking derived tensor products. Does anyone know of a computer algebra package which will find ...

**6**

votes

**3**answers

379 views

### Complexity of high-order differentiation

Let $g(x) = \exp(f(x))$. Assuming numerical (or symbolic) values of $f(x), f'(x), f''(x), \ldots, f^{(n)}(x)$ are known, is there a way to compute $g'(x), g''(x), \ldots g^{(n)}(x)$ (or even the ...

**6**

votes

**1**answer

601 views

### Choosing a fast computer algebra system that works in characteristic p?

Hi all,
I want to compute in $\mathbb{F}_q (x)((y))$ i.e. a Laurent series ring over the rational functions over $\mathbb{F}_q$. The computations are fairly basic, but they involve raising to the qth ...

**6**

votes

**1**answer

851 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) ...