Turtle Race (Or: A Sequence of dependent Integer Series)
while trying to implement a parallel QR decomposition, I was faced with a type of "sequences of integer series" which exceeds my mathematical understanding. So I'm asking You for help.
For a lack of a better name, I've dubbed the problem the "Turte Race", since it somewhat losely reminds me of Zeno's paradoxes. Imagine a race track with:
- $N in mathbb{N}$ lanes and
- a (maximum) track length of $M in mathbb{N}$.
In each lane there's a turtle participating in the "race". The race is "turn-based", i.e.:
- the time $t in mathbb{Z}_{geq 0}$ takes discrete steps.
The progress of $p$ of the turtle in lane $n in {-1, 0, 1, ldots, N-1}$ at time $t$ is discrete as well and is denoted as:
$$p_{n,t} in {0, 1, ldots, M-n-1}$$
For simplicity's sake, there is a pretend turtle that already finished the race with a progress of $M$ at $n=left(-1right)$, i.e.:
$$p_{left(-1right),t} = M$$
All non-pretend turtles start with a progress of zero:
$$p_{n,0}=0 text{ for } n geq 0$$
During each turn of the race, each turtle is advancing by the current floored half of it's distance to its left neighbor:
$$p_{n,t+1} = p_{n,t} + lfloor frac{p_{n-1,t} - p_{n,t}}{2} rfloor text{ for } n geq 0, t geq 0$$
The "race" is finished at time $T$, when the race comes to a halt i.e.:
$$T = T_{M,N} = min_{t} { t in mathbb{Z}_{geq 0} : p_{n,t} = (M-n-1) forall n in {0,1,ldots,N-1} }$$
Since this all quite abstract, I've created a little HTML/JavaScript file where You can play around with different lane counts, track lengths and time steps (works best in Firefox). If You're familiar with JavaScript, You can download the page's source and play around with it as well.
What I am looking for:
A formula for $T_{M,N}$ or an good upper bound of $T_{M,N}$ that can be computed as fast as possible, ideally in $mathcal{O}left(log{M}+log{N}right)$ time with $mathcal{O}left(M_{max} + N_{max}right)$ memory.
What I could find out about the problem so far:
- For a race with a single lane $N=1$, the race duration $T$ is given by:
$$T_{M,1} = lceillog_2{M}rceil leq T_{M,N}$$
- For $M=N$, the series:
$$T_{1,1},T_{2,2},T_{3,3}ldots = 0, 1, 3, 4, 6, 8, 10, 11, ldots$$
seems to correspond to the follwing series in OEIS.
- At least for $N leq M leq 1000$, the following is an upper bound:
$$T_{M,N} leq min{lceillog_2{M}rceil n, left(frac{lceillog_2{M}rceil^2}{3} + 2nright), left(2m - lceillog_2{M}rceil - max{M-N,0}right) }$$
Sadly I have no insights/proofs as to wether or not that is the case for larger $M$.
This is a tough nut to crack... at least for me. Any insights You can give me about this problem would be greatly appreciated.
sequences-and-series
asked 2 days ago
DirkDirk
161
New contributor
Dirk is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
while trying to implement a parallel QR decomposition, I was faced with a type of "sequences of integer series" which exceeds my mathematical understanding. So I'm asking You for help.
For a lack of a better name, I've dubbed the problem the "Turte Race", since it somewhat losely reminds me of Zeno's paradoxes. Imagine a race track with:
- $N in mathbb{N}$ lanes and
- a (maximum) track length of $M in mathbb{N}$.
In each lane there's a turtle participating in the "race". The race is "turn-based", i.e.:
- the time $t in mathbb{Z}_{geq 0}$ takes discrete steps.
The progress of $p$ of the turtle in lane $n in {-1, 0, 1, ldots, N-1}$ at time $t$ is discrete as well and is denoted as:
$$p_{n,t} in {0, 1, ldots, M-n-1}$$
For simplicity's sake, there is a pretend turtle that already finished the race with a progress of $M$ at $n=left(-1right)$, i.e.:
$$p_{left(-1right),t} = M$$
All non-pretend turtles start with a progress of zero:
$$p_{n,0}=0 text{ for } n geq 0$$
During each turn of the race, each turtle is advancing by the current floored half of it's distance to its left neighbor:
$$p_{n,t+1} = p_{n,t} + lfloor frac{p_{n-1,t} - p_{n,t}}{2} rfloor text{ for } n geq 0, t geq 0$$
The "race" is finished at time $T$, when the race comes to a halt i.e.:
$$T = T_{M,N} = min_{t} { t in mathbb{Z}_{geq 0} : p_{n,t} = (M-n-1) forall n in {0,1,ldots,N-1} }$$
Since this all quite abstract, I've created a little HTML/JavaScript file where You can play around with different lane counts, track lengths and time steps (works best in Firefox). If You're familiar with JavaScript, You can download the page's source and play around with it as well.
What I am looking for:
A formula for $T_{M,N}$ or an good upper bound of $T_{M,N}$ that can be computed as fast as possible, ideally in $mathcal{O}left(log{M}+log{N}right)$ time with $mathcal{O}left(M_{max} + N_{max}right)$ memory.
What I could find out about the problem so far:
- For a race with a single lane $N=1$, the race duration $T$ is given by:
$$T_{M,1} = lceillog_2{M}rceil leq T_{M,N}$$
- For $M=N$, the series:
$$T_{1,1},T_{2,2},T_{3,3}ldots = 0, 1, 3, 4, 6, 8, 10, 11, ldots$$
seems to correspond to the follwing series in OEIS.
- At least for $N leq M leq 1000$, the following is an upper bound:
$$T_{M,N} leq min{lceillog_2{M}rceil n, left(frac{lceillog_2{M}rceil^2}{3} + 2nright), left(2m - lceillog_2{M}rceil - max{M-N,0}right) }$$
Sadly I have no insights/proofs as to wether or not that is the case for larger $M$.
This is a tough nut to crack... at least for me. Any insights You can give me about this problem would be greatly appreciated.
sequences-and-series
asked 2 days ago
DirkDirk
161
New contributor
Dirk is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
while trying to implement a parallel QR decomposition, I was faced with a type of "sequences of integer series" which exceeds my mathematical understanding. So I'm asking You for help.
For a lack of a better name, I've dubbed the problem the "Turte Race", since it somewhat losely reminds me of Zeno's paradoxes. Imagine a race track with:
- $N in mathbb{N}$ lanes and
- a (maximum) track length of $M in mathbb{N}$.
In each lane there's a turtle participating in the "race". The race is "turn-based", i.e.:
- the time $t in mathbb{Z}_{geq 0}$ takes discrete steps.
The progress of $p$ of the turtle in lane $n in {-1, 0, 1, ldots, N-1}$ at time $t$ is discrete as well and is denoted as:
$$p_{n,t} in {0, 1, ldots, M-n-1}$$
For simplicity's sake, there is a pretend turtle that already finished the race with a progress of $M$ at $n=left(-1right)$, i.e.:
$$p_{left(-1right),t} = M$$
All non-pretend turtles start with a progress of zero:
$$p_{n,0}=0 text{ for } n geq 0$$
During each turn of the race, each turtle is advancing by the current floored half of it's distance to its left neighbor:
$$p_{n,t+1} = p_{n,t} + lfloor frac{p_{n-1,t} - p_{n,t}}{2} rfloor text{ for } n geq 0, t geq 0$$
The "race" is finished at time $T$, when the race comes to a halt i.e.:
$$T = T_{M,N} = min_{t} { t in mathbb{Z}_{geq 0} : p_{n,t} = (M-n-1) forall n in {0,1,ldots,N-1} }$$
Since this all quite abstract, I've created a little HTML/JavaScript file where You can play around with different lane counts, track lengths and time steps (works best in Firefox). If You're familiar with JavaScript, You can download the page's source and play around with it as well.
What I am looking for:
A formula for $T_{M,N}$ or an good upper bound of $T_{M,N}$ that can be computed as fast as possible, ideally in $mathcal{O}left(log{M}+log{N}right)$ time with $mathcal{O}left(M_{max} + N_{max}right)$ memory.
What I could find out about the problem so far:
- For a race with a single lane $N=1$, the race duration $T$ is given by:
$$T_{M,1} = lceillog_2{M}rceil leq T_{M,N}$$
- For $M=N$, the series:
$$T_{1,1},T_{2,2},T_{3,3}ldots = 0, 1, 3, 4, 6, 8, 10, 11, ldots$$
seems to correspond to the follwing series in OEIS.
- At least for $N leq M leq 1000$, the following is an upper bound:
$$T_{M,N} leq min{lceillog_2{M}rceil n, left(frac{lceillog_2{M}rceil^2}{3} + 2nright), left(2m - lceillog_2{M}rceil - max{M-N,0}right) }$$
Sadly I have no insights/proofs as to wether or not that is the case for larger $M$.
This is a tough nut to crack... at least for me. Any insights You can give me about this problem would be greatly appreciated.
sequences-and-series
asked 2 days ago
DirkDirk
161
New contributor
Dirk is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
while trying to implement a parallel QR decomposition, I was faced with a type of "sequences of integer series" which exceeds my mathematical understanding. So I'm asking You for help.
For a lack of a better name, I've dubbed the problem the "Turte Race", since it somewhat losely reminds me of Zeno's paradoxes. Imagine a race track with:
- $N in mathbb{N}$ lanes and
- a (maximum) track length of $M in mathbb{N}$.
In each lane there's a turtle participating in the "race". The race is "turn-based", i.e.:
- the time $t in mathbb{Z}_{geq 0}$ takes discrete steps.
The progress of $p$ of the turtle in lane $n in {-1, 0, 1, ldots, N-1}$ at time $t$ is discrete as well and is denoted as:
$$p_{n,t} in {0, 1, ldots, M-n-1}$$
For simplicity's sake, there is a pretend turtle that already finished the race with a progress of $M$ at $n=left(-1right)$, i.e.:
$$p_{left(-1right),t} = M$$
All non-pretend turtles start with a progress of zero:
$$p_{n,0}=0 text{ for } n geq 0$$
During each turn of the race, each turtle is advancing by the current floored half of it's distance to its left neighbor:
$$p_{n,t+1} = p_{n,t} + lfloor frac{p_{n-1,t} - p_{n,t}}{2} rfloor text{ for } n geq 0, t geq 0$$
The "race" is finished at time $T$, when the race comes to a halt i.e.:
$$T = T_{M,N} = min_{t} { t in mathbb{Z}_{geq 0} : p_{n,t} = (M-n-1) forall n in {0,1,ldots,N-1} }$$
Since this all quite abstract, I've created a little HTML/JavaScript file where You can play around with different lane counts, track lengths and time steps (works best in Firefox). If You're familiar with JavaScript, You can download the page's source and play around with it as well.
What I am looking for:
A formula for $T_{M,N}$ or an good upper bound of $T_{M,N}$ that can be computed as fast as possible, ideally in $mathcal{O}left(log{M}+log{N}right)$ time with $mathcal{O}left(M_{max} + N_{max}right)$ memory.
What I could find out about the problem so far:
- For a race with a single lane $N=1$, the race duration $T$ is given by:
$$T_{M,1} = lceillog_2{M}rceil leq T_{M,N}$$
- For $M=N$, the series:
$$T_{1,1},T_{2,2},T_{3,3}ldots = 0, 1, 3, 4, 6, 8, 10, 11, ldots$$
seems to correspond to the follwing series in OEIS.
- At least for $N leq M leq 1000$, the following is an upper bound:
$$T_{M,N} leq min{lceillog_2{M}rceil n, left(frac{lceillog_2{M}rceil^2}{3} + 2nright), left(2m - lceillog_2{M}rceil - max{M-N,0}right) }$$
Sadly I have no insights/proofs as to wether or not that is the case for larger $M$.
This is a tough nut to crack... at least for me. Any insights You can give me about this problem would be greatly appreciated.
sequences-and-series
sequences-and-series
asked 2 days ago
DirkDirk
161
New contributor
Dirk is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 2 days ago
DirkDirk
161
New contributor
Dirk is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 2 days ago
DirkDirk
161
New contributor
Dirk is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 2 days ago
DirkDirk
161
asked 2 days ago
DirkDirk
161
161
New contributor
Dirk is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Dirk is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Dirk is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
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
});
}
});
Dirk is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3063177%2fturtle-race-or-a-sequence-of-dependent-integer-series%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
Dirk is a new contributor. Be nice, and check out our Code of Conduct.
Dirk is a new contributor. Be nice, and check out our Code of Conduct.
Dirk is a new contributor. Be nice, and check out our Code of Conduct.
Dirk 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%2f3063177%2fturtle-race-or-a-sequence-of-dependent-integer-series%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
