Description of an Increasing Maximum Value in a Sequence of Integers
Clash Royale CLAN TAG#URR8PPP
up vote
0
down vote
favorite
I came across this sequence when visiting the Longest increasing subsequence problem. In particular, this implementation. I will demonstrate the observation below:
Given
Here we have a sequence of integers:
[0, 1, 1, 2, 1, 2, 2, 3, 1, 3, 2, 5, 2, 3, 7, 6]
Notice from left to right, at each position, the next number is either:
- a value already observed
- a number larger than the maximum value observed
Thus the following pattern is invalid:
[0, 5, 1, ...]
as the value after 5 must be observed prior or larger than 5.
Question
What is the mathematical term of such a sequence? If no exact term is defined, how might this be formally described? The sequence is not strictly monotonic, but the maximum appears to be monotonically increasing.
sequences-and-series
add a comment |Â
up vote
0
down vote
favorite
I came across this sequence when visiting the Longest increasing subsequence problem. In particular, this implementation. I will demonstrate the observation below:
Given
Here we have a sequence of integers:
[0, 1, 1, 2, 1, 2, 2, 3, 1, 3, 2, 5, 2, 3, 7, 6]
Notice from left to right, at each position, the next number is either:
- a value already observed
- a number larger than the maximum value observed
Thus the following pattern is invalid:
[0, 5, 1, ...]
as the value after 5 must be observed prior or larger than 5.
Question
What is the mathematical term of such a sequence? If no exact term is defined, how might this be formally described? The sequence is not strictly monotonic, but the maximum appears to be monotonically increasing.
sequences-and-series
add a comment |Â
up vote
0
down vote
favorite
up vote
0
down vote
favorite
I came across this sequence when visiting the Longest increasing subsequence problem. In particular, this implementation. I will demonstrate the observation below:
Given
Here we have a sequence of integers:
[0, 1, 1, 2, 1, 2, 2, 3, 1, 3, 2, 5, 2, 3, 7, 6]
Notice from left to right, at each position, the next number is either:
- a value already observed
- a number larger than the maximum value observed
Thus the following pattern is invalid:
[0, 5, 1, ...]
as the value after 5 must be observed prior or larger than 5.
Question
What is the mathematical term of such a sequence? If no exact term is defined, how might this be formally described? The sequence is not strictly monotonic, but the maximum appears to be monotonically increasing.
sequences-and-series
I came across this sequence when visiting the Longest increasing subsequence problem. In particular, this implementation. I will demonstrate the observation below:
Given
Here we have a sequence of integers:
[0, 1, 1, 2, 1, 2, 2, 3, 1, 3, 2, 5, 2, 3, 7, 6]
Notice from left to right, at each position, the next number is either:
- a value already observed
- a number larger than the maximum value observed
Thus the following pattern is invalid:
[0, 5, 1, ...]
as the value after 5 must be observed prior or larger than 5.
Question
What is the mathematical term of such a sequence? If no exact term is defined, how might this be formally described? The sequence is not strictly monotonic, but the maximum appears to be monotonically increasing.
sequences-and-series
asked Aug 2 at 22:33


pylang
1032
1032
add a comment |Â
add a comment |Â
1 Answer
1
active
oldest
votes
up vote
0
down vote
I don't know of any name for it, but you could formally define such a sequence as: $(a_n)$ where $a_i in mathbbZ$ and $a_i geq a_j$ whenever $i > j$. Of course you could specify bounds on the indices if the sequence it finite. Also it follows from this that the first element is the smallest element.
add a comment |Â
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
0
down vote
I don't know of any name for it, but you could formally define such a sequence as: $(a_n)$ where $a_i in mathbbZ$ and $a_i geq a_j$ whenever $i > j$. Of course you could specify bounds on the indices if the sequence it finite. Also it follows from this that the first element is the smallest element.
add a comment |Â
up vote
0
down vote
I don't know of any name for it, but you could formally define such a sequence as: $(a_n)$ where $a_i in mathbbZ$ and $a_i geq a_j$ whenever $i > j$. Of course you could specify bounds on the indices if the sequence it finite. Also it follows from this that the first element is the smallest element.
add a comment |Â
up vote
0
down vote
up vote
0
down vote
I don't know of any name for it, but you could formally define such a sequence as: $(a_n)$ where $a_i in mathbbZ$ and $a_i geq a_j$ whenever $i > j$. Of course you could specify bounds on the indices if the sequence it finite. Also it follows from this that the first element is the smallest element.
I don't know of any name for it, but you could formally define such a sequence as: $(a_n)$ where $a_i in mathbbZ$ and $a_i geq a_j$ whenever $i > j$. Of course you could specify bounds on the indices if the sequence it finite. Also it follows from this that the first element is the smallest element.
answered Aug 3 at 0:28
Ken Tjhia
307
307
add a comment |Â
add a comment |Â
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
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2870554%2fdescription-of-an-increasing-maximum-value-in-a-sequence-of-integers%23new-answer', 'question_page');
);
Post as a guest
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
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
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