How to calculate a subgroup of some permutation?
up vote
0
down vote
favorite
I think is easier to explain it with a specific problem (but would be nice a generic answer):
We have 2 options, $A$ and $B$, counting permutations of $N$ items is easy, but how to calculate the subgroup where we have two $A$'s?
Example with $N = 3$:
$AAA$
$AAB$
$ABA$
$BAA$
$ABB$
$BBA$
$BAB$
$BBB$
To get the $8$ options is just $2^3$, but what is the formula to get "$3$" (permutation with 2 $A$)?
combinatorics permutations
New contributor
add a comment |
up vote
0
down vote
favorite
I think is easier to explain it with a specific problem (but would be nice a generic answer):
We have 2 options, $A$ and $B$, counting permutations of $N$ items is easy, but how to calculate the subgroup where we have two $A$'s?
Example with $N = 3$:
$AAA$
$AAB$
$ABA$
$BAA$
$ABB$
$BBA$
$BAB$
$BBB$
To get the $8$ options is just $2^3$, but what is the formula to get "$3$" (permutation with 2 $A$)?
combinatorics permutations
New contributor
Welcome to MSE! For some basic information about writing mathematics at this site see, e.g., basic help on mathjax notation, mathjax tutorial and quick reference, main meta site math tutorial and equation editing how-to.
– platty
Dec 1 at 3:45
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
I think is easier to explain it with a specific problem (but would be nice a generic answer):
We have 2 options, $A$ and $B$, counting permutations of $N$ items is easy, but how to calculate the subgroup where we have two $A$'s?
Example with $N = 3$:
$AAA$
$AAB$
$ABA$
$BAA$
$ABB$
$BBA$
$BAB$
$BBB$
To get the $8$ options is just $2^3$, but what is the formula to get "$3$" (permutation with 2 $A$)?
combinatorics permutations
New contributor
I think is easier to explain it with a specific problem (but would be nice a generic answer):
We have 2 options, $A$ and $B$, counting permutations of $N$ items is easy, but how to calculate the subgroup where we have two $A$'s?
Example with $N = 3$:
$AAA$
$AAB$
$ABA$
$BAA$
$ABB$
$BBA$
$BAB$
$BBB$
To get the $8$ options is just $2^3$, but what is the formula to get "$3$" (permutation with 2 $A$)?
combinatorics permutations
combinatorics permutations
New contributor
New contributor
edited Dec 1 at 3:45
platty
2,612218
2,612218
New contributor
asked Dec 1 at 3:32
Enrique
1011
1011
New contributor
New contributor
Welcome to MSE! For some basic information about writing mathematics at this site see, e.g., basic help on mathjax notation, mathjax tutorial and quick reference, main meta site math tutorial and equation editing how-to.
– platty
Dec 1 at 3:45
add a comment |
Welcome to MSE! For some basic information about writing mathematics at this site see, e.g., basic help on mathjax notation, mathjax tutorial and quick reference, main meta site math tutorial and equation editing how-to.
– platty
Dec 1 at 3:45
Welcome to MSE! For some basic information about writing mathematics at this site see, e.g., basic help on mathjax notation, mathjax tutorial and quick reference, main meta site math tutorial and equation editing how-to.
– platty
Dec 1 at 3:45
Welcome to MSE! For some basic information about writing mathematics at this site see, e.g., basic help on mathjax notation, mathjax tutorial and quick reference, main meta site math tutorial and equation editing how-to.
– platty
Dec 1 at 3:45
add a comment |
1 Answer
1
active
oldest
votes
up vote
4
down vote
I might be oversimplifying this, but if order does not matter, then it's simply a question of how many ways can you place two A's in a list of three, which is ${3 choose 2} = 3.$ In general, for N objects with k number of A's it'd be ${N choose k} = frac{N!}{k!(N-k)!}$.
New contributor
add a comment |
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
4
down vote
I might be oversimplifying this, but if order does not matter, then it's simply a question of how many ways can you place two A's in a list of three, which is ${3 choose 2} = 3.$ In general, for N objects with k number of A's it'd be ${N choose k} = frac{N!}{k!(N-k)!}$.
New contributor
add a comment |
up vote
4
down vote
I might be oversimplifying this, but if order does not matter, then it's simply a question of how many ways can you place two A's in a list of three, which is ${3 choose 2} = 3.$ In general, for N objects with k number of A's it'd be ${N choose k} = frac{N!}{k!(N-k)!}$.
New contributor
add a comment |
up vote
4
down vote
up vote
4
down vote
I might be oversimplifying this, but if order does not matter, then it's simply a question of how many ways can you place two A's in a list of three, which is ${3 choose 2} = 3.$ In general, for N objects with k number of A's it'd be ${N choose k} = frac{N!}{k!(N-k)!}$.
New contributor
I might be oversimplifying this, but if order does not matter, then it's simply a question of how many ways can you place two A's in a list of three, which is ${3 choose 2} = 3.$ In general, for N objects with k number of A's it'd be ${N choose k} = frac{N!}{k!(N-k)!}$.
New contributor
New contributor
answered Dec 1 at 3:54
eKoontz
412
412
New contributor
New contributor
add a comment |
add a comment |
Enrique is a new contributor. Be nice, and check out our Code of Conduct.
Enrique is a new contributor. Be nice, and check out our Code of Conduct.
Enrique is a new contributor. Be nice, and check out our Code of Conduct.
Enrique is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3020954%2fhow-to-calculate-a-subgroup-of-some-permutation%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Welcome to MSE! For some basic information about writing mathematics at this site see, e.g., basic help on mathjax notation, mathjax tutorial and quick reference, main meta site math tutorial and equation editing how-to.
– platty
Dec 1 at 3:45