Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 7 of 7
Full-Text Articles in Algebra
Dihedral Rewriteability, Cheryl P. Grood
Dihedral Rewriteability, Cheryl P. Grood
Mathematical Sciences Technical Reports (MSTR)
In this paper we compute the probability that an n-tuple for a group G is S-rewritable for a given set S of permutations for several classes of groups.
Some Facts About Cwat-Sets, Martin Wattenburg
Some Facts About Cwat-Sets, Martin Wattenburg
Mathematical Sciences Technical Reports (MSTR)
In [1] and [2], Sherman and Atkins, in connection with a problem in statistics, introduced a generalization of the concept of a subgroup of Z2. These generalized subgroups, which we call CWAT-sets (where "CWAT" is an acronym for "Closed With A Twist" ), have a rich algebraic structure. In this paper we establish some simple combinatorial facts about CWAT-sets, as well as provide two construction methods, prove a divisibility theorem, and make a classification conjecture.
A Numerical Approach To Rewriteability In Finite Groups, J.L. Leavitt, G.J. Sherman, M.E. Walker
A Numerical Approach To Rewriteability In Finite Groups, J.L. Leavitt, G.J. Sherman, M.E. Walker
Mathematical Sciences Technical Reports (MSTR)
In this paper we compute the probability that an n-tuple for a group G is S-rewritable for a given set S of permutations for several classes of groups.
Maximal Order Three-Rewriteable Subgroups Of Symmetric Groups, John T. O'Bryan
Maximal Order Three-Rewriteable Subgroups Of Symmetric Groups, John T. O'Bryan
Mathematical Sciences Technical Reports (MSTR)
Recently, Burns and Goldsmith [2] characterized the maximal order Abelian subgroups of the symmetric groups using elementary techniques and the results of Hoffman [5]. This classification could also be directly inferred from the results of Kovacs and Praeger [7]. A natural extension would be to consider the weaker, more general form of commutativity, three-rewriteability. The purpose of this paper is to completely characterize the maximal order three-rewriteable subgroups of the symmetric groups.
How Hamiltonian Can A Finite Group Be?, G.J. Sherman, T.J. Tucker, M.E. Walker
How Hamiltonian Can A Finite Group Be?, G.J. Sherman, T.J. Tucker, M.E. Walker
Mathematical Sciences Technical Reports (MSTR)
No abstract provided.
Fibonacci Sequences In Finite Groups, Steven W. Knox
Fibonacci Sequences In Finite Groups, Steven W. Knox
Mathematical Sciences Technical Reports (MSTR)
This paper extend the notion of Fibonacci sequence mod m to Fibonacci sequences in finite groups.
Sets Of Typical Subsamples, Joel Atkins, G.J Sherman
Sets Of Typical Subsamples, Joel Atkins, G.J Sherman
Mathematical Sciences Technical Reports (MSTR)
A group theoretic condition on a set of subsamples of a random sample from a continuous random variable symmetric about 0 is shown to be sufficient to provide typical values for 0.