Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Results tagged with group-theory
Search options questions only
not deleted
user 955582
For questions about the study of algebraic structures consisting of a set of elements together with a well-defined binary operation that satisfies three conditions: associativity, identity and invertibility.
7
votes
1
answer
313
views
Possible group operations on a finite set
Suppose $X=\{x_1, x_2, \ldots, x_n\}$ is a finite set of $n$ elements.
I learned that there are $n^{n^2}$ binary operations $*:X\times X \to X$ and $n^{n(n+1)/2}$ of them are commutative.
I was wonder …
3
votes
1
answer
69
views
Using group theory, show that $\forall \ n\in \mathbb Z_{\geq 0}, \ (n+1)$ divides ${2n}\cho...
That $(n+1)$ divides ${2n}\choose{n}$ can be proven in different ways as done here.
$$\frac{1}{n+1}\binom{2n}{n} = \binom{2n}{n} - \binom{2n}{n+1}$$
Every Catalan number $C_n=\frac{1}{n+1}\binom{2n} …
6
votes
1
answer
188
views
Proof by contradiction using properties of normal subgroup: A group is cyclic if $x^m=e$ has...
Statement:
Let $G$ be a finite group. Show that if for each positive integer $m$ the number of solutions $x$ of the equation $x^n=e$ in $G$ is at most $n$, then $G$ is cyclic.
There are various proo …
3
votes
1
answer
96
views
$n$- transposition permutations in $S_{2n}$ which decompose a $2n$-cycle into $n+1$ cycles
I was learning about Catalan numbers online. I have understood the combinatorial argument, recurrence relation and generating function based proofs of Dyck words and Dyck paths.
Let $S_{2n}$ be the sy …
5
votes
1
answer
156
views
Number of homomorphisms from $\DeclareMathOperator{\Z}{\mathbb Z}\Z\oplus \Z$ to $S_3$
I read that a homomorphism is fully determined by where its generators are mapped to.
Let $f\colon\, \Z\oplus \Z\to S_3$ be a group homomorphism.
Generators of $\Z\oplus \Z$ are $(1,0)$ and $(0,1)$. I …