2 citations · 5 across the 7 of their papers we have counts for
7 papers
On large primitive subsets of
Sujith Vijay
A subset of is said to be primitive if it does not contain any pair of elements such that is a divisor of . Let denote the number of primi…
Ramsey Functions for Generalized Progressions
Mano Vikash Janardhanan, Sujith Vijay
Given positive integers and , a -term semi-progression of scope is a sequence such that , f…
Monochromatic Progressions in Random Colorings
Sujith Vijay
Let N^{+}(k)= 2^{k/2} k^{3/2} f(k) and N^{-}(k)= 2^{k/2} k^{1/2} g(k) where 1=o(f(k)) and g(k)=o(1). We show that the probability of a random 2-coloring of {1,2,...,N^{+}(k)} conta…
On Permutations Avoiding Short Progressions
Timothy D. LeSaulnier, Sujith Vijay
We improve the lower bound on the number of permutations of {1,2,...,n} in which no 3-term arithmetic progression occurs as a subsequence, and derive lower bounds on the upper and…
Eleven Euclidean Distances are Enough
Sujith Vijay
The well-known three distance theorem states that there are at most three distinct gaps between consecutive elements in the set of the first n multiples of any real number. We gene…
On The Discrepancy of Quasi-progressions
Sujith Vijay
The 2-colouring discrepancy of arithmetic progressions is a well-known problem in combinatorial discrepancy theory. In 1964, Roth proved that if each integer from 0 to N is coloure…