10-1100/Homework Assignment 1 - Revision history

Drorbn at 01:41, 13 October 2010

2010-10-13T01:41:43Z

← Older revision		Revision as of 21:41, 12 October 2010
Line 6:		Line 6:
	Web search "Rubik's Cube Variants" (look at images), or look at [http://en.wikipedia.org/wiki/Combination_puzzle Wikipedia: Combination Puzzle] or [http://www.twistypuzzles.com/ TwistyPuzzles.com], or search elsewhere or go to a toy shop, pick your favourite "permutation group puzzle" (other than the Rubik Cube, of course), and figure out how many configurations it has. For your solution to count the number of configurations must be more than you can count, and your solution must include a clear picture or diagram of the object being studied, its labeling by integers, the list of generating permutations for it, and a printout of the program you used along with screen shot of its output (or an input/output log). It is ok to use the program presented in class (Mathematica is available on a departmental server; look for it!) but better to write your own. You can submit your solution either as a wiki page on this server (best option), or as a URL elsewhere (second best), or as a single file in any reasonable format, or on paper.		Web search "Rubik's Cube Variants" (look at images), or look at [http://en.wikipedia.org/wiki/Combination_puzzle Wikipedia: Combination Puzzle] or [http://www.twistypuzzles.com/ TwistyPuzzles.com], or search elsewhere or go to a toy shop, pick your favourite "permutation group puzzle" (other than the Rubik Cube, of course), and figure out how many configurations it has. For your solution to count the number of configurations must be more than you can count, and your solution must include a clear picture or diagram of the object being studied, its labeling by integers, the list of generating permutations for it, and a printout of the program you used along with screen shot of its output (or an input/output log). It is ok to use the program presented in class (Mathematica is available on a departmental server; look for it!) but better to write your own. You can submit your solution either as a wiki page on this server (best option), or as a URL elsewhere (second best), or as a single file in any reasonable format, or on paper.

	Solutions. [[10-1100/Assignment 1 Part 1 by Charles]], [[10-1100/Assignment 1 Part 1 by Peter]], [[10-1100-Assignment 1 Part 1 by cjeagle]].		'''Solutions.''' [[10-1100/Assignment 1 Part 1 by Charles]], [[10-1100/Assignment 1 Part 1 by Peter]], [[10-1100-Assignment 1 Part 1 by cjeagle]].

	===Part II===		===Part II===

Drorbn at 01:41, 13 October 2010

2010-10-13T01:41:30Z

← Older revision		Revision as of 21:41, 12 October 2010
Line 5:		Line 5:
	===Part I===		===Part I===
	Web search "Rubik's Cube Variants" (look at images), or look at [http://en.wikipedia.org/wiki/Combination_puzzle Wikipedia: Combination Puzzle] or [http://www.twistypuzzles.com/ TwistyPuzzles.com], or search elsewhere or go to a toy shop, pick your favourite "permutation group puzzle" (other than the Rubik Cube, of course), and figure out how many configurations it has. For your solution to count the number of configurations must be more than you can count, and your solution must include a clear picture or diagram of the object being studied, its labeling by integers, the list of generating permutations for it, and a printout of the program you used along with screen shot of its output (or an input/output log). It is ok to use the program presented in class (Mathematica is available on a departmental server; look for it!) but better to write your own. You can submit your solution either as a wiki page on this server (best option), or as a URL elsewhere (second best), or as a single file in any reasonable format, or on paper.		Web search "Rubik's Cube Variants" (look at images), or look at [http://en.wikipedia.org/wiki/Combination_puzzle Wikipedia: Combination Puzzle] or [http://www.twistypuzzles.com/ TwistyPuzzles.com], or search elsewhere or go to a toy shop, pick your favourite "permutation group puzzle" (other than the Rubik Cube, of course), and figure out how many configurations it has. For your solution to count the number of configurations must be more than you can count, and your solution must include a clear picture or diagram of the object being studied, its labeling by integers, the list of generating permutations for it, and a printout of the program you used along with screen shot of its output (or an input/output log). It is ok to use the program presented in class (Mathematica is available on a departmental server; look for it!) but better to write your own. You can submit your solution either as a wiki page on this server (best option), or as a URL elsewhere (second best), or as a single file in any reasonable format, or on paper.

			Solutions. [[10-1100/Assignment 1 Part 1 by Charles]], [[10-1100/Assignment 1 Part 1 by Peter]], [[10-1100-Assignment 1 Part 1 by cjeagle]].

	===Part II===		===Part II===

Drorbn at 22:32, 29 September 2010

2010-09-29T22:32:29Z

← Older revision		Revision as of 18:32, 29 September 2010
Line 12:		Line 12:
	# (Lang, pp 75) Let <math>G</math> be a group. For <math>a,b\in G</math>, the ''commutator'' <math>[a,b]</math> of <math>a</math> and <math>b</math> is <math>[a,b]=aba^{-1}b^{-1}</math>. Let <math>G'</math> be the subgroup of <math>G</math> generated by all commutators of elements of <math>G</math>. Show that <math>G'</math> is normal in <math>G</math>, that <math>G/G'</math> is Abelian, and that any morphism from <math>G</math> into an Abelian group factors through <math>G/G'</math>.		# (Lang, pp 75) Let <math>G</math> be a group. For <math>a,b\in G</math>, the ''commutator'' <math>[a,b]</math> of <math>a</math> and <math>b</math> is <math>[a,b]=aba^{-1}b^{-1}</math>. Let <math>G'</math> be the subgroup of <math>G</math> generated by all commutators of elements of <math>G</math>. Show that <math>G'</math> is normal in <math>G</math>, that <math>G/G'</math> is Abelian, and that any morphism from <math>G</math> into an Abelian group factors through <math>G/G'</math>.
	# (Lang, pp 75) Let <math>G</math> be a group. An ''automorphism'' of <math>G</math> is an invertible group morphism <math>G\to G</math>. An ''inner automorphism'' is an automorphism of <math>G</math> given by conjugation by some specific element <math>g</math> of <math>G</math>, so <math>x\mapsto x^g</math>. Prove that the inner automorphisms of <math>G</math> form a normal subgroup of the group of all automorphisms of <math>G</math>.		# (Lang, pp 75) Let <math>G</math> be a group. An ''automorphism'' of <math>G</math> is an invertible group morphism <math>G\to G</math>. An ''inner automorphism'' is an automorphism of <math>G</math> given by conjugation by some specific element <math>g</math> of <math>G</math>, so <math>x\mapsto x^g</math>. Prove that the inner automorphisms of <math>G</math> form a normal subgroup of the group of all automorphisms of <math>G</math>.

			===Part III===
			Identify yourself in the [[10-1100/Class Photo]] page!

Drorbn at 13:17, 29 September 2010

2010-09-29T13:17:16Z

← Older revision		Revision as of 09:17, 29 September 2010
Line 1:		Line 1:
	{{10-1100/Navigation}}		{{10-1100/Navigation}}
	{{In Preparation}}

	This assignment is due at class time on Tuesday, October 12, 2010.		This assignment is due at class time on Tuesday, October 12, 2010.

Drorbn at 13:17, 29 September 2010

2010-09-29T13:17:03Z

← Older revision		Revision as of 09:17, 29 September 2010
Line 2:		Line 2:
	{{In Preparation}}		{{In Preparation}}

			This assignment is due at class time on Tuesday, October 12, 2010.

			===Part I===
	Web search "Rubik's Cube Variants" (look at images), or look at [http://en.wikipedia.org/wiki/Combination_puzzle Wikipedia: Combination Puzzle] or [http://www.twistypuzzles.com/ TwistyPuzzles.com], or search elsewhere or go to a toy shop, pick your favourite "permutation group puzzle" (other than the Rubik Cube, of course), and figure out how many configurations it has. For your solution to count the number of configurations must be more than you can count, and your solution must include a clear picture or diagram of the object being studied, its labeling by integers, the list of generating permutations for it, and a printout of the program you used along with screen shot of its output (or an input/output log). It is ok to use the program presented in class (Mathematica is available on a departmental server; look for it!) but better to write your own. You can submit your solution either as a wiki page on this server (best option), or as a URL elsewhere (second best), or as a single file in any reasonable format, or on paper.		Web search "Rubik's Cube Variants" (look at images), or look at [http://en.wikipedia.org/wiki/Combination_puzzle Wikipedia: Combination Puzzle] or [http://www.twistypuzzles.com/ TwistyPuzzles.com], or search elsewhere or go to a toy shop, pick your favourite "permutation group puzzle" (other than the Rubik Cube, of course), and figure out how many configurations it has. For your solution to count the number of configurations must be more than you can count, and your solution must include a clear picture or diagram of the object being studied, its labeling by integers, the list of generating permutations for it, and a printout of the program you used along with screen shot of its output (or an input/output log). It is ok to use the program presented in class (Mathematica is available on a departmental server; look for it!) but better to write your own. You can submit your solution either as a wiki page on this server (best option), or as a URL elsewhere (second best), or as a single file in any reasonable format, or on paper.

			===Part II===
			Solve the following questions.
	# (Selick) If <math>g</math> is an element of a group <math>G</math>, the ''order'' <math>\|g\|</math> of <math>g</math> is the least positive number n for which <math>g^n=1</math> (may be <math>\infty</math>). If <math>x,y\in G</math>, prove that <math>\|xy\|=\|yx\|</math>.		# (Selick) If <math>g</math> is an element of a group <math>G</math>, the ''order'' <math>\|g\|</math> of <math>g</math> is the least positive number n for which <math>g^n=1</math> (may be <math>\infty</math>). If <math>x,y\in G</math>, prove that <math>\|xy\|=\|yx\|</math>.
	# (Selick) Let <math>G</math> be a group. Show that the function <math>\phi:G\to G</math> given by <math>\phi(g)=g^2</math> is a morphism of groups if and only if <math>G</math> is Abelian.		# (Selick) Let <math>G</math> be a group. Show that the function <math>\phi:G\to G</math> given by <math>\phi(g)=g^2</math> is a morphism of groups if and only if <math>G</math> is Abelian.

Drorbn at 12:52, 29 September 2010

2010-09-29T12:52:33Z

← Older revision		Revision as of 08:52, 29 September 2010
Line 7:		Line 7:
	# (Selick) Let <math>G</math> be a group. Show that the function <math>\phi:G\to G</math> given by <math>\phi(g)=g^2</math> is a morphism of groups if and only if <math>G</math> is Abelian.		# (Selick) Let <math>G</math> be a group. Show that the function <math>\phi:G\to G</math> given by <math>\phi(g)=g^2</math> is a morphism of groups if and only if <math>G</math> is Abelian.
	# (Lang, pp 75) Let <math>G</math> be a group. For <math>a,b\in G</math>, the ''commutator'' <math>[a,b]</math> of <math>a</math> and <math>b</math> is <math>[a,b]=aba^{-1}b^{-1}</math>. Let <math>G'</math> be the subgroup of <math>G</math> generated by all commutators of elements of <math>G</math>. Show that <math>G'</math> is normal in <math>G</math>, that <math>G/G'</math> is Abelian, and that any morphism from <math>G</math> into an Abelian group factors through <math>G/G'</math>.		# (Lang, pp 75) Let <math>G</math> be a group. For <math>a,b\in G</math>, the ''commutator'' <math>[a,b]</math> of <math>a</math> and <math>b</math> is <math>[a,b]=aba^{-1}b^{-1}</math>. Let <math>G'</math> be the subgroup of <math>G</math> generated by all commutators of elements of <math>G</math>. Show that <math>G'</math> is normal in <math>G</math>, that <math>G/G'</math> is Abelian, and that any morphism from <math>G</math> into an Abelian group factors through <math>G/G'</math>.
			# (Lang, pp 75) Let <math>G</math> be a group. An ''automorphism'' of <math>G</math> is an invertible group morphism <math>G\to G</math>. An ''inner automorphism'' is an automorphism of <math>G</math> given by conjugation by some specific element <math>g</math> of <math>G</math>, so <math>x\mapsto x^g</math>. Prove that the inner automorphisms of <math>G</math> form a normal subgroup of the group of all automorphisms of <math>G</math>.
	# (Lang, pp 75) Let <math>G</math> be a group. An ''inner automorphism''

Drorbn at 12:02, 29 September 2010

2010-09-29T12:02:58Z

← Older revision		Revision as of 08:02, 29 September 2010
Line 3:		Line 3:

	Web search "Rubik's Cube Variants" (look at images), or look at [http://en.wikipedia.org/wiki/Combination_puzzle Wikipedia: Combination Puzzle] or [http://www.twistypuzzles.com/ TwistyPuzzles.com], or search elsewhere or go to a toy shop, pick your favourite "permutation group puzzle" (other than the Rubik Cube, of course), and figure out how many configurations it has. For your solution to count the number of configurations must be more than you can count, and your solution must include a clear picture or diagram of the object being studied, its labeling by integers, the list of generating permutations for it, and a printout of the program you used along with screen shot of its output (or an input/output log). It is ok to use the program presented in class (Mathematica is available on a departmental server; look for it!) but better to write your own. You can submit your solution either as a wiki page on this server (best option), or as a URL elsewhere (second best), or as a single file in any reasonable format, or on paper.		Web search "Rubik's Cube Variants" (look at images), or look at [http://en.wikipedia.org/wiki/Combination_puzzle Wikipedia: Combination Puzzle] or [http://www.twistypuzzles.com/ TwistyPuzzles.com], or search elsewhere or go to a toy shop, pick your favourite "permutation group puzzle" (other than the Rubik Cube, of course), and figure out how many configurations it has. For your solution to count the number of configurations must be more than you can count, and your solution must include a clear picture or diagram of the object being studied, its labeling by integers, the list of generating permutations for it, and a printout of the program you used along with screen shot of its output (or an input/output log). It is ok to use the program presented in class (Mathematica is available on a departmental server; look for it!) but better to write your own. You can submit your solution either as a wiki page on this server (best option), or as a URL elsewhere (second best), or as a single file in any reasonable format, or on paper.

			# (Selick) If <math>g</math> is an element of a group <math>G</math>, the ''order'' <math>\|g\|</math> of <math>g</math> is the least positive number n for which <math>g^n=1</math> (may be <math>\infty</math>). If <math>x,y\in G</math>, prove that <math>\|xy\|=\|yx\|</math>.
			# (Selick) Let <math>G</math> be a group. Show that the function <math>\phi:G\to G</math> given by <math>\phi(g)=g^2</math> is a morphism of groups if and only if <math>G</math> is Abelian.
			# (Lang, pp 75) Let <math>G</math> be a group. For <math>a,b\in G</math>, the ''commutator'' <math>[a,b]</math> of <math>a</math> and <math>b</math> is <math>[a,b]=aba^{-1}b^{-1}</math>. Let <math>G'</math> be the subgroup of <math>G</math> generated by all commutators of elements of <math>G</math>. Show that <math>G'</math> is normal in <math>G</math>, that <math>G/G'</math> is Abelian, and that any morphism from <math>G</math> into an Abelian group factors through <math>G/G'</math>.
			# (Lang, pp 75) Let <math>G</math> be a group. An ''inner automorphism''

Drorbn at 20:26, 27 September 2010

2010-09-27T20:26:59Z

← Older revision		Revision as of 16:26, 27 September 2010
Line 2:		Line 2:
	{{In Preparation}}		{{In Preparation}}

	Web search "Rubik's Cube Variants" (look at images), or look at [http://en.wikipedia.org/wiki/Combination_puzzle Wikipedia: Combination Puzzle] or [http://www.twistypuzzles.com/ TwistyPuzzles.com], or search elsewhere or go to a toy shop, pick your favourite "permutation group puzzle", and figure out how many configurations it has. For your solution to count the number of configurations must be more than you can count, and your solution must include a clear picture or diagram of the object being studied, its labeling by integers, the list of generating permutations for it, and a printout of the program you used along with screen shot of its output (or an input/output log). It is ok to use the program presented in class (Mathematica is available on a departmental server; look for it!) but better to write your own. You can submit your solution either as a wiki page on this server (best option), or as a URL elsewhere (second best), or as a single file in any reasonable format, or on paper.		Web search "Rubik's Cube Variants" (look at images), or look at [http://en.wikipedia.org/wiki/Combination_puzzle Wikipedia: Combination Puzzle] or [http://www.twistypuzzles.com/ TwistyPuzzles.com], or search elsewhere or go to a toy shop, pick your favourite "permutation group puzzle" (other than the Rubik Cube, of course), and figure out how many configurations it has. For your solution to count the number of configurations must be more than you can count, and your solution must include a clear picture or diagram of the object being studied, its labeling by integers, the list of generating permutations for it, and a printout of the program you used along with screen shot of its output (or an input/output log). It is ok to use the program presented in class (Mathematica is available on a departmental server; look for it!) but better to write your own. You can submit your solution either as a wiki page on this server (best option), or as a URL elsewhere (second best), or as a single file in any reasonable format, or on paper.

Drorbn at 15:23, 27 September 2010

2010-09-27T15:23:32Z

← Older revision		Revision as of 11:23, 27 September 2010
Line 1:		Line 1:
			{{10-1100/Navigation}}
	{{In Preparation}}		{{In Preparation}}

Drorbn at 15:23, 27 September 2010

2010-09-27T15:23:14Z

New page

{{In Preparation}}

Web search "Rubik's Cube Variants" (look at images), or look at [http://en.wikipedia.org/wiki/Combination_puzzle Wikipedia: Combination Puzzle] or [http://www.twistypuzzles.com/ TwistyPuzzles.com], or search elsewhere or go to a toy shop, pick your favourite "permutation group puzzle", and figure out how many configurations it has. For your solution to count the number of configurations must be more than you can count, and your solution must include a clear picture or diagram of the object being studied, its labeling by integers, the list of generating permutations for it, and a printout of the program you used along with screen shot of its output (or an input/output log). It is ok to use the program presented in class (Mathematica is available on a departmental server; look for it!) but better to write your own. You can submit your solution either as a wiki page on this server (best option), or as a URL elsewhere (second best), or as a single file in any reasonable format, or on paper.