Balanced Word to Balanced (Sturmian?) Sequence
$begingroup$
Let $E in {0,1}^{n}, nin mathbb{N}$, be a balanced finite word: for every two subwords $U,V$ of the same length, the number of $1$'s in $U$ differs from the number of $1$'s in $V$ by at most one.
- Can $E$ be continued to an infinite balanced sequence?
- Can $E$ be continued to an infinite Sturmian sequence? (A subcase of the previous question.)
Furthermore, in both cases, what is the cardinality of the set of possible extensions of $E$?
This came up when I tried to solve an exercise, where I have to show that Sturmian sequences are dense in the space of balanced sequences (with regard to the usual topology of symbolic dynamics) - if the the answer to the second question is "yes", than we can take any prefix of length $n$ of a balanced sequence, continue it to a Sturmian sequence, and get by the definition of the metric that the distance between the two sequences is $leq frac{1}{2^n}$.
general-topology dynamical-systems combinatorics-on-words
asked Dec 6 '18 at 8:30
co.sineco.sine
362112
$endgroup$
add a comment |
$begingroup$
Let $E in {0,1}^{n}, nin mathbb{N}$, be a balanced finite word: for every two subwords $U,V$ of the same length, the number of $1$'s in $U$ differs from the number of $1$'s in $V$ by at most one.
- Can $E$ be continued to an infinite balanced sequence?
- Can $E$ be continued to an infinite Sturmian sequence? (A subcase of the previous question.)
Furthermore, in both cases, what is the cardinality of the set of possible extensions of $E$?
This came up when I tried to solve an exercise, where I have to show that Sturmian sequences are dense in the space of balanced sequences (with regard to the usual topology of symbolic dynamics) - if the the answer to the second question is "yes", than we can take any prefix of length $n$ of a balanced sequence, continue it to a Sturmian sequence, and get by the definition of the metric that the distance between the two sequences is $leq frac{1}{2^n}$.
general-topology dynamical-systems combinatorics-on-words
asked Dec 6 '18 at 8:30
co.sineco.sine
362112
$endgroup$
add a comment |
$begingroup$
Let $E in {0,1}^{n}, nin mathbb{N}$, be a balanced finite word: for every two subwords $U,V$ of the same length, the number of $1$'s in $U$ differs from the number of $1$'s in $V$ by at most one.
- Can $E$ be continued to an infinite balanced sequence?
- Can $E$ be continued to an infinite Sturmian sequence? (A subcase of the previous question.)
Furthermore, in both cases, what is the cardinality of the set of possible extensions of $E$?
This came up when I tried to solve an exercise, where I have to show that Sturmian sequences are dense in the space of balanced sequences (with regard to the usual topology of symbolic dynamics) - if the the answer to the second question is "yes", than we can take any prefix of length $n$ of a balanced sequence, continue it to a Sturmian sequence, and get by the definition of the metric that the distance between the two sequences is $leq frac{1}{2^n}$.
general-topology dynamical-systems combinatorics-on-words
asked Dec 6 '18 at 8:30
co.sineco.sine
362112
$endgroup$
Let $E in {0,1}^{n}, nin mathbb{N}$, be a balanced finite word: for every two subwords $U,V$ of the same length, the number of $1$'s in $U$ differs from the number of $1$'s in $V$ by at most one.
- Can $E$ be continued to an infinite balanced sequence?
- Can $E$ be continued to an infinite Sturmian sequence? (A subcase of the previous question.)
Furthermore, in both cases, what is the cardinality of the set of possible extensions of $E$?
This came up when I tried to solve an exercise, where I have to show that Sturmian sequences are dense in the space of balanced sequences (with regard to the usual topology of symbolic dynamics) - if the the answer to the second question is "yes", than we can take any prefix of length $n$ of a balanced sequence, continue it to a Sturmian sequence, and get by the definition of the metric that the distance between the two sequences is $leq frac{1}{2^n}$.
general-topology dynamical-systems combinatorics-on-words
general-topology dynamical-systems combinatorics-on-words
asked Dec 6 '18 at 8:30
co.sineco.sine
362112
asked Dec 6 '18 at 8:30
co.sineco.sine
362112
edited Dec 8 '18 at 9:45
co.sine
asked Dec 6 '18 at 8:30
co.sineco.sine
362112
asked Dec 6 '18 at 8:30
co.sineco.sine
362112
asked Dec 6 '18 at 8:30
co.sineco.sine
362112
362112
add a comment |
add a comment |
0
active
oldest
votes
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%2f3028224%2fbalanced-word-to-balanced-sturmian-sequence%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%2f3028224%2fbalanced-word-to-balanced-sturmian-sequence%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
