Abstract
Recently, I observed that using a combinatorial theorem due to Rado and myself (1) can be considerably improved and it might, in fact, be possible to obtain the correct order of magnitude for ft(n). The combinatorial theorem in question states as follows [2]: Let g(k, t) be the smallest integer so that if A1 , ***, As, s = g (k, t), are sets each having k or fewer elements then there are always t A's Ail, , Ai, which have pairwise the same intersection. We have (2) g(k, t) < k!(t 1)k+1. We conjectured that (2) can be improved to (cl ,c2, are absolute constants) (3) g(k, t) < Clk(t 1)k+l. The conjectured (3) would have applications to several questions in number theory. It is not difficult to show that lim g(k, t)1Ik k=oo
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.