Algebra Commons^™

Square Roots Of Finite Groups - Ii, Matthew Devos, David Mcadams, Rebecca Rapoport

Mathematical Sciences Technical Reports (MSTR)

A subset R of a finite group G is a square root of G if R² = G. If R is a square root of G for which |R|² = G, then R is referred to as a perfect square root of G. It can be shown using character theory that perfect square roots do not exist. The purpose of this paper is to work toward an elementary proof of this result.

Square Roots Of Finite Groups, Kashi Abhyankar, Daniel Grossman

Mathematical Sciences Technical Reports (MSTR)

Let G be a finite group of order n². A perfect square root of G is a subset X of G such that |X| = n and X² = G. Neither generalized dihedral groups nor groups of nilpotency class two have perfect square roots.

Finite Groups Can Be Arbitrarily Hamiltonian, Stephen Ahearn, Mark Huber

Mathematical Sciences Technical Reports (MSTR)

Let r be a rational in (0,1]. There exists a finite group G which is the direct product of at most four metacyclic groups and whose proportion of normal subgroups is r. An analogous result holds for three other measures of "Hamiltonianess".

Counting Order Classes Of Triple Products In Finite Groups, Scott Annin, Jennifer Ziebarth

Mathematical Sciences Technical Reports (MSTR)

Let G be a finite group and let W_G denote the proportion of triples, (.x:, y , z) , i n G3 for which x yz , x zy, y x z, zx y , yzx , and z y x have the same order. The following results are established.

i) G is abelian if, and only if, W_G = 1.

ii) W_G can be arbitrarily close to 1.

iii) Additional estimates on W_G

Bounds On Squares Of Two-Sets, Dan Slilaty, Jeff Vanderkam

Mathematical Sciences Technical Reports (MSTR)

For a finite group G, let p_i(G) denote the proportion of (x,y) in GxG for which the set {x²,xy,yx,y²} has cardinality i. In this paper we develop estimates on the p_i(G) for various i.

Hypergraph Representations And Orders Of Cwatsets, Julie Kerr

Mathematical Sciences Technical Reports (MSTR)

We determine upper bounds on the order of cwatsets of odd order.

When Is The Number Of P-Subgroups Of A Group Satisfying A Property Congruent To 1 (Mod P)?, Jason Fulman, Jeff Vanderkam

Mathematical Sciences Technical Reports (MSTR)

Let T be a property which holds for a group independent of whether or not this group is embedded in a group G or in a p-Sylow subgroup of G. Using a generalization of Sylow's second Theorem, we prove that if for any p-group P the number of subgroups of P satisfying T is congruent to 1 (mod p), then for any group G, the number of p-subgroups satisfying T is also congruent to 1 (mod p). As an application, we give simple proofs of several theorems, including the well-known Frobenius theorem.

Divisibility By |G| For Powers Of Ordered K-Sets, Jeffery Vanderkam

Mathematical Sciences Technical Reports (MSTR)

It is shown that the number of ordered k-sets of a group G whose nth power contains exactly i elements is always a multiple of IGI. An elementary proof of the fact that the number of ordered pairs ( x , y ) such that x² = y² is equal to k_r lGI is also given.

Cubing Ordered 2-Sets, Jeffery Vanderkam

Mathematical Sciences Technical Reports (MSTR)

Given a group G, we define p_i as the probability that, given an ordered pair X = (x,y), there are exactly i elements in X³ = {x₁x₂x₃ l x_i in X}. We show that P₂( G) = 0 if, and only if, IGI is odd, and that p₃(G) = 0 if, and only if, IGI is not divisible by three. The groups for which p₄ ( G) = 0 and p₅ ( G) = 0 are also determined.

Counting Nilpotent Pairs, Jason Fulman, Michael Galloy, Jeffery Vanderkam

Mathematical Sciences Technical Reports (MSTR)

In this paper , we consider the probability that two elements chosen at random from a finite group G generate a subgroup of a given nilpotency class. It is shown that in solvable non­-nilpotent groups, the probability that two elements generate a nilpotent subgroup is <= l/p,, where p, is the smallest prime dividing the order of the group, and it is also shown that there exist groups such that the probability of two elements generating a subgroup of class i approaches one (and other groups for which it approaches zero) for all i =>2. It is also shown …

The 2/3 Bound For Rewritable N-Tuples, Lawren Smithline, Catherine Sugar

Mathematical Sciences Technical Reports (MSTR)

We study the number of rewritings of an n-tuple in a finite a group, for certain classes of groups.

Some Upper Bounds For Commutativity And Cyclicity Measures In Finite Groups, David Patrick, Catherine Sugar, Eric Wepsic

Mathematical Sciences Technical Reports (MSTR)

The number of commuting and cyclic n-tuples in a group are enumerated for certain classes of groups.

Counting Nilpotent Pairs In Finite Groups: Some Conjectures, H Dubose-Schmidt, Michael D. Galloy, D,L, Wilson

Mathematical Sciences Technical Reports (MSTR)

The number of nilpotent pairs is determined for a number of small groups.

Some Facts About Cycels And Tidy Groups, Kevin O'Bryant, D. Patrick, Lawren Smithline, Eric Wepsic

Mathematical Sciences Technical Reports (MSTR)

No abstract provided.

A4 Rewriteability, Eric Wepsic, Kevin O'Bryant, Lawren Smithline

Mathematical Sciences Technical Reports (MSTR)

The concept of 4-rewriteability with permutation coming form the alternating group A₄ is explored.

Rewriteability, Commutators, And Fundamental N-Rewritings, Lawren Smithline

Mathematical Sciences Technical Reports (MSTR)

We consider the relationship between commutators and rewriteability.

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

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.

Counting Centralizers In Finite Groups, Sarah Marie Belcastro, Gary J. Sherman

Mathematical Sciences Technical Reports (MSTR)

We discuss various results on the number of commuting pairs and the sizes of the centralizers of a group.

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

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.

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

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 Z₂. 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

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

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

Mathematical Sciences Technical Reports (MSTR)

No abstract provided.

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

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.