Combinatorics Terminology: Finite Sequence of Symbols Modulo Reversal
$begingroup$
Simple question, hard to Google:
What do we call the combinatorial species that associates a set of symbols with linear configuration or chain of symbols without a designated first or last symbol? Or the combinatorial species of finite sequences modulo identification under reversal?
Edit: a linear necklace? A bar?
combinatorics discrete-mathematics
asked Mar 25 '17 at 21:02
ThoralfSkolemThoralfSkolem
1,133615
$endgroup$
add a comment |
$begingroup$
Simple question, hard to Google:
What do we call the combinatorial species that associates a set of symbols with linear configuration or chain of symbols without a designated first or last symbol? Or the combinatorial species of finite sequences modulo identification under reversal?
Edit: a linear necklace? A bar?
combinatorics discrete-mathematics
asked Mar 25 '17 at 21:02
ThoralfSkolemThoralfSkolem
1,133615
$endgroup$
add a comment |
$begingroup$
Simple question, hard to Google:
What do we call the combinatorial species that associates a set of symbols with linear configuration or chain of symbols without a designated first or last symbol? Or the combinatorial species of finite sequences modulo identification under reversal?
Edit: a linear necklace? A bar?
combinatorics discrete-mathematics
asked Mar 25 '17 at 21:02
ThoralfSkolemThoralfSkolem
1,133615
$endgroup$
Simple question, hard to Google:
What do we call the combinatorial species that associates a set of symbols with linear configuration or chain of symbols without a designated first or last symbol? Or the combinatorial species of finite sequences modulo identification under reversal?
Edit: a linear necklace? A bar?
combinatorics discrete-mathematics
combinatorics discrete-mathematics
asked Mar 25 '17 at 21:02
ThoralfSkolemThoralfSkolem
1,133615
asked Mar 25 '17 at 21:02
ThoralfSkolemThoralfSkolem
1,133615
edited Dec 28 '18 at 18:16
ThoralfSkolem
asked Mar 25 '17 at 21:02
ThoralfSkolemThoralfSkolem
1,133615
asked Mar 25 '17 at 21:02
ThoralfSkolemThoralfSkolem
1,133615
asked Mar 25 '17 at 21:02
ThoralfSkolemThoralfSkolem
1,133615
1,133615
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Maybe this helps: https://en.wikipedia.org/wiki/Necklace_%28combinatorics%29.
In short:
A finite sequence up to rotational invariance is called "necklace". A finite sequence up to rotation and reflection is called a "bracelet".
answered Mar 25 '17 at 21:43
SimonSimon
2,275216
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
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%2f2202991%2fcombinatorics-terminology-finite-sequence-of-symbols-modulo-reversal%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Maybe this helps: https://en.wikipedia.org/wiki/Necklace_%28combinatorics%29.
In short:
A finite sequence up to rotational invariance is called "necklace". A finite sequence up to rotation and reflection is called a "bracelet".
answered Mar 25 '17 at 21:43
SimonSimon
2,275216
$endgroup$
add a comment |
$begingroup$
Maybe this helps: https://en.wikipedia.org/wiki/Necklace_%28combinatorics%29.
In short:
A finite sequence up to rotational invariance is called "necklace". A finite sequence up to rotation and reflection is called a "bracelet".
answered Mar 25 '17 at 21:43
SimonSimon
2,275216
$endgroup$
add a comment |
$begingroup$
Maybe this helps: https://en.wikipedia.org/wiki/Necklace_%28combinatorics%29.
In short:
A finite sequence up to rotational invariance is called "necklace". A finite sequence up to rotation and reflection is called a "bracelet".
answered Mar 25 '17 at 21:43
SimonSimon
2,275216
$endgroup$
Maybe this helps: https://en.wikipedia.org/wiki/Necklace_%28combinatorics%29.
In short:
A finite sequence up to rotational invariance is called "necklace". A finite sequence up to rotation and reflection is called a "bracelet".
answered Mar 25 '17 at 21:43
SimonSimon
2,275216
answered Mar 25 '17 at 21:43
SimonSimon
2,275216
answered Mar 25 '17 at 21:43
SimonSimon
2,275216
answered Mar 25 '17 at 21:43
SimonSimon
2,275216
2,275216
add a comment |
add a comment |
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%2f2202991%2fcombinatorics-terminology-finite-sequence-of-symbols-modulo-reversal%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
