A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
The length of an s-increasing sequence of r-tuples
[article]

2016
*
arXiv
*
pre-print

We prove a number of results related to a problem of Po-Shen Loh, which is equivalent to a problem in Ramsey theory. Let a=(a_1,a_2,a_3) and b=(b_1,b_2,b_3) be two triples of integers. Define a to be 2-less than b if a_i<b_i for at least two values of i, and define a sequence a^1,...,a^m of triples to be 2-increasing if a^r is 2-less than a^s whenever r<s. Loh asks how long a 2-increasing sequence can be if all the triples take values in {1,2,...,n}, and gives a _* improvement over the trivial

arXiv:1609.08688v2
fatcat:tif7h2xwdffp7iui5eeb3xtvda