Description of an Increasing Maximum Value in a Sequence of Integers

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
0
down vote

favorite
1












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:



  1. a value already observed

  2. 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.







share|cite|improve this question























    up vote
    0
    down vote

    favorite
    1












    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:



    1. a value already observed

    2. 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.







    share|cite|improve this question





















      up vote
      0
      down vote

      favorite
      1









      up vote
      0
      down vote

      favorite
      1






      1





      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:



      1. a value already observed

      2. 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.







      share|cite|improve this question











      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:



      1. a value already observed

      2. 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.









      share|cite|improve this question










      share|cite|improve this question




      share|cite|improve this question









      asked Aug 2 at 22:33









      pylang

      1032




      1032




















          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.






          share|cite|improve this answer





















            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',
            convertImagesToLinks: true,
            noModals: false,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: 10,
            bindNavPrevention: true,
            postfix: "",
            noCode: true, onDemand: true,
            discardSelector: ".discard-answer"
            ,immediatelyShowMarkdownHelp:true
            );



            );








             

            draft saved


            draft discarded


















            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






























            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.






            share|cite|improve this answer

























              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.






              share|cite|improve this answer























                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.






                share|cite|improve this answer













                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.







                share|cite|improve this answer













                share|cite|improve this answer



                share|cite|improve this answer











                answered Aug 3 at 0:28









                Ken Tjhia

                307




                307






















                     

                    draft saved


                    draft discarded


























                     


                    draft saved


                    draft discarded














                    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













































































                    Comments

                    Popular posts from this blog

                    What is the equation of a 3D cone with generalised tilt?

                    Color the edges and diagonals of a regular polygon

                    Relationship between determinant of matrix and determinant of adjoint?