Coloring triangular dihedral #2
$begingroup$
To start with, my dihedral is a bit specific, here is a picture
I need to find amount of ways to color faces ( there are 8 ) into 3 colours.
I have already something in my mind because of help Marko Riepel, here is my previous question, where he provided solution for a bit other solid, and one more, where solid is almost like mine, just its lower and upper parts are not truncated .
So, I am not sure I have properly found rotations to make cycles index. And not sure about reflections, because in my task there is no word about .
I have these:
1) 2 rotations by 120 degrees, which change only the vericles in the middle triangle + identity e( nothing changes)
2) 3 rotations by 180 degrees passing through medians of triangles ( so 2 triangles vericles exchange and also small triangles exchange). So, there are 6, is it all? I misunderstand a bit which moves with solid are allowed and which arent.
Also, am I write, that the degree of cycle a depends of elements which werent changed? Because I dont truly understand the form of writing cycle index in the examples I linked to, I mean, as I found out, we work with group of permulations, and the amount of cycles in each permulations = degree for N in Burnsides lemma? For example, identity e permulation (1)(2)(3)(4)(5)(6)(7)(8) has 8 cycles so the first addend will be N^8?
Sorry guys, I feel really stupid, I spent whole day reading my institute lectures, googling example of use of lemma, searching in russian forums, foreign forums and still I cant solve this fucking task...
coloring dihedral-groups
asked Jan 12 at 17:01
TovarischTovarisch
297
$endgroup$
add a comment |
$begingroup$
To start with, my dihedral is a bit specific, here is a picture
I need to find amount of ways to color faces ( there are 8 ) into 3 colours.
I have already something in my mind because of help Marko Riepel, here is my previous question, where he provided solution for a bit other solid, and one more, where solid is almost like mine, just its lower and upper parts are not truncated .
So, I am not sure I have properly found rotations to make cycles index. And not sure about reflections, because in my task there is no word about .
I have these:
1) 2 rotations by 120 degrees, which change only the vericles in the middle triangle + identity e( nothing changes)
2) 3 rotations by 180 degrees passing through medians of triangles ( so 2 triangles vericles exchange and also small triangles exchange). So, there are 6, is it all? I misunderstand a bit which moves with solid are allowed and which arent.
Also, am I write, that the degree of cycle a depends of elements which werent changed? Because I dont truly understand the form of writing cycle index in the examples I linked to, I mean, as I found out, we work with group of permulations, and the amount of cycles in each permulations = degree for N in Burnsides lemma? For example, identity e permulation (1)(2)(3)(4)(5)(6)(7)(8) has 8 cycles so the first addend will be N^8?
Sorry guys, I feel really stupid, I spent whole day reading my institute lectures, googling example of use of lemma, searching in russian forums, foreign forums and still I cant solve this fucking task...
coloring dihedral-groups
asked Jan 12 at 17:01
TovarischTovarisch
297
$endgroup$
add a comment |
$begingroup$
To start with, my dihedral is a bit specific, here is a picture
I need to find amount of ways to color faces ( there are 8 ) into 3 colours.
I have already something in my mind because of help Marko Riepel, here is my previous question, where he provided solution for a bit other solid, and one more, where solid is almost like mine, just its lower and upper parts are not truncated .
So, I am not sure I have properly found rotations to make cycles index. And not sure about reflections, because in my task there is no word about .
I have these:
1) 2 rotations by 120 degrees, which change only the vericles in the middle triangle + identity e( nothing changes)
2) 3 rotations by 180 degrees passing through medians of triangles ( so 2 triangles vericles exchange and also small triangles exchange). So, there are 6, is it all? I misunderstand a bit which moves with solid are allowed and which arent.
Also, am I write, that the degree of cycle a depends of elements which werent changed? Because I dont truly understand the form of writing cycle index in the examples I linked to, I mean, as I found out, we work with group of permulations, and the amount of cycles in each permulations = degree for N in Burnsides lemma? For example, identity e permulation (1)(2)(3)(4)(5)(6)(7)(8) has 8 cycles so the first addend will be N^8?
Sorry guys, I feel really stupid, I spent whole day reading my institute lectures, googling example of use of lemma, searching in russian forums, foreign forums and still I cant solve this fucking task...
coloring dihedral-groups
asked Jan 12 at 17:01
TovarischTovarisch
297
$endgroup$
To start with, my dihedral is a bit specific, here is a picture
I need to find amount of ways to color faces ( there are 8 ) into 3 colours.
I have already something in my mind because of help Marko Riepel, here is my previous question, where he provided solution for a bit other solid, and one more, where solid is almost like mine, just its lower and upper parts are not truncated .
So, I am not sure I have properly found rotations to make cycles index. And not sure about reflections, because in my task there is no word about .
I have these:
1) 2 rotations by 120 degrees, which change only the vericles in the middle triangle + identity e( nothing changes)
2) 3 rotations by 180 degrees passing through medians of triangles ( so 2 triangles vericles exchange and also small triangles exchange). So, there are 6, is it all? I misunderstand a bit which moves with solid are allowed and which arent.
Also, am I write, that the degree of cycle a depends of elements which werent changed? Because I dont truly understand the form of writing cycle index in the examples I linked to, I mean, as I found out, we work with group of permulations, and the amount of cycles in each permulations = degree for N in Burnsides lemma? For example, identity e permulation (1)(2)(3)(4)(5)(6)(7)(8) has 8 cycles so the first addend will be N^8?
Sorry guys, I feel really stupid, I spent whole day reading my institute lectures, googling example of use of lemma, searching in russian forums, foreign forums and still I cant solve this fucking task...
coloring dihedral-groups
coloring dihedral-groups
asked Jan 12 at 17:01
TovarischTovarisch
297
asked Jan 12 at 17:01
TovarischTovarisch
297
asked Jan 12 at 17:01
TovarischTovarisch
297
asked Jan 12 at 17:01
TovarischTovarisch
297
asked Jan 12 at 17:01
TovarischTovarisch
297
297
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
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%2f3071119%2fcoloring-triangular-dihedral-2%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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.
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%2f3071119%2fcoloring-triangular-dihedral-2%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
