Reindexing two lists / flattening indices
$begingroup$
If I have two lists/indiced that run from -N to N, call them A and B. How can I create a third index, C such that C goes from 0 to $(2N+1)^2-1$?
combinatorics
$endgroup$
add a comment |
$begingroup$
If I have two lists/indiced that run from -N to N, call them A and B. How can I create a third index, C such that C goes from 0 to $(2N+1)^2-1$?
combinatorics
$endgroup$
add a comment |
$begingroup$
If I have two lists/indiced that run from -N to N, call them A and B. How can I create a third index, C such that C goes from 0 to $(2N+1)^2-1$?
combinatorics
$endgroup$
If I have two lists/indiced that run from -N to N, call them A and B. How can I create a third index, C such that C goes from 0 to $(2N+1)^2-1$?
combinatorics
combinatorics
asked Jan 17 at 20:15
yankeefan11yankeefan11
1,0041920
1,0041920
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Call $i = -N, -N + 1, cdots, N$ the index of $A$, and $j = -N, -N + 1, cdots, N$ the index of $B$. The index
$$ bbox[5px,border:2px solid blue]
{
k = (i + N)(2N + 1) + (j + N)
}
$$
goes from $k = 0$ for $(i, j) = (-N, -N)$ to $k = 2N(2N + 1) + 2N = (2N + 1)^2 - 1$ for $(i, j) = (N, N)$
$endgroup$
add a comment |
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%2f3077463%2freindexing-two-lists-flattening-indices%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$
Call $i = -N, -N + 1, cdots, N$ the index of $A$, and $j = -N, -N + 1, cdots, N$ the index of $B$. The index
$$ bbox[5px,border:2px solid blue]
{
k = (i + N)(2N + 1) + (j + N)
}
$$
goes from $k = 0$ for $(i, j) = (-N, -N)$ to $k = 2N(2N + 1) + 2N = (2N + 1)^2 - 1$ for $(i, j) = (N, N)$
$endgroup$
add a comment |
$begingroup$
Call $i = -N, -N + 1, cdots, N$ the index of $A$, and $j = -N, -N + 1, cdots, N$ the index of $B$. The index
$$ bbox[5px,border:2px solid blue]
{
k = (i + N)(2N + 1) + (j + N)
}
$$
goes from $k = 0$ for $(i, j) = (-N, -N)$ to $k = 2N(2N + 1) + 2N = (2N + 1)^2 - 1$ for $(i, j) = (N, N)$
$endgroup$
add a comment |
$begingroup$
Call $i = -N, -N + 1, cdots, N$ the index of $A$, and $j = -N, -N + 1, cdots, N$ the index of $B$. The index
$$ bbox[5px,border:2px solid blue]
{
k = (i + N)(2N + 1) + (j + N)
}
$$
goes from $k = 0$ for $(i, j) = (-N, -N)$ to $k = 2N(2N + 1) + 2N = (2N + 1)^2 - 1$ for $(i, j) = (N, N)$
$endgroup$
Call $i = -N, -N + 1, cdots, N$ the index of $A$, and $j = -N, -N + 1, cdots, N$ the index of $B$. The index
$$ bbox[5px,border:2px solid blue]
{
k = (i + N)(2N + 1) + (j + N)
}
$$
goes from $k = 0$ for $(i, j) = (-N, -N)$ to $k = 2N(2N + 1) + 2N = (2N + 1)^2 - 1$ for $(i, j) = (N, N)$
answered Jan 17 at 20:34
caveraccaverac
14.8k31130
14.8k31130
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%2f3077463%2freindexing-two-lists-flattening-indices%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