# Tagged Questions

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

45 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 ...
137 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 ...
98 views

### Checking smoothness of complex schemes by reduction to characteristic prime

Let $X=V(F_1,\ldots,F_n)$ be a closed subscheme of the complex projective space $\mathbb{P}^N_{\mathbb{C}}$ defined by homogeneous polynomials $F_i\in\mathbb{Z}[x_0,\ldots,x_N]$ with integer ...
162 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 ...
105 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 ...
273 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 ...
140 views

### Understanding a program for computing Khovanov homology

I would like to understand how a computer program for computing Khovanov homology works. The particular program I have in mind is by John Baldwin: https://web.math.princeton.edu/~baldwinj/Kh.cpp The ...
76 views

### Algorithm for Polynomial Reduction in a Quotient Ring

Any reference or suggestion for the following problem would be greatly appreciated. I am working on the quotient ring $Q=R[X_1,\dots,X_n]/<f_1,\dots,f_k>$. Given polynomials $p$ and $q$ I want ...
162 views

### AI / Machine Learning related to high/modern/front mathematics [closed]

I major math and cs. and i'm interested in ai/machine learning/data mining. so i want to know what math subjects are used in frontier of these technology. especially, high mathematical tool, like ...
111 views

### Calogero-Moser eigenfunction

The folllowing function J(t_1,t_2,t_3,m,h)=[(1-e^{t_1-t_2})(1-e^{t_2-t_3})(1-e^{t_1-t_3})]^{-m/h} ...
90 views

245 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 ...
220 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 ...
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 ...
365 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 ...
206 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 ...
147 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?
124 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 \\\\ ...
186 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 : ...
537 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 ...
296 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 ...
466 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 ...
137 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 ...
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 ...
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 ...