First time here? Check out the FAQ!
Hi there! Please sign in
help
tags
users
badges
ALL
UNANSWERED
Ask Your Question
Jernej's profile - overview
overview
network
karma
followed questions
activity
67
karma
follow
Registered User
member since
2012-06-26 06:33:20 +0100
last seen
2016-03-29 18:19:14 +0100
todays unused votes
30
votes left
8
Questions
6k
views
no
answers
2
votes
2012-12-29 09:50:33 +0100
Jernej
Stackexchange
soft-question
604
views
1
answer
2
votes
2014-10-08 17:01:15 +0100
tmonteil
Polynomial decomposition
symbolic
387
views
1
answer
1
vote
2016-03-20 23:23:42 +0100
tmonteil
Performing substitutions on powers of a variable
symbolic
monomials
3k
views
2
answers
1
vote
2012-06-26 12:42:16 +0100
fidbc
Iterating over all non isomorphic connected graphs of given order
graph
graph_theory
graphs
database
471
views
1
answer
no
votes
2016-03-20 15:02:41 +0100
B r u n o
Correct way to compute the modulus of a polynomial
symbolic
monomials
348
views
no
answers
no
votes
2014-01-03 10:24:52 +0100
Jernej
Testing if a group has a subgroup acting regularly
group_theory
gap
permutation_group
751
views
no
answers
no
votes
2012-12-29 09:44:09 +0100
Jernej
A faster way to obtain orbits of a partition of the verrtex set
graph-theory
permutation_group
gap
559
views
1
answer
no
votes
2013-10-30 12:35:16 +0100
Nathann
Drawing a graph - fixing its layout
graph-theory
drawings
graphics
0
Answers
5
Votes
5
0
13
Tags
symbolic
× 5
monomials
× 4
database
× 3
graph
× 3
graphs
× 3
graph_theory
× 3
gap
× 2
permutation_group
× 2
soft-question
× 2
graph-theory
× 2
graphics
× 1
group_theory
× 1
drawings
× 1
8
Badges
●
Supporter
×
1
Iterating over all non isomorphic connected graphs of given order
●
Scholar
×
1
Iterating over all non isomorphic connected graphs of given order
●
Editor
×
1
Testing if a group has a subgroup acting regularly
●
Student
×
1
Stackexchange
●
Nice Question
×
2
Stackexchange
Polynomial decomposition
●
Popular Question
×
6
Drawing a graph - fixing its layout
Stackexchange
Iterating over all non isomorphic connected graphs of given order
A faster way to obtain orbits of a partition of the verrtex set
Performing substitutions on powers of a variable
Polynomial decomposition
●
Famous Question
×
4
A faster way to obtain orbits of a partition of the verrtex set
Stackexchange
Iterating over all non isomorphic connected graphs of given order
Polynomial decomposition
●
Notable Question
×
4
A faster way to obtain orbits of a partition of the verrtex set
Iterating over all non isomorphic connected graphs of given order
Stackexchange
Polynomial decomposition
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