All Questions
Tagged with ac.commutative-algebra computer-algebra
66 questions
28
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 i\in[n]:f_{i}(a)=a_{i}$....
- 583
21
votes
5
answers
6k
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 ...
- 1,256
16
votes
2
answers
721
views
From polynomial ideal over $\mathbb{Q}$ to polynomial ideal over $\mathbb{Z}$
Is there an algorithm to compute, given a polynomial ideal $I\subset \mathbb{Q}[x_1,\dotsc,x_n]$, the ideal $I\cap \mathbb{Z}[x_1,\dotsc,x_n]$ in $\mathbb{Z}[x_1,\dotsc,x_n]$?
The input and output ...
- 7,836
15
votes
4
answers
6k
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 ...
- 1,528
13
votes
1
answer
908
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 ...
user631
12
votes
2
answers
588
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 ...
- 4,902
11
votes
1
answer
475
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]...
- 63.1k
10
votes
5
answers
632
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 ...
- 44.7k
8
votes
2
answers
592
views
Solving the field membership problem using Grobner bases
Is there an easy way to determine whether a set of elements in a field generates the whole field or only a subfield?
Specifically, I have a subfield of $k(x,y)$ described in terms of a canonical set ...
- 851
8
votes
1
answer
1k
views
Software for computing multi-graded Hilbert series
The ring of invariants $S^T$ of $k[a,b,c,d]$ under the algebraic torus action $T = k^{*}$ with weights $(1,1,-1,-1)$
is $S = k[ac,ad,bc,bd]$ which has multigraded Hilbert series
$$
\frac{1 - abcd}{(1-...
- 1,298
8
votes
1
answer
742
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, ...
- 7,328
7
votes
0
answers
181
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 ...
- 26.5k
7
votes
0
answers
329
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 ...
- 71
6
votes
1
answer
269
views
Algebraization of Bayesian networks?
The algebraization of classical propositional logic is Boolean algebra.
Bayesian networks are a generalization of classical propositional logic with probability truth-values.
What is the ...
- 558
6
votes
3
answers
1k
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 ...
- 16k
6
votes
1
answer
530
views
Does a variety contain a cartesian product of two curves?
We are given an affine variety $V\subset \mathbb{A}^n\times\mathbb{A}^n$, and wish to know if it contains a product of the form $C_1\times C_2$, where $C_1$ and $C_2$ are two curves in $\mathbb{A}^n$. ...
- 7,836
6
votes
1
answer
148
views
Software for computing equivariants
If $\Gamma$ is a finite group with action on two vector spaces $\mathbb R^n$ and $\mathbb R^m$ denoted by $\gamma_n$ and $\gamma_m$ respectively, the fundamental equivariants are the polynomials $f: \...
- 225
6
votes
0
answers
293
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 ...
- 1,308
5
votes
2
answers
3k
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$ ...
- 51
5
votes
1
answer
1k
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 ...
- 1,961
5
votes
1
answer
557
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,399
5
votes
1
answer
499
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,846
5
votes
1
answer
255
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 ...
- 211
5
votes
0
answers
126
views
Koszul algebras among finite dimensional commutative algebras
Given a local commutative artinian algebra $A$ of the form $K[x_1,...,x_n]/I$ with quadratic ideal $I$ and $K$ a field.
Question 1: Is there a computer algebra system that can check whether such an ...
- 26.5k
5
votes
0
answers
107
views
Size of minimal generating set of ideal over Laurent polynomial ring
Recently in attacking a problem in algebraic topology relating to the construction of stably-free non-free modules over integral group rings I’ve noticed that it is often fairly easy to reduce to ...
- 187
5
votes
0
answers
2k
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)= \{...
- 6,018
5
votes
0
answers
220
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 ...
- 51
4
votes
1
answer
334
views
GCD in $\mathbb{F}_3[T]$ with powers of linear polynomials
This is a continuation of my previous question on $\gcd$s of polynomials of type $f^n - f$.
Let us call $n > 1$ simple at a prime $p$ when $p-1 \mid n-1$ but $p^k - 1 \not\mid n-1$ for all $k > ...
- 63.1k
4
votes
2
answers
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 ...
- 139
4
votes
2
answers
1k
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 ...
- 3,555
4
votes
1
answer
273
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 ...
- 13.9k
4
votes
0
answers
104
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 ...
- 2,788
4
votes
0
answers
98
views
Compute equalizer of maps of polynomial rings, perhaps using Gröbner bases
Suppose that $k$ is a field and I have two ring homomorphisms
$$
\phi, \psi :k[x_1,...,x_m] \to k[y_1,...,y_n].
$$
How can I use Gröbner bases (or other computational tools) to compute the subring of ...
- 4,254
4
votes
0
answers
312
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 ...
- 768
3
votes
1
answer
539
views
Generalized Newton Identities
I learnt a lot of new words (Hall-Littlewood, Jack and Macdonald polynomials) but unfortunately everything I dug up is written without a single example and I still don't know the answer to a very ...
- 4,829
3
votes
1
answer
238
views
Number of rings with additive group $(\mathbb{Z}_{16})^2$. A341547(16) in OEIS
I would like to know if somewhere the number of non-isomorphic rings with additive group $(\mathbb{Z}_{16})^2$ is mentioned. If not, is someone able to calculate it?
And (easier) the commutative case? ...
3
votes
1
answer
463
views
Decomposition of modules using computer packages
I am interested in computing direct sum decomposition of modules over some quotients of polynomial rings over a field (do not care much about the field at this point). Does any one know a package ...
- 30.5k
3
votes
0
answers
120
views
Checking the generic rank of a matrix
Suppose that $A,B\in M_{p,q}(\mathbb{Z})$ are two rectangular integer matrices of the same size. Suppose that one has a conjecture stating that the rank of the matrix $A+tB$ for Zariski generic values ...
- 16.9k
3
votes
0
answers
68
views
Finding generators and relations for special commutative algebras with a computer
Let $K[x_1,...,x_n]$ be the polynomial ring in $n$ variables and $a_1,...,a_m$ elements in the quotient field $K(x_1,...,x_n)$.
Let $A:=K[a_1,...,a_m]$ the ring generated by the $a_i$ in $K(x_1,...,...
- 26.5k
2
votes
1
answer
191
views
programming to compute kernel quotient image of a $\mathbb{Z}$-module endomorphism
Let the integers $n\geq 2$, $k\geq 1$, $v=0$ or $1$ and $n_1,\cdots,n_k\geq 1$ such that
$$
\sum_{i=1}^k n_i+v=n.
$$
Define $P_a^b=0$ if both $a,b$ are odd and $P_a^b={{[a/2]}\choose {[(a+b)/2]}}$ ...
- 1,990
2
votes
1
answer
668
views
Efficiently computing Gröbner basis to prove no solution to polynomial constraints
In a similar vein to these now quite old questions on advice for calculating a Gröbner basis:
Fast computation of a Groebner basis. What is possible?
What is the state of art in Groebner bases
I am ...
- 21
2
votes
1
answer
202
views
How to compute cup product of derived limits / presheaf cohomology
I have a finite category $\mathcal{C}$, along with a functor $F \colon \mathcal{C}^{\mathrm{op}} \to \mathsf{GradedCommRings}$. If $F_j$ is $j$-th graded piece of $F$, then I write $H^i(\mathcal{C},...
- 317
2
votes
2
answers
411
views
Computer algebra system that test zero divisors in a quotient algebra
I have an algebra $A$ over a Noetherian ring and an ideal $I=(x,y)$, where $x,y \in A$. I need to examine whether a polynomial $h \in A$ is a zero divisor in $A/I$ or not.
Is there a computer algebra ...
- 21
2
votes
0
answers
130
views
How to find a single-variable polynomial in a zero-dimensional ideal?
Given finitely many multivariate polynomials with algebraic coefficients that generate a zero-dimensional ideal, is there an easy way to find a nonzero single-variable polynomial in this ideal?
If we ...
- 7,633
2
votes
0
answers
188
views
Help with Macaulay2 computation of invariant ring
Consider the algebraic group $G:=\operatorname{SL}_{2}\times\operatorname{SL}_{2}$ acting on $V:=\operatorname{Mat}_{2\times 2}\oplus\operatorname{Mat}_{2\times 2}$ via the action $(A,B)\,\cdot\,(X,Y)=...
- 839
2
votes
0
answers
113
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....
- 980
2
votes
0
answers
61
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 ...
- 297
2
votes
0
answers
179
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 ...
- 529
1
vote
2
answers
232
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 : ...
- 13
1
vote
1
answer
160
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 ...
- 13.9k