19,816 reputation
1882146
bio website plaza.ufl.edu/gruberan
location Gainesville, FL
age
visits member for 3 years, 7 months
seen 2 hours ago

$$\mathfrak{I}\text{ }\mathfrak{AM}\text{ }\mathfrak{A}\text{ }\mathfrak{GREAT}\text{ }\mathfrak{MAGICIAN!}$$

$$ {} $$

$$ {} $$

$$ {} $$

$$ {} $$

did you know that cigarette lighters were invented before matches?

Interesting reading:

First, there are many good posts to be found among the longest answers.

I'm a fan of the posts by this mysterious stranger. Sometimes, we need a Man in Black to chase.

I have learned a lot from Arturo Magidin's posts here about group theory. Here's one of my favorite examples.


Nov
20
answered A more swift method for Conjugation Classes
Nov
20
comment Does a four-variable analog of the Hall-Witt identity exist?
@GrigoryM So I've read the paper in that link a couple times, and I'm still having trouble sorting it out. I guess I just don't speak topologist real good. My hope for this question, I suppose, is to find a simpler, alternative proof, especially considering that what he proved seems stronger than what I was looking for at first.
Nov
20
comment Does a four-variable analog of the Hall-Witt identity exist?
I must add, your proof at the end is excellent, precisely what I was limply flailing at in my progress, yet stated (and proved) much more cleanly. Very slick. Thank you for this.
Nov
20
comment Does a four-variable analog of the Hall-Witt identity exist?
Am I far wrong in supposing that in fact you had some such additional conditions in mind when you formulated your question? You are not wrong! Your conditions are indeed what I had in mind. The reason I (rather conspicuously) omitted them from the OP is that I was still uncertain of this choice. $n=2$ only uses commutators, then we add in conjugations for $n=3$, so, maybe there was some natural thing to add for $n=4$. My hope was that, by exploring the question, I could nail down the condition precisely, either finding some other operation(s), or convincing myself that none should be there.
Nov
19
awarded  Favorite Question
Nov
18
revised Examples where it is easier to prove more than less
added 44 characters in body
Nov
15
revised Examples where it is easier to prove more than less
added 2 characters in body
Nov
15
comment Examples where it is easier to prove more than less
I'm not sure I agree that it's a duplicate. I guess they're technically equivalent, but proving a generalization isn't spiritually the same as having to prove a bunch of stuff in order to get something smaller- like driving all over the city just to go one block, because the road was closed. At least that is my opinion, after some thought.
Nov
15
revised Examples where it is easier to prove more than less
deleted 2 characters in body
Nov
15
revised Examples where it is easier to prove more than less
added 41 characters in body
Nov
15
revised Examples where it is easier to prove more than less
added 136 characters in body
Nov
15
revised Examples where it is easier to prove more than less
added 136 characters in body
Nov
14
answered Examples where it is easier to prove more than less
Nov
13
answered Question on reducibility over rationals.
Nov
13
revised Question about classifying semidirect product
edited tags
Nov
13
answered Question about classifying semidirect product
Nov
12
revised Let G be a group of order 2n with n being an odd integer. Prove that G has a normal subgroup of order n.
added 95 characters in body
Nov
12
answered Let G be a group of order 2n with n being an odd integer. Prove that G has a normal subgroup of order n.
Nov
12
answered How to justify the statement that a graph is connected?
Nov
12
comment How do you create an operation for circular indices of a vector?
Oh, I see. Good!