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
4 votes
0 answers
414 views

Computing the volume of intersection between a ball and a box

$C$ is the set of vectors which are coordinate-wise less than $\overline{c}\in [-1,1]^d$ and greater than $\underline{c}\in [-1,1]^d.$ Is there a procedure not exponentially complex in $d$ that ...
Christian Chapman's user avatar
4 votes
0 answers
203 views

Finding Rational Curves on a Surface

Let the field of rational numbers be our base field $k$. I hope to find all rational curves on the following surface $S$ defined by $f$. You can find the motivation in the end. $f= (x^2y^2)z^3 + (5x^...
Jiarui Fei's user avatar
4 votes
0 answers
199 views

Computing Tamagawa numbers for jacobians of hyperelliptic curves

Do exist some computational approach to calculation of Tamagawa number for the jacobian of hyperelliptic curve at prime $p$? As followed from this question one can compute $\Phi(\overline{\mathbb F}...
Maxim's user avatar
  • 414
4 votes
0 answers
311 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 ...
Jared's user avatar
  • 768
4 votes
0 answers
214 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 ...
a guest's user avatar
  • 41
4 votes
0 answers
245 views

Algorithm/denominators of elements of a rational affine space

I hope it's not a trivial question... Suppose I have a finite dimensional vector space $V$ over $\mathbb{Q}$ with a distinguished basis (in my case it's the $k$th graded piece of the free associative ...
Adrien's user avatar
  • 8,244
4 votes
1 answer
317 views

Higher roots modulo prime complexity best algorithm

Given integers $a,\ell$ and prime $p$ we need to find the roots of the algebraic equation $x^\ell\equiv a\bmod p$. We know there are at most $\ell$ such $x$. What is the best method to find all such ...
Amal Duriseti's user avatar
3 votes
2 answers
2k views

Computer program to solve a system of polynomial equations over a finite field

I have a set of polynomial equations for which I want to know the solutions (actually really the number of solutions). It would be great if I could get a computer to do it, but I'm not sure exactly ...
Daniel Moseley's user avatar
3 votes
2 answers
187 views

What can be said about the cube-free part of $x^3 -3xy^2 +y^3$?

For $x$ and $y$ in $\mathbf{Z}$, not both zero, let $cfp(x,y)$ be the cube-free part of $x^3 -3xy^2 + y^3$ (normalized to be $> 0$). One sees: (#) $cfp(x,y)$ is either a product of primes $p$, with ...
paul Monsky's user avatar
  • 5,412
3 votes
1 answer
293 views

The associated graded algebra of a finite dimensional algebra

$\DeclareMathOperator\rad{rad}$Let $A$ be a finite dimensional algebra (we can assume that $A \cong KQ/I$, for a quiver $Q$ and an admissible ideal $I$ if that helps). Denote by $A_G$ the associated ...
Mare's user avatar
  • 26k
3 votes
1 answer
515 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 ...
Hauke Reddmann's user avatar
3 votes
1 answer
275 views

Siegel modular forms in Mathematica

Is there a convenient way to work with Siegel modular forms in Mathematica? I am interested in doing analytic computations using the $\chi_{10}(\Omega)$ Siegel modular form, where $\Omega$ is the $2\...
Holomaniac's user avatar
3 votes
2 answers
238 views

Finding the "Q-span" of vectors in Q(q)

Apologies if this question is quite basic. Consider the $\mathbb{Q}(q)$-vector space $V = \mathbb{Q}(q)^n$ with standard ordered basis $\{e_1,\ldots,e_n\}$. Suppose someone hands you some vectors $v_1,...
Sam Hopkins's user avatar
  • 22.9k
3 votes
2 answers
349 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 ...
Mikhail Golubiatnikov's user avatar
3 votes
1 answer
324 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 ...
VS.'s user avatar
  • 1,816
3 votes
4 answers
822 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 \...
Paul B. Slater's user avatar
3 votes
2 answers
443 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) ...
Kowalski's user avatar
3 votes
1 answer
237 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? ...
José María Grau Ribas's user avatar
3 votes
1 answer
436 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 ...
Vepir's user avatar
  • 591
3 votes
2 answers
354 views

Alternate descriptions of finite fields

The finite field of order $p^n$ is isomorphic to $(\mathbb Z/p \mathbb Z)[X]/(P)$, where $P$ is an irreducible polynomial in $(\mathbb Z/p \mathbb Z)[X]$ of degree $n$. This describes every finite ...
Christopher King's user avatar
3 votes
1 answer
233 views

Finding all selforthogonal indecomposable modules

Given a finite dimensional algebra $A$ with finite global dimension such that there are only finitely many basic tilting modules. Then every selforthogonal indecomposable module $M$ (that is a module ...
Mare's user avatar
  • 26k
3 votes
3 answers
343 views

Computational solutions to families of systems of linear equations

Question Does there exist a computer package that will solve families of systems of linear equations over a field of prime characteristic? An Example Suppose I wanted to know when the following ...
Sinead Lyle's user avatar
3 votes
1 answer
1k views

Adjoint/transpose of wavelet transform

I'm using a wavelet transform in Matlab, so I think of it as a black-box. I'll represent it here as $W(x)$. There's a reconstruction function as well, which I'll write as $W^\dagger(y)$. I can ...
Stephen's user avatar
  • 170
3 votes
1 answer
458 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 ...
Hailong Dao's user avatar
  • 30.3k
3 votes
1 answer
462 views

Computing conjugacy between two elements of $\mathrm{SL}_2(\mathbb{Z})$

The conjugacy classes of $\mathrm{SL}_2(\mathbb{Z})$ are well characterized (see, e.g., this question). Assuming two matrices $A, B \in \mathrm{SL}_2(\mathbb{Z})$ are conjugate, is there a way to ...
Alex's user avatar
  • 39
3 votes
1 answer
143 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 ...
user avatar
3 votes
1 answer
239 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]^...
BPN's user avatar
  • 543
3 votes
1 answer
234 views

Explicit endomorphisms of Jacobians of genus $2$ and the Theta divisor

I hope this question is good to be here. Let $J$ be the Jacobian of a hyperelliptic curve $H$ of genus $2$ given by $y^2 = x^5 + h$. I was calculating an explicit formula in Mumford coordinates of $[...
Eduardo R. Duarte's user avatar
3 votes
1 answer
1k 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 ...
user34079's user avatar
3 votes
0 answers
87 views

Isomorphism and counting for tree quivers

Let $Q$ be a quiver which is a connected tree and let $A=KQ/I$ be a quiver algebra with $I$ an admissible ideal, meaning that $I$ is generated by paths of length $\geq 2$. Let $n$ be the number of ...
Mare's user avatar
  • 26k
3 votes
0 answers
99 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 ...
Vladimir Dotsenko's user avatar
3 votes
0 answers
107 views

Finite global dimension via the Cartan determinant

Let $A=T(KQ)$ be the trivial extension algebra of a path algebra of Dynkin type $KQ$. The indecomposable module of $A$ correspond to the roots of $Q$ (and not just the positive roots as for $KQ$). Let ...
Mare's user avatar
  • 26k
3 votes
0 answers
65 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,...,...
Mare's user avatar
  • 26k
3 votes
0 answers
178 views

Enumeration of stable graphs of genus $g$

Let $G=(V,E)$ be a connected undirected finite graph, let us call $G$ stable if each vertex has degree at least $3$. Is there a computer algorithm to efficiently enumerate (repetition allowed) all ...
user avatar
3 votes
0 answers
148 views

For which $n$ is this ring an euclidean domain?

Let $f_n(x)=x^n-\sum\limits_{i=0}^{n-1}{x^i}$ and $A_n$ the number field corresponding to $f_n$. Question: Is $A_n$ for all $n$ an euclidean domain? Is there a good choice for an euclidean function? ...
Mare's user avatar
  • 26k
3 votes
0 answers
96 views

Deterministic procedure to find irreducible polynomials

In $\Bbb F_q[x_1,\dots,x_n]$ given $d_1,\dots,d_n\in\Bbb N$ is there a deterministic $O(poly(nd\log q))$ algorithm to find an irreducible polynomial with $d=\max_{i\in\{1,\dots,n\}}d_i$ and $d_i=deg(...
Turbo's user avatar
  • 13.7k
3 votes
0 answers
103 views

Can one do better than using general purpose determinant algorithms when using the Fisher-Kasteleyn-Temperley method for perfect matchings?

Questions. (numerical.generalPfaffian) Is it proved anywhere that in general it is not easier0 to calculate the determinant (over $\mathbb{Q}$) of the skew-symmetric signed adjacency matrix defined ...
Peter Heinig's user avatar
  • 6,001
3 votes
0 answers
163 views

Explicit roots in algebraic extention of Q with roots

Denis Bouhineau in "Solving Geometrical Constraint System Using CLP Based on Linear Constraint Solver" gave a method to find explicit square root in algebraic extention of Q with square roots. For ...
George Cherevichenko's user avatar
3 votes
0 answers
353 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 ...
arsmath's user avatar
  • 6,720
3 votes
0 answers
338 views

Rank of Subgroup of Elliptic Curve

I'm currently looking at two rational points $ p, q $ on an elliptic curve $E$ over $ \mathbb{Q} $. SAGE tells me that $E$ has rank 5 and no torsion, and that $p$ and $q$ both have infinite order. ...
user4192's user avatar
  • 309
2 votes
4 answers
3k views

Symmetrical Presentation of 4-Dimensional Rotation Matrix

This question is not urgent; just a matter of curiosity... It is relatively easy to generate an arbitrary 3D or even 4D rotation matrix using conjugation (i.e. YXY−1) of orthogonal rotations. I ...
Rhubbarb's user avatar
  • 524
2 votes
1 answer
540 views

A question on a Macaulay2 computation

I have an ideal $I$ generated by quadratic and cubic homogeneous polynomials in $10$ variables. Macaulay2 tells me that $I$ defines an irreducible variety $X$ of dimension $5$ and degree $10$ in $\...
user avatar
2 votes
2 answers
368 views

Computer algebra for calculating curvature when the tensor metric is very big

Is there a computer algebra method to compute the curvature of a Riemannian metric on the plane when the metric tensor has long entries $E,F,G$ The computation by hand is very ...
Ali Taghavi's user avatar
2 votes
3 answers
553 views

CAS for finding closed form solutions to PDEs and SDEs?

Are there any specialized Computer Algebra Systems (or packages for these) for finding closed form solutions to a) partial differential equations, b) stochastic differential equations? If yes, what ...
vonjd's user avatar
  • 5,875
2 votes
3 answers
521 views

Useful software for variable elimination

I have three non-homogeneous trivariate polynomials in $\mathbb Z[x,y,z]$ and I want to eliminate the variables $y$ and $z$ to get a polynomial in $x$. The monomials of the polynomials are $\{1,x^4,x^...
Turbo's user avatar
  • 13.7k
2 votes
1 answer
411 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 (...
Noam Zeilberger's user avatar
2 votes
1 answer
173 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 ...
Ievgeni's user avatar
  • 215
2 votes
1 answer
129 views

What is a good program for matrix groups computations?

I need a computer program, to help me with some very basic group computations. Specifically, I want to know if some group generated by a few small matrices over a finite field is solvable. Is there a ...
Doron Shafrir's user avatar
2 votes
1 answer
250 views

Irreducibility of an explicit complex projective variety

Let $Y\subset \mathbb P^n_\mathbb C$ be a subvariety defined by a series of homogeneous polynomials $f_1, \ldots, f_t$. Is there an effective way to determine the irreducibility of $Y$ as an algebraic ...
Pène Papin's user avatar
2 votes
1 answer
172 views

Software for $S$-unit equation

Is there any implementation available of an algorithm which solves in full generality the $S$-unit equation $x+y=1$ in a number field? It seems that Magma solves $ax+by=c$ but only in the algebraic ...
Ferra's user avatar
  • 509

1
4
5
6 7 8