Can all of the first and second differences of a Costas array be at least 3 in magnitude?
A Costas array $pi = d_1 d_2 ldots d_n$ (one-line form) of order $n$ is a permutation $pi in S_n$ such that the $n-r$ differences
$d_{r+1} - d_{1} , d_{r+2} - d_{2} , ldots , d_n - d_{n-r}$
are distinct for each $r$ , $1 leq r leq n-1$.
Find an example of a Costas array $pi$ for some $n$ such that the $2n-3$ inequalities
$|d_2 - d_1| , |d_3 - d_2| , ldots , |d_n - d_{n-1}| geq 3$
and
$|d_3 - d_1| , |d_4 - d_2| , ldots , |d_n - d_{n-2}| geq 3$
hold or else prove that no such permutation exists.
Remarks: No such Costas arrays have been found using Beard's database of Costas arrays out to order $1030$ (the database is available at https://ieee-dataport.org/open-access/costas-arrays-and-enumeration-order-1030 and is exhaustive out to order $29$.) Costas arrays are known to exist for infinitely many (but not all) orders by constructions involving the infinitude of primes.
combinatorics discrete-mathematics permutations
asked Nov 26 at 16:58
Bill
194
add a comment |
A Costas array $pi = d_1 d_2 ldots d_n$ (one-line form) of order $n$ is a permutation $pi in S_n$ such that the $n-r$ differences
$d_{r+1} - d_{1} , d_{r+2} - d_{2} , ldots , d_n - d_{n-r}$
are distinct for each $r$ , $1 leq r leq n-1$.
Find an example of a Costas array $pi$ for some $n$ such that the $2n-3$ inequalities
$|d_2 - d_1| , |d_3 - d_2| , ldots , |d_n - d_{n-1}| geq 3$
and
$|d_3 - d_1| , |d_4 - d_2| , ldots , |d_n - d_{n-2}| geq 3$
hold or else prove that no such permutation exists.
Remarks: No such Costas arrays have been found using Beard's database of Costas arrays out to order $1030$ (the database is available at https://ieee-dataport.org/open-access/costas-arrays-and-enumeration-order-1030 and is exhaustive out to order $29$.) Costas arrays are known to exist for infinitely many (but not all) orders by constructions involving the infinitude of primes.
combinatorics discrete-mathematics permutations
asked Nov 26 at 16:58
Bill
194
You said $n=11$ doesn't work. What am I missing here: 1 4 7 10 2 5 8 11 3 6 9?
– Todor Markov
Nov 26 at 17:15
1
Ach! I found a flaw in my verification code. Todor Markov your example does work. I am also interested in the same question for the restricted class of permutations known as Costas arrays. I will make the appropriate edits. Thank you.
– Bill
Nov 26 at 18:01
add a comment |
A Costas array $pi = d_1 d_2 ldots d_n$ (one-line form) of order $n$ is a permutation $pi in S_n$ such that the $n-r$ differences
$d_{r+1} - d_{1} , d_{r+2} - d_{2} , ldots , d_n - d_{n-r}$
are distinct for each $r$ , $1 leq r leq n-1$.
Find an example of a Costas array $pi$ for some $n$ such that the $2n-3$ inequalities
$|d_2 - d_1| , |d_3 - d_2| , ldots , |d_n - d_{n-1}| geq 3$
and
$|d_3 - d_1| , |d_4 - d_2| , ldots , |d_n - d_{n-2}| geq 3$
hold or else prove that no such permutation exists.
Remarks: No such Costas arrays have been found using Beard's database of Costas arrays out to order $1030$ (the database is available at https://ieee-dataport.org/open-access/costas-arrays-and-enumeration-order-1030 and is exhaustive out to order $29$.) Costas arrays are known to exist for infinitely many (but not all) orders by constructions involving the infinitude of primes.
combinatorics discrete-mathematics permutations
asked Nov 26 at 16:58
Bill
194
A Costas array $pi = d_1 d_2 ldots d_n$ (one-line form) of order $n$ is a permutation $pi in S_n$ such that the $n-r$ differences
$d_{r+1} - d_{1} , d_{r+2} - d_{2} , ldots , d_n - d_{n-r}$
are distinct for each $r$ , $1 leq r leq n-1$.
Find an example of a Costas array $pi$ for some $n$ such that the $2n-3$ inequalities
$|d_2 - d_1| , |d_3 - d_2| , ldots , |d_n - d_{n-1}| geq 3$
and
$|d_3 - d_1| , |d_4 - d_2| , ldots , |d_n - d_{n-2}| geq 3$
hold or else prove that no such permutation exists.
Remarks: No such Costas arrays have been found using Beard's database of Costas arrays out to order $1030$ (the database is available at https://ieee-dataport.org/open-access/costas-arrays-and-enumeration-order-1030 and is exhaustive out to order $29$.) Costas arrays are known to exist for infinitely many (but not all) orders by constructions involving the infinitude of primes.
combinatorics discrete-mathematics permutations
combinatorics discrete-mathematics permutations
asked Nov 26 at 16:58
Bill
194
asked Nov 26 at 16:58
Bill
194
edited Nov 26 at 18:29
asked Nov 26 at 16:58
Bill
194
asked Nov 26 at 16:58
Bill
194
asked Nov 26 at 16:58
Bill
194
194
You said $n=11$ doesn't work. What am I missing here: 1 4 7 10 2 5 8 11 3 6 9?
– Todor Markov
Nov 26 at 17:15
1
Ach! I found a flaw in my verification code. Todor Markov your example does work. I am also interested in the same question for the restricted class of permutations known as Costas arrays. I will make the appropriate edits. Thank you.
– Bill
Nov 26 at 18:01
add a comment |
You said $n=11$ doesn't work. What am I missing here: 1 4 7 10 2 5 8 11 3 6 9?
– Todor Markov
Nov 26 at 17:15
1
Ach! I found a flaw in my verification code. Todor Markov your example does work. I am also interested in the same question for the restricted class of permutations known as Costas arrays. I will make the appropriate edits. Thank you.
– Bill
Nov 26 at 18:01
You said $n=11$ doesn't work. What am I missing here: 1 4 7 10 2 5 8 11 3 6 9?
– Todor Markov
Nov 26 at 17:15
You said $n=11$ doesn't work. What am I missing here: 1 4 7 10 2 5 8 11 3 6 9?
– Todor Markov
Nov 26 at 17:15
1
1
Ach! I found a flaw in my verification code. Todor Markov your example does work. I am also interested in the same question for the restricted class of permutations known as Costas arrays. I will make the appropriate edits. Thank you.
– Bill
Nov 26 at 18:01
Ach! I found a flaw in my verification code. Todor Markov your example does work. I am also interested in the same question for the restricted class of permutations known as Costas arrays. I will make the appropriate edits. Thank you.
– Bill
Nov 26 at 18:01
add a comment |
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%2f3014582%2fcan-all-of-the-first-and-second-differences-of-a-costas-array-be-at-least-3-in-m%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
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.
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%2f3014582%2fcan-all-of-the-first-and-second-differences-of-a-costas-array-be-at-least-3-in-m%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
You said $n=11$ doesn't work. What am I missing here: 1 4 7 10 2 5 8 11 3 6 9?
– Todor Markov
Nov 26 at 17:15
1
Ach! I found a flaw in my verification code. Todor Markov your example does work. I am also interested in the same question for the restricted class of permutations known as Costas arrays. I will make the appropriate edits. Thank you.
– Bill
Nov 26 at 18:01