2,877 research outputs found
Generalized iterated wreath products of symmetric groups and generalized rooted trees correspondence
Consider the generalized iterated wreath product of symmetric groups. We give a complete description of the traversal
for the generalized iterated wreath product. We also prove an existence of a
bijection between the equivalence classes of ordinary irreducible
representations of the generalized iterated wreath product and orbits of labels
on certain rooted trees. We find a recursion for the number of these labels and
the degrees of irreducible representations of the generalized iterated wreath
product. Finally, we give rough upper bound estimates for fast Fourier
transforms.Comment: 18 pages, to appear in Advances in the Mathematical Sciences. arXiv
admin note: text overlap with arXiv:1409.060
Generalized iterated wreath products of cyclic groups and rooted trees correspondence
Consider the generalized iterated wreath product where . We
prove that the irreducible representations for this class of groups are indexed
by a certain type of rooted trees. This provides a Bratteli diagram for the
generalized iterated wreath product, a simple recursion formula for the number
of irreducible representations, and a strategy to calculate the dimension of
each irreducible representation. We calculate explicitly fast Fourier
transforms (FFT) for this class of groups, giving literature's fastest FFT
upper bound estimate.Comment: 15 pages, to appear in Advances in the Mathematical Science
Automaton semigroup constructions
The aim of this paper is to investigate whether the class of automaton
semigroups is closed under certain semigroup constructions. We prove that the
free product of two automaton semigroups that contain left identities is again
an automaton semigroup. We also show that the class of automaton semigroups is
closed under the combined operation of 'free product followed by adjoining an
identity'. We present an example of a free product of finite semigroups that we
conjecture is not an automaton semigroup. Turning to wreath products, we
consider two slight generalizations of the concept of an automaton semigroup,
and show that a wreath product of an automaton monoid and a finite monoid
arises as a generalized automaton semigroup in both senses. We also suggest a
potential counterexample that would show that a wreath product of an automaton
monoid and a finite monoid is not a necessarily an automaton monoid in the
usual sense.Comment: 13 pages; 2 figure
- β¦