Tell me what you can about a group of order n Mike Krebs, Cal State LA This talk will (soon) be available by following the link for “Research and Talks”

Slides:

Advertisements

Similar presentations

Welcome Back to School!!! Mr. Sortina.

Advertisements

You might be best friends one day. pretty good friends the next year.

Cayley’s Theorem & Automorphisms (10/16) Cayley’s Theorem. Every group is isomorphic to some permutation group. This says that in some sense permutation.

Words and Actions Can Hurt

CONNECTING WITH OTHERS. Connecting with others SUPPORTING A FRIEND Helping yourself Identify trusted friends and adults who may be able to support you.

How to Solve Test Problems Test Taking Strategy

The Function Design Recipe CS 5010 Program Design Paradigms “Bootcamp” Lesson 1.1 TexPoint fonts used in EMF. Read the TexPoint manual before you delete.

MCC9-12.N.CN.1; MCC9-12.N.CN.2; MCC9-12.N.CN.3.

Section 11 Direct Products and Finitely Generated Abelian Groups One purpose of this section is to show a way to use known groups as building blocks to.

2010 © Barbara Burke & Associates, Inc. What’s Your Favorite Aha!? Team Meeting #1 Aha! #15 Remember, we all share the same vine. The Napkin, The Melon.

Business Building vs. “Get Rich Quick”

Math 3121 Abstract Algebra I

Algebraic Structures DEFINITIONS: PROPERTIES OF BINARY OPERATIONS Let S be a set and let  denote a binary operation on S. (Here  does not necessarily.

Classification of Groups of Order 24

Group THeory Bingo You must write the slide number on the clue to get credit.

Foundations of Network and Computer Security J J ohn Black Lecture #10 Sep 18 th 2009 CSCI 6268/TLEN 5550, Fall 2009.

Beaucoup de Sudoku Mike Krebs, Cal State LA(joint work with C. Arcos and G. Brookfield) For slideshow: click “Research and Talks” from

For slideshow: click “Research and Talks” from slideshow: click “Research and Talks”

How Do You Know That You Are A Christian? The Life: Practical Insight to Christian Living 4/19/2002 MITACF.

Cyclic Groups. Definition G is a cyclic group if G = for some a in G.

Adverbs SC English.

CH B & E Multiplying & Dividing Integers. Try These… 4 x x (-7) -4 x 7 -4 x (-7)

Rules for Multiplying and Dividing Integers

Simplifying Rational Expressions – Part I

How to Make a Survey.

CDA6530: Performance Models of Computers and Networks Examples of Stochastic Process, Markov Chain, M/M/* Queue TexPoint fonts used in EMF. Read the TexPoint.

CS2008/CS5035 Exam Preparation. Dept. of Computing Science, University of Aberdeen2 Organization of Lecture Notes Group 1 - SQL –L1 – Introduction –L2.

C&O 355 Mathematical Programming Fall 2010 Lecture 2 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A.

Finite Groups & Subgroups. Order of a group Definition: The number of elements of a group (finite or infinite) is called its order. Notation: We will.

We’re going to a New Version? Bill Marlow School of Business, IT & Management.

Teaching Students to Prove Theorems Session for Project NExT Fellows Presenter: Carol S. Schumacher Kenyon College and.

The Research Essay your thesis statement and beyond.

MA/CSSE 473 Day 08 Randomized Primality Testing Carmichael Numbers Miller-Rabin test.

The Chain Rule Rule for finding the derivative of a composition of two functions. If y is a function of u and u is a function of x, then y is a function.

Cyclic Groups (9/25) Definition. A group G is called cyclic if there exists an element a in G such that G =  a . That is, every element of G can be written.

Getting Along Together Helping a Friend. Problem Solving – Our Part Agenda 1.Learn about empathy 2.Learn how to reflect feelings 3.Practice using empathy.

Math 3121 Abstract Algebra I Lecture 9 Finish Section 10 Section 11.

CS176 Capstone Project TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A AA In Deo Speramus Brown.

CPSC 411 Design and Analysis of Algorithms

Yvonne Lin 林育琬.  Feeling boring, don’t know what to do or means “my mind is not here”.

Draw Me Close. Draw me close to You. Never let me go. I lay it all down again To hear you say that I’m your friend.

Can you trust your senses?. WHAT DO YOU KNOW? AN INTRODUCTION TO SCEPTICISM.

Welcome to MM570 Psychological Statistics

Cosets and Lagrange’s Theorem (10/28)

Algebraic Structure in a Family of Nim-like Arrays Lowell Abrams The George Washington University Dena Cowen-Morton Xavier University TexPoint fonts used.

CPSC 536N Sparse Approximations Winter 2013 Lecture 1 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAAAAAAAA.

Math 3121 Abstract Algebra I Lecture 11 Finish Section 13 Section 14.

Normal Subgroups and Factor Groups (11/11) Definition. A subgroup H of a group G is called normal if for every a  G, the left coset aH is the same set.

Math 3121 Abstract Algebra I

1.1 The Structure of Geometry: Definition, Postulate, Theorem Wherein we meet for the first time three fundamental notions - definition, postulate and.

Delete this slide Although multiple images were used to create each slide, they are saved together as a single image file. This means that you cannot remove.

RESPONDING TO RULES HOW TO: MAKE COMPLAINTS TAKE “NO” FOR AN ANSWER DISAGREE APPROPRIATELY CHANGE RULES.

I am Special and so is My Body! I am a neat kid! I like lots of things in school. Some of my favorite things are: _________________.

BIT 115: Introduction To Programming Professor: Dr. Baba Kofi Weusijana (say Doc-tor Way-oo-see-jah-nah, Doc-tor, or Bah-bah)

You might be best friends one day. pretty good friends the next year.

Speak More Effectively By Dale Carnegie. Who was Dale Carnegie Dale Carnegie ( ) was a travelling salesman, early on in life and through the power.

Welcome to Math 6 Our subject for today is… Divisibility.

Expanders and Ramanujan Graphs Mike Krebs, Cal State LA For slideshow: click “Research and Talks” from

Isomorphisms and Isomorphic Groups (10/9) We can now say what we mean by two groups being “the same” even though their operations and elements may look.

Instructor: Chris Trenkov Hands-on Course Python for Absolute Beginners (Spring 2015) Class #003 (February 14, 2015)

Here is a kind of question that you can get on Verbal Reasoning. They might give you three groups of numbers like this: (4 [6] 2) (3 [7] 4) (5 [12] ?)

Due Friday - Activity… “interview” a senior H Talk to a senior… find out about their college essay. –What did they write about? How did they choose a topic?

CREATING A SURVEY. What is a survey questionnaire? Survey questionnaires present a set of questions to a subject who with his/her responses will provide.

Are you ready for a challenge?. Are you willing to try?

Expanders and Ramanujan Graphs Mike Krebs, Cal State LA For slideshow: click “Research and Talks” from

Sporadic and Related groups Lecture 15 Introduction to Fusion.

Math 3121 Abstract Algebra I

Interviews Whether for a job, an internship, or university admission, your interviewer wants to create a genuine connection with an upbeat, responsible.

2. From Groups to Surfaces

Presentation transcript:

Tell me what you can about a group of order n Mike Krebs, Cal State LA This talk will (soon) be available by following the link for “Research and Talks” at:

In this talk, I will describe a project I gave to an Abstract Algebra class. This talk will (soon) be available by following the link for “Research and Talks” at:

In this talk, I will describe a project I gave to an Abstract Algebra class. The project was simple. Each student was given a random three-digit number n. This talk will (soon) be available by following the link for “Research and Talks” at:

In this talk, I will describe a project I gave to an Abstract Algebra class. The project was simple. Each student was given a random three-digit number n. Each student was then instructed to “Tell me all you can about a group of order n.” This talk will (soon) be available by following the link for “Research and Talks” at:

In this talk, I will describe a project I gave to an Abstract Algebra class. The project was simple. Each student was given a random three-digit number n. Each student was then instructed to “Tell me all you can about a group of order n.” More specifically: This talk will (soon) be available by following the link for “Research and Talks” at:

Classify all abelian groups of order n. This talk will (soon) be available by following the link for “Research and Talks” at:

Classify all abelian groups of order n. Find an integer k such that a group G of order n must have a subgroup H of order k. This talk will (soon) be available by following the link for “Research and Talks” at:

Classify all abelian groups of order n. Find an integer k such that a group G of order n must have a subgroup H of order k. Is H always/sometimes/never normal in G? What are the possibilities for the number of conjugates that H can have? What else can you determine about the group H? If it’s normal, what can you say about the group G/H? How many such integers k can you find? This talk will (soon) be available by following the link for “Research and Talks” at:

Classify all abelian groups of order n. Find an integer k such that a group G of order n must have a subgroup H of order k. Is H always/sometimes/never normal in G? What are the possibilities for the number of conjugates that H can have? What else can you determine about the group H? If it’s normal, what can you say about the group G/H? How many such integers k can you find? Is a group of order n always abelian? This talk will (soon) be available by following the link for “Research and Talks” at:

Classify all abelian groups of order n. Find an integer k such that a group G of order n must have a subgroup H of order k. Is H always/sometimes/never normal in G? What are the possibilities for the number of conjugates that H can have? What else can you determine about the group H? If it’s normal, what can you say about the group G/H? How many such integers k can you find? Is a group of order n always abelian? Is a group of order n always simple? Sometimes simple? Never simple? This talk will (soon) be available by following the link for “Research and Talks” at:

Is a group of order n always solvable? Sometimes solvable? Never solvable? This talk will (soon) be available by following the link for “Research and Talks” at:

Is a group of order n always solvable? Sometimes solvable? Never solvable? Construct as many nonisomorphic nonabelian groups of order n as you can. Prove that they are not isomorphic. This talk will (soon) be available by following the link for “Research and Talks” at:

Is a group of order n always solvable? Sometimes solvable? Never solvable? Construct as many nonisomorphic nonabelian groups of order n as you can. Prove that they are not isomorphic. The Holy Grail: classify all groups of order of order n, up to isomorphism. (Depending on n, this might be trivial, or it might be extremely difficult.) This talk will (soon) be available by following the link for “Research and Talks” at:

TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA OK, let’s try it out in some gory detail. Let’s assign a random number. This talk will (soon) be available by following the link for “Research and Talks” at:

TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA OK, let’s try it. Let’s assign a random number. We could use a random number generator, but let’s use some real technology. This talk will (soon) be available by following the link for “Research and Talks” at:

This talk will (soon) be available by following the link for “Research and Talks” at:

Classify all abelian groups of order n. This talk will (soon) be available by following the link for “Research and Talks” at:

Classify all abelian groups of order n. gap> Factors(n); This talk will (soon) be available by following the link for “Research and Talks” at:

Classify all abelian groups of order n. gap> Factors(n); Example: 100 = 4 * 25 This talk will (soon) be available by following the link for “Research and Talks” at:

Find an integer k such that a group G of order n must have a subgroup H of order k. What are the possibilities for the number of conjugates that H can have? Is H always/sometimes/never normal in G? If always, what can you say about the group G/H? How many such integers k can you find? This talk will (soon) be available by following the link for “Research and Talks” at:

Find an integer k such that a group G of order n must have a subgroup H of order k. What are the possibilities for the number of conjugates that H can have? Is H always/sometimes/never normal in G? If always, what can you say about the group G/H? How many such integers k can you find? gap> l:=List([0..20],n->1+5*n); gap> List(l,x->RemInt(100,x)=0); This talk will (soon) be available by following the link for “Research and Talks” at:

Example: c is congruent to 1 mod 5 c = 1, 6, 11, 16, 21, 26,... c divides 100. c = 1. So G has a unique normal Sylow 5-subgroup H. G/H has order 4, and H has order 25. This talk will (soon) be available by following the link for “Research and Talks” at:

Is a group of order n always simple? Sometimes simple? Never simple? (The answer will probably be never.) Is a group of order n always solvable? Sometimes solvable? Never solvable? (The answer will probably be always.) This talk will (soon) be available by following the link for “Research and Talks” at:

Is a group of order n always simple? Sometimes simple? Never simple? (The answer will probably be never.) Is a group of order n always solvable? Sometimes solvable? Never solvable? (The answer will probably be always.) Indeed, that’s the case for n=100. This talk will (soon) be available by following the link for “Research and Talks” at:

Construct as many nonisomorphic nonabelian groups of order n as you can. (The semidirect product will be your friend here.) Prove that they are not isomorphic. This talk will (soon) be available by following the link for “Research and Talks” at:

Construct as many nonisomorphic nonabelian groups of order n as you can. (The semidirect product will be your friend here.) Prove that they are not isomorphic. Quick refresher: definition of semidirect product. This talk will (soon) be available by following the link for “Research and Talks” at:

Construct as many nonisomorphic nonabelian groups of order n as you can. (The semidirect product will be your friend here.) Prove that they are not isomorphic. Quick refresher: definition of semidirect product. This talk will (soon) be available by following the link for “Research and Talks” at:

This talk will (soon) be available by following the link for “Research and Talks” at:

This talk will (soon) be available by following the link for “Research and Talks” at:

This talk will (soon) be available by following the link for “Research and Talks” at:

This talk will (soon) be available by following the link for “Research and Talks” at:

This talk will (soon) be available by following the link for “Research and Talks” at:

This talk will (soon) be available by following the link for “Research and Talks” at:

This talk will (soon) be available by following the link for “Research and Talks” at:

You can tackle this question with pen-and-paper, or you can experiment using software. This talk will (soon) be available by following the link for “Research and Talks” at:

Let’s first construct a semidirect product using a = 2. (a = 1 yields the direct product of N and Q.) You can tackle this question with pen-and-paper, or you can experiment using software. This talk will (soon) be available by following the link for “Research and Talks” at:

gap> x:=(1,2,3,4,5); gap> A:=Group([x]); (cyclic group of order 5) gap> y:=(6,7,8,9,10); gap> B:=Group([y]); (cyclic group of order 5) gap> N:=DirectProduct(A,B); gap> z:=(1,2,3,4); gap> Q:=Group([z]); (cyclic group of order 4) Let’s first construct a semidirect product using a = 2. You can tackle this question with pen-and-paper, or you can experiment using software. This talk will (soon) be available by following the link for “Research and Talks” at:

gap> phi_2:=GroupHomorphismByImages(N,N, [x,y],[x^2,y^2]); gap> theta_2:=GroupHomorphismByImages(Q, AutomorphismGroup(N),[q],[phi_2]); gap> G_2:=SemidirectProduct(Q,theta_2,N); gap> IsAbelian(G_2); This talk will (soon) be available by following the link for “Research and Talks” at:

gap> phi_2:=GroupHomorphismByImages(N,N, [x,y],[x^2,y^2]); gap> theta_2:=GroupHomorphismByImages(Q, AutomorphismGroup(N),[q],[phi_2]); gap> G_2:=SemidirectProduct(Q,theta_2,N); gap> IsAbelian(G_2); false This talk will (soon) be available by following the link for “Research and Talks” at:

gap> phi_2:=GroupHomorphismByImages(N,N, [x,y],[x^2,y^2]); gap> theta_2:=GroupHomorphismByImages(Q, AutomorphismGroup(N),[q],[phi_2]); gap> G_2:=SemidirectProduct(Q,theta_2,N); gap> IsAbelian(G_2); false Similarly construct G_3, G_4 using a = 3, 4. This talk will (soon) be available by following the link for “Research and Talks” at:

gap> IsomorphismGroup(G_2,G_3); This talk will (soon) be available by following the link for “Research and Talks” at:

gap> IsomorphismGroup(G_2,G_3); GroupHomomorphismByImages( Group( [ (2, 3,5,4)(6,11,21,16)(7,13,25,19)(8,15, 24,17)(9,12,23,20)(10,14,22,18), (1,6, 11,16,21)(2,7,12,17,22)(3,8,13,... This talk will (soon) be available by following the link for “Research and Talks” at:

gap> IsomorphismGroup(G_2,G_3); GroupHomomorphismByImages( Group( [ (2, 3,5,4)(6,11,21,16)(7,13,25,19)(8,15, 24,17)(9,12,23,20)(10,14,22,18), (1,6, 11,16,21)(2,7,12,17,22)(3,8,13,... So G_2 and G_3 are isomorphic. This talk will (soon) be available by following the link for “Research and Talks” at:

gap> IsomorphismGroup(G_2,G_3); GroupHomomorphismByImages( Group( [ (2, 3,5,4)(6,11,21,16)(7,13,25,19)(8,15, 24,17)(9,12,23,20)(10,14,22,18), (1,6, 11,16,21)(2,7,12,17,22)(3,8,13,... So G_2 and G_3 are isomorphic. Now we have something to prove! (How could a human find an isomorphism from G_2 to G_3?) This talk will (soon) be available by following the link for “Research and Talks” at:

gap> IsomorphismGroup(G_2,G_4); This talk will (soon) be available by following the link for “Research and Talks” at:

gap> IsomorphismGroup(G_2,G_4); fail This talk will (soon) be available by following the link for “Research and Talks” at:

gap> IsomorphismGroup(G_2,G_4); fail So G_2 and G_4 are not isomorphic. This talk will (soon) be available by following the link for “Research and Talks” at:

gap> IsomorphismGroup(G_2,G_4); fail So G_2 and G_4 are not isomorphic. Now we have some thing else to prove! This talk will (soon) be available by following the link for “Research and Talks” at:

“I remember a project that I did in one of my algebra classes where I came up with a way to classify the semi-direct products of certain groups by looking at conjugacy classes of matrices. Although I'd wager my ‘discovery’ is merely an instance of a more general established result, the feeling of being drawn to spend extra hours engaged with a problem, and being rewarded with finding heretofore unseen connections is exhilarating. The course ended and I had to move on to other things, but the experience affirmed for me the sheer pleasure of research.” This talk will (soon) be available by following the link for “Research and Talks” at: