**-2**

votes

**0**answers

93 views

### Given a set of generators of a group G, is there a method to find a presentation for G using those generators? [migrated]

Suppose I have a group $G$, which I know is finitely presentable and infinite. (In particular, I have a presentation for it, though not the one I want).
Suppose I have a small list of generators ...

**3**

votes

**0**answers

129 views

### Dimension of a commuting nilpotent variety

Fix $k$ an algebraically closed field, $n$ a natural number, and $\lambda=(\lambda_1,\ldots,\lambda_m)$ a partition of $n$. Let $A$ be any $n\times n$ nilpotent matrix with entries in $k$ whose ...

**6**

votes

**1**answer

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

**0**

votes

**1**answer

51 views

### Software for noncommutative Groebner bases over rational function fields

I am wondering whether there is any software package that can compute Groebner bases for noncommutative algebras defined over the field of rational functions $\mathbb{Q}(q)$.
I have tried the GAP ...

**3**

votes

**0**answers

124 views

### What is the function like when its Mobius inversion is $\sum_{w|r, (w,t)=1}\mu(w)q^{r/w}$?

Everyone, I am now reading a paper named The Irreducible Factors of $(cx+d)x^{q^m}-(ax+b)$ over $GF(q)$, http://qjmath.oxfordjournals.org/content/14/1/61.extract. And I’m confused with one of its ...

**1**

vote

**0**answers

86 views

### Benchmark problems for computing rational points on varieties

Are there standard benchmark problem sets used for empirically evaluating algorithms designed for computing rational points on (various classes of) algebraic varieties?
If so, could you please point ...

**6**

votes

**1**answer

228 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$; ...

**3**

votes

**1**answer

123 views

### Is the ideal membership problem solvable for differential ideals? Is there a good notion of a Gröbner basis?

Let $K$ be a field of characteristic zero. Let $\Omega = K[x_1, \dots, x_n, dx_1, \dots, dx_n]$ be the differential ring of algebraic differential forms over $K[X_1, \dots, X_n]$.
Is there an ...

**2**

votes

**1**answer

198 views

### efficient arithmetic with (short) Conway games?

We consider "games" in the sense of ONAG. Conway's definition of a game $G$ as a pair $G = \{L \mid R \}$ of sets of games, together with the definitions of inequality and the arithmetic operations ...

**2**

votes

**0**answers

96 views

### Finding relations between invariant polynomials

Suppose I have an action of a linear reductive group ($GL(2,\mathbb{C})^2$ in this case) on a complex vector space (of dimension $16$) and I want to compute explicitly the ring of invariants of this ...

**2**

votes

**1**answer

109 views

### Finding particular reduced words for Weyl group elements

I am studying cluster algebra structures on the coordinate rings of partial flag varieties, as defined in the paper Partial flag varieties and preprojective algebras by Geiss, Leclerc and Schröer. One ...

**1**

vote

**0**answers

139 views

### Finding a generator of an ideal in an algebraic function field

I have an algebraic function field $\mathbb{Q}(x,y)$, where $y$ satisfies
$$ (y^2-1)^2 = x^2(1+x^2), $$
and I need to find a rational function that has a first order root at $x=0,y=1$ a first order ...

**4**

votes

**1**answer

195 views

### The Representation of $\mathrm{Sp}_{2n}$ of Dimension $2^n$ in characteristic 2

Let $G:=\mathrm{Sp}_{2n}$ be the simple algebraic group of simply connected type with root-system $C_n$.
Is there a way, to explicitly construct the
highest weight representation ...

**1**

vote

**0**answers

66 views

### Testing functional equivalence

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

**17**

votes

**1**answer

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

**2**

votes

**0**answers

177 views

### Using the Affine Maxima Package

The Maxima computer algebra system has a package called Affine for doing the calculations implicit in Bergman's diamond lemma for rings. It can be viewed as a kind of noncommutative analogue of ...

**1**

vote

**1**answer

218 views

### Serre's conditions under blow-ups, Blowup and normalization

Suppose $X = \mathbb{Z}[x, y, z]/(f,g)$ is a 2-dimensional Cohen-Macaulay surface. In particular, $X$ satisfies Serre's condition $S_2$. Suppose it is irreducible, reduced but not normal.
...

**4**

votes

**1**answer

215 views

### Algorithm to decide if ideal is principal

Suppose $R = \mathbb{Q}[x_1, ..., x_n]/I$, and $J \subset R$ is a given height one ideal. Is there a quick algorithm one could write to determine if $J$ is a principal ideal or necessarily not ...

**1**

vote

**1**answer

120 views

### Finding reducible polynomials with restricted factors

Given $f(x),g(x) \in \mathbb{Z}[x]$, two irreducible polynomials, is there a polynomial $h(x) \in \mathbb{Z}[x]$ coprime to $f(x)$ such that $f(x) + g(x)h(x)$ is reducible over $\mathbb{Z}[x]$ with ...

**2**

votes

**2**answers

307 views

### Numerical Determination of Generating Functions from Recursion Relations

Are there computer packages which calculate coefficients of generating functions, such as
$$D_n(q)=\sum_m d_{m,n}q^m= \frac{1}{\prod_{i=1}^n (1-q^i)^2} \text{ or}$$
$$S_d(q)=\sum_m s_{m,d}q^m = ...

**0**

votes

**1**answer

293 views

### What program/language can I use to handle large numbers (over 10^300) [closed]

I'm trying to multiply together a set of numbers.
However, the programs I have tried (Excel, R, FreeMat) do not allow numbers above around 300 digits. This limits me to sets of a few hundred numbers ...

**8**

votes

**2**answers

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

**3**

votes

**1**answer

347 views

### Algorithm to find exponential map of differential operators acting on function

I am trying to write a computer program which computes the action of the exponential of a differential operator on a function, for any given differential operator.
Examples:
$\exp(\varepsilon ...

**2**

votes

**1**answer

156 views

### How to maximize the determinant of a matrix of the form VDV^H

Hi,
I have a matrix of the form $A=VDV^H$,
where $V$ is a $M \times 2M$ complex matrix, $D$ is a $2M \times 2M$ diagonal real matrix, thus the dimension of $A$ is $M \times M$.
My problem is how ...

**1**

vote

**1**answer

203 views

### Sage or Magma Implementation of Nilpotent Orbit Varieties

For a given partition $[n_{1},...,n_{k}]$ of $N \in \mathbb{N}$ there exists a corresponding nilpotent orbit variety $O_{[n_{1},...,n_{k}]}$ in $\mathfrak{gl}(N)$ which can be represented by a set of ...

**35**

votes

**0**answers

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

**2**

votes

**1**answer

340 views

### Is there an algorithm to decide if an ideal contains monomials?

Let $I\subset k[x_1,\dots,x_n]$ be an ideal in a polynomial ring in commuting variables. Is there a procedure to decide if $I$ contains a monomial and possibly to find one?
Gröbner bases come to ...

**3**

votes

**1**answer

182 views

### The existential theory of the reals

Some definitions of the existential theory of the reals (ETR) allow a real closed field and some definitions allow only rational numbers as coefficients of polynomials. Which one is correct? Will the ...

**0**

votes

**0**answers

132 views

### Computer package to compute HOMFLY polynomial?

I apologize of already asked by someone else, but what (in your opinion) is the best package for computing HOMFLY polynomials?

**1**

vote

**1**answer

111 views

### Recommendations for 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

**2**answers

184 views

### My output of a group and inverse-closed subset in MAGMA is no longer inverse-closed when entered as input to GAP.

In MAGMA, I input the following:
G:=SmallGroup(20,3);
G;
E:=[xx:xx in G];
S:=[E[6],E[7],E[13],E[20]];
S;
S[1]^2;
S[2]^2;
S[3]*S[4];
This gives the output:
GrpPC : ...

**3**

votes

**3**answers

488 views

### Good Computer Package for Calculating Inverse of a Formal Power Series?

This might be a question people already asked or is obvious to experts, or is not appropriate for this forum, if so, I apologize. I am trying to calculate things like $z/(e^z-1)$, or find the inverse ...

**2**

votes

**1**answer

285 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

428 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

135 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

319 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

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

**4**

votes

**4**answers

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

**3**

votes

**0**answers

248 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

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

**4**

votes

**1**answer

304 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

93 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

313 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

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

**17**

votes

**7**answers

930 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

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

**7**

votes

**4**answers

919 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

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

**5**

votes

**0**answers

221 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

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