First time here? Check out the FAQ!
Hi there! Please sign in
help
tags
users
badges
ALL
UNANSWERED
Ask Your Question
Jsevillamol's profile - followed questions
overview
network
karma
followed questions
activity
416
views
1
answer
2
votes
2018-11-18 21:28:57 +0200
Jsevillamol
Computing the basis of the Frobenius function fixed point space
subspace
fixed-points
finite-fields
14k
views
1
answer
2
votes
2018-11-15 20:41:44 +0200
rburing
Solving systems of congruences with Gaussian integers
gaussians
congruence
CRT
263
views
1
answer
2
votes
2018-11-13 19:32:05 +0200
tmonteil
Gaussians as Euclidean Domain
gaussians
euclidean-domain
rings
algebra
3k
views
1
answer
1
vote
2018-11-22 14:26:40 +0200
rburing
Extended Euclidean Algorithm for Univariate Polynomials with Coefficients in a Finite Field
euclidean-domain
gcd
xgcd
finite-field
1k
views
1
answer
1
vote
2018-11-14 14:11:56 +0200
rburing
Implementing the AKS primality test
primality
aks-primality-test
QuotientRing
polynomial
622
views
1
answer
1
vote
2018-11-13 12:12:09 +0200
rburing
1^1 undefined
finite-field
252
views
1
answer
1
vote
2018-11-12 20:21:25 +0200
tmonteil
Error computing the primitive part of a monovariate integer polynomial
univariate_poly
554
views
2
answers
1
vote
2016-10-23 21:25:26 +0200
tmonteil
Basic question about annihilator
linear-algebra
610
views
1
answer
1
vote
2016-10-23 20:58:14 +0200
tmonteil
Canonical way of turning implicit equations into a subspace and vice versa
linear-algebra
7
views
no
answers
no
votes
2018-11-26 19:18:43 +0200
Jsevillamol
Find representative of a polynomial with coefficients in Z mod p with minimal max-norm [deleted]
modular_polynomials
« previous
1
...
1
2
...
2
next »
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a
Creative Commons Attribution Share Alike 3.0
license.
Powered by Askbot version 0.7.59
Please note: Askbot requires javascript to work properly, please enable javascript in your browser,
here is how
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
