Sieve methods in combinatorics
نویسندگان
چکیده
We develop the Turán sieve and a ‘simple sieve’ in the context of bipartite graphs and apply them to various problems in combinatorics. More precisely, we provide applications in the cases of characters of abelian groups, vertex-colourings of graphs, Latin squares, connected graphs, and generators of groups. In addition, we give a spectral interpretation of the Turán sieve. © 2004 Elsevier Inc. All rights reserved.
منابع مشابه
When the Sieve Works
We are interested in classifying those sets of primes P such that when we sieve out the integers up to x by the primes in P we are left with roughly the expected number of unsieved integers. In particular, we obtain the first general results for sieving an interval of length x with primes including some in ( √ x, x], using methods motivated by additive combinatorics.
متن کاملThe Combinatorics behind Number-Theoretic Sieves
Ever since Viggo Brun's pioneering work, number theorists have developed increasingly sophisticated re nements of the sieve of Eratosthenes to attack problems such as the twin prime conjecture and Goldbach's conjecture. Ever since Gian-Carlo Rota's pioneering work, combinatorialists have found more and more areas of combinatorics where sieve methods (or M obius inversion) are applicable. Unfor...
متن کاملWinquist and the Atkin-Swinnerton-Dyer partition congruences for modulus 11
We derive the Atkin–Swinnerton–Dyer partition congruences for the modulus 11 by use of Winquist’s identity. Classification: 11P83
متن کاملA Note on Explicit Ramsey Graphs and Modular Sieves
In a previous work [4] we found a relation between the ranks of codiagonal matrices (matrices with 0's in their diagonal and non-zeroes elsewhere) and the quality of explicit Ramsey-graph constructions. We also gave there a construction based on the BBR-polynomial of Barrington, Beigel and Rudich [1]. In the present work we give another construction for low-rank co-diagonal matrices, based on a...
متن کاملSieve Equivalence in Generalized Partition Theory
The sieve method (principle of inclusion-exclusion) is one of the most powerful tools of combinatorics. Given a set a of objects and a list 9 of properties of those objects, we determine the number N(Y; 2s) of objects in Q whose set of properties contains (those in 9 that are indexed by) the set S. We are then able to find the number of objects that have no properties, exactly k properties, etc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 111 شماره
صفحات -
تاریخ انتشار 2005