Integer but not Laurent sequences
$begingroup$
Are there any sequence given by a recurrence relation:
$x_{n+t}=P(x_t,cdots,x_{t+n-1})$, where $P$ is a positive Laurent Polynomial, satisfy:
if $x_0=cdots=x_{n-1}=1$, then the sequence is only integer;
but does not exhibit Laurent Phenomenon
?
What if we allow $P$ to be a rational function?
ra.rings-and-algebras sequences-and-series cluster-algebras laurent-polynomials
$endgroup$
add a comment |
$begingroup$
Are there any sequence given by a recurrence relation:
$x_{n+t}=P(x_t,cdots,x_{t+n-1})$, where $P$ is a positive Laurent Polynomial, satisfy:
if $x_0=cdots=x_{n-1}=1$, then the sequence is only integer;
but does not exhibit Laurent Phenomenon
?
What if we allow $P$ to be a rational function?
ra.rings-and-algebras sequences-and-series cluster-algebras laurent-polynomials
$endgroup$
2
$begingroup$
Great question! I assume you want $P$ to have positive coefficients, since otherwise $x_n = dfrac{x_{n-1} + x_{n-2} - x_{n-3}}{x_{n-4}}$ is a counterexample (indeed, the general formula for $x_8$ is not a Laurent polynomial, but if $x_0 = x_1 = x_2 = x_3 = 1$, then all values $x_i$ equal $1$).
$endgroup$
– darij grinberg
7 hours ago
$begingroup$
@darij grinberg, thanks, I forgot the positivity
$endgroup$
– Wenze 'Sylvester' Zhang
6 hours ago
add a comment |
$begingroup$
Are there any sequence given by a recurrence relation:
$x_{n+t}=P(x_t,cdots,x_{t+n-1})$, where $P$ is a positive Laurent Polynomial, satisfy:
if $x_0=cdots=x_{n-1}=1$, then the sequence is only integer;
but does not exhibit Laurent Phenomenon
?
What if we allow $P$ to be a rational function?
ra.rings-and-algebras sequences-and-series cluster-algebras laurent-polynomials
$endgroup$
Are there any sequence given by a recurrence relation:
$x_{n+t}=P(x_t,cdots,x_{t+n-1})$, where $P$ is a positive Laurent Polynomial, satisfy:
if $x_0=cdots=x_{n-1}=1$, then the sequence is only integer;
but does not exhibit Laurent Phenomenon
?
What if we allow $P$ to be a rational function?
ra.rings-and-algebras sequences-and-series cluster-algebras laurent-polynomials
ra.rings-and-algebras sequences-and-series cluster-algebras laurent-polynomials
edited 6 hours ago
YCor
27.5k481134
27.5k481134
asked 7 hours ago
Wenze 'Sylvester' ZhangWenze 'Sylvester' Zhang
1006
1006
2
$begingroup$
Great question! I assume you want $P$ to have positive coefficients, since otherwise $x_n = dfrac{x_{n-1} + x_{n-2} - x_{n-3}}{x_{n-4}}$ is a counterexample (indeed, the general formula for $x_8$ is not a Laurent polynomial, but if $x_0 = x_1 = x_2 = x_3 = 1$, then all values $x_i$ equal $1$).
$endgroup$
– darij grinberg
7 hours ago
$begingroup$
@darij grinberg, thanks, I forgot the positivity
$endgroup$
– Wenze 'Sylvester' Zhang
6 hours ago
add a comment |
2
$begingroup$
Great question! I assume you want $P$ to have positive coefficients, since otherwise $x_n = dfrac{x_{n-1} + x_{n-2} - x_{n-3}}{x_{n-4}}$ is a counterexample (indeed, the general formula for $x_8$ is not a Laurent polynomial, but if $x_0 = x_1 = x_2 = x_3 = 1$, then all values $x_i$ equal $1$).
$endgroup$
– darij grinberg
7 hours ago
$begingroup$
@darij grinberg, thanks, I forgot the positivity
$endgroup$
– Wenze 'Sylvester' Zhang
6 hours ago
2
2
$begingroup$
Great question! I assume you want $P$ to have positive coefficients, since otherwise $x_n = dfrac{x_{n-1} + x_{n-2} - x_{n-3}}{x_{n-4}}$ is a counterexample (indeed, the general formula for $x_8$ is not a Laurent polynomial, but if $x_0 = x_1 = x_2 = x_3 = 1$, then all values $x_i$ equal $1$).
$endgroup$
– darij grinberg
7 hours ago
$begingroup$
Great question! I assume you want $P$ to have positive coefficients, since otherwise $x_n = dfrac{x_{n-1} + x_{n-2} - x_{n-3}}{x_{n-4}}$ is a counterexample (indeed, the general formula for $x_8$ is not a Laurent polynomial, but if $x_0 = x_1 = x_2 = x_3 = 1$, then all values $x_i$ equal $1$).
$endgroup$
– darij grinberg
7 hours ago
$begingroup$
@darij grinberg, thanks, I forgot the positivity
$endgroup$
– Wenze 'Sylvester' Zhang
6 hours ago
$begingroup$
@darij grinberg, thanks, I forgot the positivity
$endgroup$
– Wenze 'Sylvester' Zhang
6 hours ago
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
I think you're gonna want to add the assumption that $x_{n}$ grows unboundedly. Even with the positive coefficient condition that Darij suggested, you have examples like $x_4=frac{x_1+x_2}{2x_3}$ that give the constant sequence $1,1,1,ldots$.
(By the way, in class Pasha did suggest that in all "known" or "studied" examples of integrability/non-integrability it suffices to check what happens when you plug in all $1$'s for the initial variables.)
EDIT:
Actually, how about $x_4 = frac{x_1+x_2}{x_3}$?
To me with $x_1=x_2=x_3 =1$ this gives the sequence $1,1,1,2,1,3,1,4,1,5,...$ but it certainly is not Laurent because for instance we have $x_5=frac{x_2x_3+x_3^2}{x_1+x_2}$.
$endgroup$
$begingroup$
Uhm, I wouldn't allow a $2$ in the denominator for a Laurent polynomial -- we're talking integers, right?
$endgroup$
– darij grinberg
6 hours ago
$begingroup$
@darijgrinberg: depends on your definition, I guess, but anyways see my edit.
$endgroup$
– Sam Hopkins
6 hours ago
$begingroup$
Nice counterexample!!
$endgroup$
– darij grinberg
6 hours ago
$begingroup$
You can still ask for "interesting" examples where starting with all $1$'s gives you integers forever but it doe not exhibit the Laurent phenomenon.
$endgroup$
– Sam Hopkins
6 hours ago
$begingroup$
For instance, you can ask that for every $M$, eventually we have all $x_n > M$.
$endgroup$
– Sam Hopkins
6 hours ago
add a comment |
$begingroup$
This reminds me of a question I had seen on both MO and MSE.
Sequence A276175 in the OEIS is defined by
$$a_n = frac{(a_{n-1} + 1)(a_{n-2}+1)(a_{n-3} + 1)}{a_{n-4}}$$
with $a_0 = a_1 = a_2 = a_3 = 1$. The OEIS page conjectures it to be an integer for all $n$. The MSE question contains a proof the all $a_n$ are integer (though I haven't read the proof). In the comments of the MO question it is observed $a_8$ is not Laurent.
$endgroup$
$begingroup$
Great example! Suggests no general result here...
$endgroup$
– Sam Hopkins
5 hours ago
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: "504"
};
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%2fmathoverflow.net%2fquestions%2f323867%2finteger-but-not-laurent-sequences%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
I think you're gonna want to add the assumption that $x_{n}$ grows unboundedly. Even with the positive coefficient condition that Darij suggested, you have examples like $x_4=frac{x_1+x_2}{2x_3}$ that give the constant sequence $1,1,1,ldots$.
(By the way, in class Pasha did suggest that in all "known" or "studied" examples of integrability/non-integrability it suffices to check what happens when you plug in all $1$'s for the initial variables.)
EDIT:
Actually, how about $x_4 = frac{x_1+x_2}{x_3}$?
To me with $x_1=x_2=x_3 =1$ this gives the sequence $1,1,1,2,1,3,1,4,1,5,...$ but it certainly is not Laurent because for instance we have $x_5=frac{x_2x_3+x_3^2}{x_1+x_2}$.
$endgroup$
$begingroup$
Uhm, I wouldn't allow a $2$ in the denominator for a Laurent polynomial -- we're talking integers, right?
$endgroup$
– darij grinberg
6 hours ago
$begingroup$
@darijgrinberg: depends on your definition, I guess, but anyways see my edit.
$endgroup$
– Sam Hopkins
6 hours ago
$begingroup$
Nice counterexample!!
$endgroup$
– darij grinberg
6 hours ago
$begingroup$
You can still ask for "interesting" examples where starting with all $1$'s gives you integers forever but it doe not exhibit the Laurent phenomenon.
$endgroup$
– Sam Hopkins
6 hours ago
$begingroup$
For instance, you can ask that for every $M$, eventually we have all $x_n > M$.
$endgroup$
– Sam Hopkins
6 hours ago
add a comment |
$begingroup$
I think you're gonna want to add the assumption that $x_{n}$ grows unboundedly. Even with the positive coefficient condition that Darij suggested, you have examples like $x_4=frac{x_1+x_2}{2x_3}$ that give the constant sequence $1,1,1,ldots$.
(By the way, in class Pasha did suggest that in all "known" or "studied" examples of integrability/non-integrability it suffices to check what happens when you plug in all $1$'s for the initial variables.)
EDIT:
Actually, how about $x_4 = frac{x_1+x_2}{x_3}$?
To me with $x_1=x_2=x_3 =1$ this gives the sequence $1,1,1,2,1,3,1,4,1,5,...$ but it certainly is not Laurent because for instance we have $x_5=frac{x_2x_3+x_3^2}{x_1+x_2}$.
$endgroup$
$begingroup$
Uhm, I wouldn't allow a $2$ in the denominator for a Laurent polynomial -- we're talking integers, right?
$endgroup$
– darij grinberg
6 hours ago
$begingroup$
@darijgrinberg: depends on your definition, I guess, but anyways see my edit.
$endgroup$
– Sam Hopkins
6 hours ago
$begingroup$
Nice counterexample!!
$endgroup$
– darij grinberg
6 hours ago
$begingroup$
You can still ask for "interesting" examples where starting with all $1$'s gives you integers forever but it doe not exhibit the Laurent phenomenon.
$endgroup$
– Sam Hopkins
6 hours ago
$begingroup$
For instance, you can ask that for every $M$, eventually we have all $x_n > M$.
$endgroup$
– Sam Hopkins
6 hours ago
add a comment |
$begingroup$
I think you're gonna want to add the assumption that $x_{n}$ grows unboundedly. Even with the positive coefficient condition that Darij suggested, you have examples like $x_4=frac{x_1+x_2}{2x_3}$ that give the constant sequence $1,1,1,ldots$.
(By the way, in class Pasha did suggest that in all "known" or "studied" examples of integrability/non-integrability it suffices to check what happens when you plug in all $1$'s for the initial variables.)
EDIT:
Actually, how about $x_4 = frac{x_1+x_2}{x_3}$?
To me with $x_1=x_2=x_3 =1$ this gives the sequence $1,1,1,2,1,3,1,4,1,5,...$ but it certainly is not Laurent because for instance we have $x_5=frac{x_2x_3+x_3^2}{x_1+x_2}$.
$endgroup$
I think you're gonna want to add the assumption that $x_{n}$ grows unboundedly. Even with the positive coefficient condition that Darij suggested, you have examples like $x_4=frac{x_1+x_2}{2x_3}$ that give the constant sequence $1,1,1,ldots$.
(By the way, in class Pasha did suggest that in all "known" or "studied" examples of integrability/non-integrability it suffices to check what happens when you plug in all $1$'s for the initial variables.)
EDIT:
Actually, how about $x_4 = frac{x_1+x_2}{x_3}$?
To me with $x_1=x_2=x_3 =1$ this gives the sequence $1,1,1,2,1,3,1,4,1,5,...$ but it certainly is not Laurent because for instance we have $x_5=frac{x_2x_3+x_3^2}{x_1+x_2}$.
edited 6 hours ago
answered 6 hours ago
Sam HopkinsSam Hopkins
4,53012455
4,53012455
$begingroup$
Uhm, I wouldn't allow a $2$ in the denominator for a Laurent polynomial -- we're talking integers, right?
$endgroup$
– darij grinberg
6 hours ago
$begingroup$
@darijgrinberg: depends on your definition, I guess, but anyways see my edit.
$endgroup$
– Sam Hopkins
6 hours ago
$begingroup$
Nice counterexample!!
$endgroup$
– darij grinberg
6 hours ago
$begingroup$
You can still ask for "interesting" examples where starting with all $1$'s gives you integers forever but it doe not exhibit the Laurent phenomenon.
$endgroup$
– Sam Hopkins
6 hours ago
$begingroup$
For instance, you can ask that for every $M$, eventually we have all $x_n > M$.
$endgroup$
– Sam Hopkins
6 hours ago
add a comment |
$begingroup$
Uhm, I wouldn't allow a $2$ in the denominator for a Laurent polynomial -- we're talking integers, right?
$endgroup$
– darij grinberg
6 hours ago
$begingroup$
@darijgrinberg: depends on your definition, I guess, but anyways see my edit.
$endgroup$
– Sam Hopkins
6 hours ago
$begingroup$
Nice counterexample!!
$endgroup$
– darij grinberg
6 hours ago
$begingroup$
You can still ask for "interesting" examples where starting with all $1$'s gives you integers forever but it doe not exhibit the Laurent phenomenon.
$endgroup$
– Sam Hopkins
6 hours ago
$begingroup$
For instance, you can ask that for every $M$, eventually we have all $x_n > M$.
$endgroup$
– Sam Hopkins
6 hours ago
$begingroup$
Uhm, I wouldn't allow a $2$ in the denominator for a Laurent polynomial -- we're talking integers, right?
$endgroup$
– darij grinberg
6 hours ago
$begingroup$
Uhm, I wouldn't allow a $2$ in the denominator for a Laurent polynomial -- we're talking integers, right?
$endgroup$
– darij grinberg
6 hours ago
$begingroup$
@darijgrinberg: depends on your definition, I guess, but anyways see my edit.
$endgroup$
– Sam Hopkins
6 hours ago
$begingroup$
@darijgrinberg: depends on your definition, I guess, but anyways see my edit.
$endgroup$
– Sam Hopkins
6 hours ago
$begingroup$
Nice counterexample!!
$endgroup$
– darij grinberg
6 hours ago
$begingroup$
Nice counterexample!!
$endgroup$
– darij grinberg
6 hours ago
$begingroup$
You can still ask for "interesting" examples where starting with all $1$'s gives you integers forever but it doe not exhibit the Laurent phenomenon.
$endgroup$
– Sam Hopkins
6 hours ago
$begingroup$
You can still ask for "interesting" examples where starting with all $1$'s gives you integers forever but it doe not exhibit the Laurent phenomenon.
$endgroup$
– Sam Hopkins
6 hours ago
$begingroup$
For instance, you can ask that for every $M$, eventually we have all $x_n > M$.
$endgroup$
– Sam Hopkins
6 hours ago
$begingroup$
For instance, you can ask that for every $M$, eventually we have all $x_n > M$.
$endgroup$
– Sam Hopkins
6 hours ago
add a comment |
$begingroup$
This reminds me of a question I had seen on both MO and MSE.
Sequence A276175 in the OEIS is defined by
$$a_n = frac{(a_{n-1} + 1)(a_{n-2}+1)(a_{n-3} + 1)}{a_{n-4}}$$
with $a_0 = a_1 = a_2 = a_3 = 1$. The OEIS page conjectures it to be an integer for all $n$. The MSE question contains a proof the all $a_n$ are integer (though I haven't read the proof). In the comments of the MO question it is observed $a_8$ is not Laurent.
$endgroup$
$begingroup$
Great example! Suggests no general result here...
$endgroup$
– Sam Hopkins
5 hours ago
add a comment |
$begingroup$
This reminds me of a question I had seen on both MO and MSE.
Sequence A276175 in the OEIS is defined by
$$a_n = frac{(a_{n-1} + 1)(a_{n-2}+1)(a_{n-3} + 1)}{a_{n-4}}$$
with $a_0 = a_1 = a_2 = a_3 = 1$. The OEIS page conjectures it to be an integer for all $n$. The MSE question contains a proof the all $a_n$ are integer (though I haven't read the proof). In the comments of the MO question it is observed $a_8$ is not Laurent.
$endgroup$
$begingroup$
Great example! Suggests no general result here...
$endgroup$
– Sam Hopkins
5 hours ago
add a comment |
$begingroup$
This reminds me of a question I had seen on both MO and MSE.
Sequence A276175 in the OEIS is defined by
$$a_n = frac{(a_{n-1} + 1)(a_{n-2}+1)(a_{n-3} + 1)}{a_{n-4}}$$
with $a_0 = a_1 = a_2 = a_3 = 1$. The OEIS page conjectures it to be an integer for all $n$. The MSE question contains a proof the all $a_n$ are integer (though I haven't read the proof). In the comments of the MO question it is observed $a_8$ is not Laurent.
$endgroup$
This reminds me of a question I had seen on both MO and MSE.
Sequence A276175 in the OEIS is defined by
$$a_n = frac{(a_{n-1} + 1)(a_{n-2}+1)(a_{n-3} + 1)}{a_{n-4}}$$
with $a_0 = a_1 = a_2 = a_3 = 1$. The OEIS page conjectures it to be an integer for all $n$. The MSE question contains a proof the all $a_n$ are integer (though I haven't read the proof). In the comments of the MO question it is observed $a_8$ is not Laurent.
answered 5 hours ago
John MachacekJohn Machacek
4,44211028
4,44211028
$begingroup$
Great example! Suggests no general result here...
$endgroup$
– Sam Hopkins
5 hours ago
add a comment |
$begingroup$
Great example! Suggests no general result here...
$endgroup$
– Sam Hopkins
5 hours ago
$begingroup$
Great example! Suggests no general result here...
$endgroup$
– Sam Hopkins
5 hours ago
$begingroup$
Great example! Suggests no general result here...
$endgroup$
– Sam Hopkins
5 hours ago
add a comment |
Thanks for contributing an answer to MathOverflow!
- 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%2fmathoverflow.net%2fquestions%2f323867%2finteger-but-not-laurent-sequences%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
2
$begingroup$
Great question! I assume you want $P$ to have positive coefficients, since otherwise $x_n = dfrac{x_{n-1} + x_{n-2} - x_{n-3}}{x_{n-4}}$ is a counterexample (indeed, the general formula for $x_8$ is not a Laurent polynomial, but if $x_0 = x_1 = x_2 = x_3 = 1$, then all values $x_i$ equal $1$).
$endgroup$
– darij grinberg
7 hours ago
$begingroup$
@darij grinberg, thanks, I forgot the positivity
$endgroup$
– Wenze 'Sylvester' Zhang
6 hours ago