Back to Forum | View unanswered posts | View active topics
 
|
Page 1 of 1
|
[ 1 post ] |
|
| Author |
Message |
|
reducible
|
Post subject: is reducible the necessary condition for finding an ideal?  Posted: Sun Jun 26, 2016 8:36 am |
|
|
|
|
i use combination to choose a number of terms added all in a list of terms in invariant ring
to see whether it is able to factor, if it can be factored then print it
is reducible or spit field the necessary condition before finding an ideal?
if there is N * N permutation matrix from finite group , is choosing N+1 that is the correct number of terms to be factorized?
|
|
| Top |
|
 |
|
|
Page 1 of 1
|
[ 1 post ] |
|
|
You can post new topics in this forum
You can reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot post attachments in this forum
|
|
It is currently Fri May 13, 2022 10:54 am
|
Login
Register
Forum FAQ
Forum Search
