Questions tagged [computer-algebra]

Using computer-aid approach to solve algebraic problems. Questions with this tag should typically include at least one other tag indicating what sort of algebraic problem is involved, such as ac.commutative-algebra or rt.representation-theory or ag.algebraic-geometry.

Filter by
Sorted by
Tagged with
34
votes
2answers
2k views

Does there exist a complete implementation of the Risch algorithm?

Is there a generally available (commercial or not) complete implementation of the Risch algorithm for determining whether an elementary function has an elementary antiderivative? The Wikipedia article ...
2
votes
2answers
98 views

How to find a solution of a large system of linear diophantine inequalities?

I need to find a solution (all solutions, or at least upper and lower bounds) in positive integer numbers to the system $Ax \ge f$, where $A$ is an integer matrix. With SageMath, I solved it with the ...
9
votes
0answers
172 views

When is cohomology of a finitely presented dg-algebra computable?

Given a smooth affine variety $X$ defined over $\mathbb{Q}$, its singular cohomology is isomorphic to the algebraic de Rham cohomology, which is the cohomology of the complex $\Omega_X^0\to\Omega_X^1\...
8
votes
2answers
194 views

Is there a CAS that can solve a given system of equations in a finite group algebra $kG$?

Let $k$ be a finite field with char$(k)=p>0$. Let $G$ be a finite group. Consider the group algebra $kG$. I would like to solve a given system of equations in $kG$. Question: Is there a computer ...
1
vote
1answer
89 views

Problem while multiplying under a set of relators [closed]

I have defined $S_4$ (Symmetric group of order 4), and with the base field $Z_5$, groupring $Z_5S_4$ is constructed. Then I have taken two elements of this group ring and I want to multiply them to ...
9
votes
2answers
437 views

A “subtle” isomorphism testing problem: $\mathbb{Z}\ltimes_{A} \mathbb{Z}^5\cong \mathbb{Z}\ltimes_{B}\mathbb{Z}^5$ or not?

EDIT: I've made a mistake with the matrices. Now it is corrected. A couple of days ago I asked this question. There, answerers gave me excellent hints to solve that case and others too. But I've found ...
4
votes
1answer
140 views

Is there a point in 6-dimensional space satisfying these polynomial inequalities?

I would like to know if there is a point $(a, b, p, q, x, y) \in [0,1]^6$ satisfying the following collection of inequalities. $b \ge a$ $q \ge p$ $y \ge x$ $a \ge p \ge a^2$ $b \ge q \ge b^2$ $p \ge ...
2
votes
0answers
104 views

Computing whether a set of polynomials cuts out a projective variety

I have a set of multivariate polynomials over $\mathbb{Q}$, and I want to compute whether they cut out a projective variety, i.e. whether the radical of the ideal $I$ that they generate is homogeneous....
1
vote
0answers
101 views

Saturated ideals in computational algebra

Let $R$ a commutative ring with one and $I, J \triangleleft R$ two ideals. The saturated ideal $I^{sat}_J$ with respect $J$ is the ideal $$(I : J^\infty )= \cup_{n \geq 1} (I:J^n)$$ where $(I:J^n)= \{...
0
votes
0answers
95 views

Stabilizers in the action of $\mathrm{GL}(n, \mathbb Z)$ on $\mathbb Z^n$

How can we calculate effectively the subgroups of $G: = \mathrm{GL}(n, \mathbb Z)$ which fix pointwise a given submodule $S$ of $\mathbb Z^n$ in the action of $G$ on $\mathbb Z^n$ by left ...
6
votes
2answers
143 views

Is the matrix positive definite given the Gauss-Seidel method converges?

I know that the Gauss-Seidel method converges given that the matrix you want to solve is symmetric positive definite. However, I'm wondering if the "converse" of the statement is true. Namely, if $A$ ...
2
votes
0answers
67 views

Affine projection of polynomials for a given set of points

(Not sure this question fits here, I will remove it in case it doesn't) Let $F_{\mathrm{ML}}[x_1, \ldots,x_n]$ denote the set of multilinear polynomials over a finite field $F=\mathbb{F}_q$ (i.e. a ...
3
votes
0answers
62 views

Frobenius algebras of small dimensions

In Classification of commutative Frobenius algebras , Jeremy Rickard showed that there are infinitely many commutative (local without loss of generality) Frobenius algebras of vector space dimension ...
7
votes
0answers
108 views

Classification of Frobenius algebras of small dimensions

Despite (commutative) Frobenius algebras over a field $K$ being a very popular class of algebraic objects, it seems no attempt of classification (up to $K$-algebra isomorphism) for them has been ...
0
votes
0answers
54 views

Low rank approximation

Can we solve low rank approximation problem by using concept of Gröbner basis? I was trying to find it by Macaulay2 but didn't find the answer. I was trying to do by toric ideals as for them Gröbner ...
5
votes
0answers
101 views

Rank of matrix over UFD polynomial ring

I have a matrix, $M$, size of approximately $20\times 25$, over a polynomial ring $\mathbb{Q}[x_1, \cdots, x_n]$ and a number $r$ such that I would like to test whether or not there exist values for ...
11
votes
1answer
393 views

Greatest common divisor in $\mathbb{F}_p[T]$ with powers of linear polynomials

Let $n>1$ and $p$ be an odd prime with $p-1 \mid n-1$ such that $p^k - 1 \mid n-1$ does not hold for any $k>1$. Notice that, since $p-1 \mid n-1$, we have $T^p - T \mid T^n-T$ in $\mathbb{F}_p[T]...
0
votes
1answer
95 views

IntersectInP bug of Macaulay2 [closed]

I am trying to use the intersectInP command in Macaulay2, inside package ReesAlgebra. However, I tried to follow the exact code in the user-guide, but it doesn't run in my Ubuntu app (of win 10). Can ...
2
votes
0answers
48 views

Determining the symmetry group of a system of ODEs as tensor product decomposition

Suppose you have a linear system of ODEs in implicit form represented by an $n \times n$ matrix $M$ and you are trying to identify a subgroup of $\mathrm{GL}(n)$ that is the symmetry group of this ...
2
votes
1answer
128 views

Intersection of a $\mathbb{Q}$-affine space with $\mathbb{Z}^n$

Let $E$, a $\mathbb{Q}$-affine space of arbitrary dimension included in $\mathbb{Q}^n$. Is it possible to check efficiently if $E \cap \mathbb{Z}^n$ is empty or not? If is an hard problem could give ...
4
votes
1answer
142 views

On nearly Frobenius algebras

Let $A$ be a quiver algebra over a field $k$ with multiplication $m$. By https://arxiv.org/pdf/1705.10222.pdf definition 6, $A$ is called nearly Frobenius in case there exists a (non-zero? Was this ...
2
votes
0answers
68 views

CAS for finite-dimensional complex representations of $S_n$

Does there exist a computer algebra system that can work with finite-dimensional complex representations of the symmetric groups on finitely many letters? It should have the following functionality: (...
1
vote
0answers
62 views

Is there a workable numerical method for determining the center of a circle through three points? [closed]

I'm a 73-year-old engineer struggling with numerically implementing a math problem. I am working on a kinematic linkage project that generates motion paths (as long sequences of x,y coordinates) of ...
3
votes
1answer
308 views

Lower bound for polyhedral real quantifier elimination

All known examples for double exponential lower bounds for real quantifier elimination involves polynomial inequalities with degree $>1$. Is there an example of double exponentiality with ...
3
votes
1answer
342 views

Special linear Diophantine system - is it solvable in general?

Background: An equivalent question was asked on MSE almost two years before this post now. It was never fully resolved. - Here, we are asking if further progress can be made. Motivation Solving this ...
1
vote
0answers
68 views

Degree bounds on coordinates of points in a zero-dimensional variety

Let $S = \{f_1, \dots, f_s \in \mathbb{Q}[x_1, \dots, x_n]\}$ have a zero-dimensional nullset $V \subset \mathbb{C}^n$, and suppose that each $f_i$ has total degree at most $d$. Is there a shared ...
2
votes
0answers
57 views

Constructing stable equivalences for finite dimensional algebras

Given a finite dimensional (non-selfinjective) algebra $A$. Is there a method (for example using QPA) to construct algebras stable equivalent to $A$? Such a thing is easily possible for derived ...
4
votes
0answers
79 views

Deciding whether two algebras are derived equivalent

Given two finite dimensional quiver algebras $A$ and $B$ (over a nice field in case that helps, for example a finite field). Question: Can an there be a finite algorithm that decides whether $A$ ...
5
votes
0answers
109 views

Stable equivalence and stable Auslander algebras

Let $A$ be a representation-finite finite dimensional quiver algebra and $M$ the basic direct sum of all indecomposable $A$-modules. Recall that the Auslander algebra of $A$ is $End_A(M)$ and the ...
4
votes
2answers
222 views

On Auslander algebras

Given a connected quiver algebra $A$ that is representation finite, the Auslander algebra $B_A$ of $A$ is defined as the endomorphism ring of the direct sum of each indecomposable $A$-module. It is ...
5
votes
1answer
140 views

Ideals of commutative Frobenius algebras

Given a finite dimensional commutative (connected=local) Frobenius algebra $A$ over a field $K$. Question 1: Does $A$ have only finitely many ideals? (the answer should be no in the non-commutative ...
0
votes
1answer
98 views

Quantifier elimination and where is this quantified convex program in the polynomial hierarchy?

I have a quantified convex program of the form that I need to solve $$\exists(x_{1,1},\dots,x_{1,n})\in\mathbb R^n\quad\forall(x_{2,1},\dots,x_{2,n})\in\mathbb R^n$$ $$\vdots$$ $$\exists(x_{2t-1,1},\...
4
votes
1answer
147 views

Branching to Levi subgroups in SAGE and the circle action

In the SAGE computer package, there useful exist tools for branching representations of a simple Lie group to a Levi subgroup: http://doc.sagemath.org/html/en/reference/combinat/sage/combinat/...
-1
votes
1answer
80 views

Perform a univariate integral, involving a Gauss hypergeometric function

This is a follow-up question to the one posed in Compute the two-fold partial integral, where the three-fold full integral is known . (I hope that doing so is viewed as a legitimate step. If not so, I ...
3
votes
4answers
546 views

Compute the two-fold partial integral, where the three-fold full integral is known

I have the following trivariate ($\rho_{11}, \rho_{22}, \mu$) function \begin{equation} 4 \mu ^{3 \beta +1} \rho_{11}^{3 \beta +1} \left(-\rho_{11}-\rho_{22}+1\right){}^{3 \beta +1} \rho_{22}^{3 \...
1
vote
2answers
309 views

Computing Groebner basis for a complicated systems of polynomials

I am trying to solve complicated systems of polynomial equations. The first step is to determine maximal sets of independent variables for the solution manifold (ideal) or the number of isolated ...
5
votes
2answers
175 views

Obtaining quiver and relations for finite p-groups

Given a finite field $K$ with $p$ elements and a finite $p$-group $G$, is there a way to obtain the quiver and relations of $KG$ with GAP (and its package QPA)? Since $KG$ is local, the quiver should ...
4
votes
0answers
125 views

Recovering the bimodule from the trivial extension

Given a ring $S$ with a non-zero $S$-bimodule $M$, the trivial extension of $(S,M)$ is defined as the ring $R:=T_M(S)$ with $R= S \oplus M$ with multiplication $(s,m)(s',m')=(s s', sm' +m s')$. We ...
0
votes
0answers
54 views

Quadrics over the univariate function field with discriminant of minimal degree

Consider a non-degenerate quadric $Q(x,y,z) \subset \mathrm{P}^2$ over the univariate function field $\mathbb{F}_p(t)$, where $\mathbb{F}_p$ is a prime finite field, $p > 2$. For simplicity assume ...
1
vote
0answers
145 views

Computing the class-preserving automorphism group of finite $p$-groups

Let $G$ be a finite non-abelian $p$-group, where $p$ is a prime. An automorphism $\alpha$ of $G$ is called a class-preserving if for each $x\in G$, there exists an element $g_x\in G$ such that $\alpha(...
3
votes
1answer
108 views

Computing double coset operators in a computer algebra system

I want to do double coset operators computations on modular forms of half integer weight and with character such as the trace operators that map modular forms of congruence subgroups $\Gamma_0(N)$ to ...
2
votes
0answers
80 views

Obtaining the reduced incidence algebra in QPA

Given a finite poset $P$ (we can assume it is connected), the reduced incidence algebra of $P$ is the subalgebra of the incidence algebra of $P$ consisting of functions constant on isomorphic ...
2
votes
0answers
56 views

Efficient algorithm to prove that a polynomial ideal contains 1

I have the following problem: Suppose to have an ideal $I\triangleleft k[x_1,...,x_n]$ defined by generators. There exists an efficient algorithm (perhaps more efficient than calculating the Groebner ...
0
votes
0answers
119 views

lcalc and the Analytic Rank of $y^2 = x^3 + 432764797 x^2 + 332896 x$

I'm looking at elliptic curves associated with $a/(b+c) + b/(a+c) + c/(a+b) = N$. For the case $N=10400$, Michael Rubinstein's lcalc gives the analytic rank of the associated elliptic curve $y^2 = x^3 ...
6
votes
1answer
296 views

Calculating the Ext-algebra with a computer

Given a finite dimensional quiver algebra $A$ over an arbitrary field and a module $M$ of finite injective dimension or finite projective dimension. Let $B$ be the Ext algebra of $M$, that is $B:=\...
4
votes
0answers
98 views

Compute the closure of graph of function from complement of hypersurface in $\mathbb{A}^n$

I'm hoping someone can give me some tips to help speed up computation on the following problem: Suppose I have a map $G=(g_1/f,\dots,g_m/f):\mathbb{A}^n\setminus{V(f)}\to \mathbb{A}^m$. I'm ...
3
votes
1answer
155 views

Solving polynomial inequalities — efficient Positivstellensatz on a computer

I have about twenty five (multilinear) polynomials $f_1(\mathbf{x}), f_2(\mathbf{x}), \dots, f_{25}(\mathbf{x})$ all in fifteen variables and I would like to decide if there is a $\mathbf{y} \in [0,1]^...
3
votes
0answers
91 views

Finite test for periodicity of a module

Let $A$ be a finite dimensional quiver algebra and $M$ a finite dimensional $A$-module. Assume we want to test whether $M$ is a periodic module, meaning that $\Omega^n(M) \cong M$ for some $n \geq 1$. ...
4
votes
1answer
237 views

Resultants for compactly represented product form polynomials?

Typically computing resultnt of $n+1$ different $n+1$-variate homogeneous polynomials takes $O(poly(\prod_{i=1}^{d_{i}}))$ time where $d_i$ is degree of $i$th polynomial. In certain cases the ...
3
votes
2answers
238 views

Find parameter values for which a 3x3 matrix has a triple eigenvalue

An Exceptional point generally occurs in eigenvalue problems in which the matrix is dependent on some parameter(s). The particular point in which the eigenvalues become degenerate for the parameter(s) ...

1
2 3 4 5 6