Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Mathematics
More Upper Bounds On The 3-Rewriteability Of Non-3-Rewriteable Groups, Eric Wepsic
More Upper Bounds On The 3-Rewriteability Of Non-3-Rewriteable Groups, Eric Wepsic
Mathematical Sciences Technical Reports (MSTR)
We find an upper bound on the probability that a randomly selected triple in a group is 3-rewriteable, and a bound for the core set rewriteability.
Cyclicizers, Centralizers, And Normalizers, David Patrick, Eric Wepsic
Cyclicizers, Centralizers, And Normalizers, David Patrick, Eric Wepsic
Mathematical Sciences Technical Reports (MSTR)
Our goal is to define the cyclicizer, which is analogous to the centralizer and normalizer, and to examine groups in which these subsets have certain special properties.
An Upper Bound For 3-Rewriteability In Finite Groups, Jordan Ellenberg
An Upper Bound For 3-Rewriteability In Finite Groups, Jordan Ellenberg
Mathematical Sciences Technical Reports (MSTR)
An ordered triple of group elements (x,y,z) is said to be rewriteable if the product xyz is equal to one of the products xzy, yxz, yzx, zxy, zyx. In the present paper, we shall ask the following question: how rewriteable can a finite group be if its derived group has order greater than 2?
Finite Abelian Groups In Which The Probability Of An Automorphism Fixing An Element Is Large, Gary J. Sherman
Finite Abelian Groups In Which The Probability Of An Automorphism Fixing An Element Is Large, Gary J. Sherman
Mathematical Sciences Technical Reports (MSTR)
Let G be a finite group and let A be its automorphism group. We obtain various results on the probability that a random element of A fixes a random element of G.