Remembering Hunter Snevily
نویسندگان
چکیده
With the untimely passing of this still-young mathematician, the world has lost an “original”. Hunter Snevily came to the University of Illinois in the mid-1980s and became only my fifth Ph.D. student, completing his thesis in 1991. I was also young then and learned as much from him as he did from me. Hunter’s main work was in extremal set theory, where he made a significant contribution. As a graduate student, he formulated a conjecture (1991) [29] bounding the size of a family of sets under intersection constraints. He conjectured that if L is a set of k positive integers and {A1, . . . , Am} is a family of subsets of an n-set satisfying |Ai ∩ Aj | ∈ L whenever i 6= j, then
منابع مشابه
Generalized Schur Numbers for x1 + x2 + c = 3x3
Let r(c) be the least positive integer n such that every two coloring of the integers 1, . . . , n contains a monochromatic solution to x1 + x2 + c = 3x3. Verifying a conjecture of Martinelli and Schaal, we prove that r(c) = ⌈ 2⌈ 3 ⌉+ c 3 ⌉
متن کاملRamsey functions for quasi-progressions with large diameter
Several renowned open conjectures in combinatorics and number theory involve arithmetic progressions. Van der Waerden famously proved in 1927 that for each positive integer k there exists a least positive integer w(k) such that any 2-coloring of 1, . . . , w(k) produces a monochromatic k-term arithmetic progression. The best known upper bound for w(k) is due to Gowers and is quite large. Ron Gr...
متن کاملThe α - labeling number of comets is 2
We investigate the claim that for every tree T (with m edges), there exists an α-labeling of T , or else there exists a graph HT with an α-labeling such that HT can be decomposed into two edge-disjoint copies of T . We prove that the above claim is true for comets Cm,2. This is particularly noteworthy since comets Cm,2 are known to have arbitrarily large α-deficits.
متن کاملAntipodal Gray codes
An n-bit Gray code is a circular listing of the 2 n-bit strings so that successive strings differ only in one bit position. An n-bit antipodal Gray code has the additional property that the complement of any string appears exactly n steps away in the list. The problem of determining for which values of n antipodal Gray codes can exist was posed by Hunter Snevily, who showed them to be possible ...
متن کامل