1 reputation
2
bio website
location
age
visits member for 3 years, 9 months
seen Jun 4 '13 at 22:24

Jun
4
comment Transformation terminology question
Interesting. They use the term directed power graph instead of directed monogenic inclusion graph. Thanks for the cites!
May
15
comment Transformation terminology question
Yep, index and period seem to be standard: en.wikipedia.org/wiki/Monogenic_semigroup
May
15
awarded  Scholar
May
15
accepted Transformation terminology question
May
15
comment Transformation terminology question
Ben, you seem like just the person to ask a related question I posted on CSTheory: cstheory.stackexchange.com/questions/17326/name-this-digraph
May
15
comment Transformation terminology question
s= [3, 3, 1, 0], s^2= [0, 0, 3, 3], s^3=[3, 3, 0, 0], s^4=[0, 0, 3, 3], ... The stem is [3, 3, 1, 0], the next two form the a cycle with period two. So "nilpotent" for [3, 3, 1, 0], and "maximal subgroup/minimal ideal" for {[0, 0, 3, 3], [3, 3, 0, 0]}? Hmm. I'll try to track down a copy of Higgins.
May
15
asked Transformation terminology question
May
15
comment Is there a name for this graph?
A quasi-related digraph I am also looking for a reference to in the literature: cstheory.stackexchange.com/questions/17326/name-this-digraph Inclusion digraphs are extremely helpful in a lot of domains when it comes to software testing. You just have to test a minimum dominating set instead of the entire graph.
Nov
29
answered maximal subgroups of finite simple groups
Nov
29
answered Abstract characterization of polygonizations
Jul
8
awarded  Teacher
Jul
6
answered Finding the union of N random circles arbitrarily (or conspiratorially) placed on a two-dimensional surface