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-25 23:33:20 -0500
last seen
2016-03-29 11:19:14 -0500
todays unused votes
30
votes left
8
Questions
170
views
1
answer
2
votes
2014-10-08 10:01:15 -0500
tmonteil
Polynomial decomposition
symbolic
3k
views
no
answers
2
votes
2012-12-29 02:50:33 -0500
Jernej
Stackexchange
soft-question
1k
views
2
answers
1
vote
2012-06-26 05:42:16 -0500
fidbc
Iterating over all non isomorphic connected graphs of given order
graph
graph_theory
graphs
database
105
views
1
answer
1
vote
2016-03-20 17:23:42 -0500
tmonteil
Performing substitutions on powers of a variable
symbolic
monomials
157
views
no
answers
no
votes
2014-01-03 03:24:52 -0500
Jernej
Testing if a group has a subgroup acting regularly
group_theory
gap
permutation_group
219
views
1
answer
no
votes
2016-03-20 09:02:41 -0500
B r u n o
Correct way to compute the modulus of a polynomial
symbolic
monomials
222
views
1
answer
no
votes
2013-10-30 06:35:16 -0500
Nathann
Drawing a graph - fixing its layout
graph-theory
drawings
graphics
545
views
no
answers
no
votes
2012-12-29 02:44:09 -0500
Jernej
A faster way to obtain orbits of a partition of the verrtex set
graph-theory
permutation_group
gap
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
●
Editor
×
1
Testing if a group has a subgroup acting regularly
●
Famous Question
×
3
Stackexchange
Iterating over all non isomorphic connected graphs of given order
A faster way to obtain orbits of a partition of the verrtex set
●
Scholar
×
1
Iterating over all non isomorphic connected graphs of given order
●
Student
×
1
Stackexchange
●
Popular Question
×
4
Stackexchange
Iterating over all non isomorphic connected graphs of given order
A faster way to obtain orbits of a partition of the verrtex set
Drawing a graph - fixing its layout
●
Supporter
×
1
Iterating over all non isomorphic connected graphs of given order
●
Notable Question
×
3
Iterating over all non isomorphic connected graphs of given order
Stackexchange
A faster way to obtain orbits of a partition of the verrtex set
●
Nice Question
×
2
Polynomial decomposition
Stackexchange
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.56
Please note: Askbot requires javascript to work properly, please enable javascript in your browser,
here is how