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
6
votes
1answer
697 views

Computing kernels of maps of modules over a finitely presented algebra

I have the following problem: I have an associative (noncommutative) algebra $A$ defined over a rational function field $k = \mathbb{Q}(\delta, \lambda)$. $A$ is given by a presentation in terms of ...
6
votes
1answer
545 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, ...
6
votes
0answers
198 views

Constructing the normal sheaf for the plucker embedding in MAGMA (or a similar programming language)

How would one construct the normal sheaf $N_{G(2,6)/\mathbb P^{14}}$ to the plucker embedding of the grassmannian $G(2,6) \rightarrow \mathbb P^{14}$ as a sheaf in MAGMA (or another programming ...
5
votes
4answers
5k views

Computational algebra: where?

I'm on my last semester of a math B.Sc. and about to start studying for a math M.Sc in the same institute. It now seems like a good time to start thinking of a PhD. I'm interested in both algebra and ...
5
votes
2answers
649 views

Given a formal power series ,decide whether there exists a polynomial the series satisfies and if it exists,how to write it down?

Given a formal power series $$y(x)=\sum_{i=0}^{\infty} a_i x^i$$ Is there an algorithm that decides whether there exists a polynomial$$ P(x,y)=p_n(x)y^n+p_{n-1}(x)y^{n-1}+\cdots+p_0(x)=0,p_j(x)\in F[x]...
5
votes
2answers
2k views

Algorithm for Weierstrass Preparation Theorem for Formal Power Series

The Weierstrass preparation theorem for formal power series rings guarantees that if a given formal series $f(z) = \sum a_k z^k \in R[[z]]$ where $R$ is a complete local ring with maximal ideal $M$ ...
5
votes
2answers
771 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
1answer
731 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 SmallGroup(...
5
votes
3answers
408 views

Automatic proving some expression is positive

Is there any automated (i.e., some algorithm) to prove that a certain algebraic expression is always non-negative in some range ? If so, is there any implementation you would suggest? My concrete ...
5
votes
3answers
851 views

Is there a software package that does Schubert Calculus computations?

Is there a good software package for doing computations in the cohomology ring of Grassmannians? Things like, I can write down a polynomial in, in fact, special Schubert classes, but it's one where ...
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 ...
5
votes
2answers
307 views

What are the most general methods for solving equations in closed form with Lambert W?

What are the most general methods for solving equations with help of Lambert W function or with a generalization of Lambert W function in closed form? I gave a method in MSE here. Which algorithms ...
5
votes
1answer
421 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 ...
5
votes
3answers
923 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 ...
5
votes
1answer
178 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, ...
5
votes
1answer
436 views

software for computations on flag varieties in arbitrary characteristic

Is there any software that will compute cohomology of vector bundles (or just line bundles) on flag manifolds? The only one I know of is Macaulay2, via the Schubert2 package, but it works with what ...
5
votes
1answer
203 views

speeding up Gosper and WZ algorithms

In our ongoing work to speed up symbolic summation and other similar algorithms in Sagemath, we notice that naive implementations of Gosper and Wilf-Zeilberger (a.k.a. WZ) algorithms are usually quite ...
5
votes
2answers
396 views

Matroids relaxations of a given matroid

Let $\mathcal{M}$ be a rank-$d$ matroid on $[n]$. Say a matroid $\mathcal{N}$ is a relaxation of $\mathcal{M}$ if $\mathrm{rank}(\mathcal{N})=d$, $\mathrm{groundset}(\mathcal{N})=[n]$, and every ...
5
votes
1answer
447 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 ...
5
votes
4answers
547 views

Sections of a divisor on elliptic curve

I'm interested in producing explicit bases for the sections of a line bundle on an embedded genus 1 curve. Let me restrict to the first case that I don't know how to do, so that I can be as concrete ...
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 ...
5
votes
1answer
212 views

Groebner bases for differential operators with field coefficients (reference request)

Let $K$ be a field, $\partial_i$ be commuting derivations on $K$, and consider the ring $R=K[\partial_1\ldots \partial_n]$ (it is implicitly assumed that the derivations do not commute with elements ...
5
votes
2answers
224 views

Can this way of comparing numbers of the form a+b sqrt(K) be generalized?

So I want to make a system for computing with various classes of numbers. One of those is a class of number closed under the standard arithmetic operators ($+$, $-$, $*$ and $/$) along with square ...
5
votes
2answers
503 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 ...
5
votes
1answer
219 views

computing the nonnegative part of a $\mathbb{Z}$-graded ring

Let $R = \bigoplus_{n \in \mathbb{Z}} R_n$ be a $\mathbb{Z}$-graded commutative ring with nonnegative part $R^+ = \bigoplus_{n \geq 0} R_n$ and nonpositive part $R^- = \bigoplus_{n \geq 0} R_{-n}$. By ...
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 ...
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 ...
5
votes
0answers
64 views

Computing centralizers of finite sets in right angled Artin groups (RAAGs) / partially commutative groups / graph groups

This question concerns right angled Artin groups (RAAGs), also called partially commutative groups or graph groups. A student of mine, Adi Ben-Zvi, needs for an algorithm in RAAGs, a subalgorithm ...
5
votes
0answers
137 views

Computations in Weyl algebra with rational function coefficients

I am looking for a software to perform calculations with modules over the algebra $R_n=\mathbb{C}(x_1\ldots x_n)\langle \partial_1\ldots\partial_n\rangle$ of differential operators with rational ...
5
votes
0answers
184 views

Software for BMW algebra calculations?

Does software exist for computations in the BMW algebra? For example, I'd like to be able to express elements in a basis of "totally descending tangles" as in a paper of Morton–Wassermann. At ...
5
votes
0answers
331 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. ...
5
votes
0answers
252 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 "...
4
votes
2answers
406 views

Any CAS that deals with the word problem

I'm new to the combinatorial group theory, so maybe my question is a bit naiive. I know that the word problem is generally "unsolvable". On the other hand there are specific cases, when the problem ...
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 ...
4
votes
1answer
184 views

Decomposing representations of finite groups of Lie type via computer

This is related to my previous question here. Let me remind you what that question asked: Let $\text{St}_n(\mathbb{F}_q)$ be the Steinberg module (over $\mathbb{C}$) for $\text{SL}_n(\mathbb{F}_q)$. ...
4
votes
1answer
735 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 ...
4
votes
1answer
253 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 $\mathrm{L}(\lambda)$,...
4
votes
1answer
622 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 ...
4
votes
2answers
1k views

Finding generators of subalgebra of polynomial algebra $K[x_1,\cdots,x_n]$ that are invariant under the action of symmetric group

Let $I =\langle f_1,\cdots,f_m\rangle \subset K[x_1,\cdots,x_n]$be an ideal, where $f_k\in K[x_1,\cdots,x_n].$ $K[e_1,\cdots,e_n]$ the polynomial algebra generated by the elementary symmetric ...
4
votes
2answers
775 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 ...
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/...
4
votes
1answer
208 views

Efficient computation of null space of large symbolic matrices?

Are there any computer algebra system/libraries that can compute the null space of a large symbolic matrix in parallel? This problem arises when finding invariant polynomials of a continuous linear ...
4
votes
2answers
696 views

Indexed tensor manipulation CAS

hello. I am looking for tensor manipulation software that would allow me: declare indices declare results of contraction (or simplification rules) allow algebraic simplifications and expansion index ...
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 ...
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 ...
4
votes
2answers
415 views

Is there a free action on a given variety?

Given a variety $V$, and a prime $p$ I want to decide if there is a free action of $\mathbb{Z}/p\mathbb{Z}$ on $V$, and to find the generator of an action if it exists. Is there a known algorithm to ...
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 ...
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$ ...
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 ...
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 ...