To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Let p and q be distinct primes. We characterize transitive groups G that admit a complete block system of q blocks of size p such that the subgroup of G which fixes each block set-wise has a Sylow p-subgroup of order p. Using this result, we prove that the full automorphism group of a metacirculant graph Γ of order pq such that Aut(Γ) is imprimitive, is contained in one of several families of transitive groups. As the automorphism groups of vertex-transitive graphs of order pq that are primitive have been determined by several authors, this result implies that automorphism groups of vertex-transitive graphs of order pq are known. We also determine all nonnormal Cayley graphs of order pq, and all 1/2-transitive graphs of order pq.
Let $\cal{B}(n, \leq 4)$ denote the subsets of $[n]:=\{ 1, 2, \dots, n\}$ of at most 4 elements. Suppose that $\cal{F}$ is a set system with the property that every member of $\cal{B}$ can be written as a union of (at most) two members of $\cal{F}$. (Such an $\cal{F}$ is called a 2-base of $\cal{B}$.) Here we answer a question of Erdős proving that \[|\FF|\geq 1+n+\binom{n}{2}- \Bigl\lfloor \frac{4}{3}n\Bigr\rfloor\], and this bound is best possible for $n\geq 8$.
We elucidate the close connection between the repulsive lattice gas in equilibrium statistical mechanics and the Lovász Local Lemma in probabilistic combinatorics. We show that the conclusion of the Lovász Local Lemma holds for dependency graph $G$ and probabilities $\{p_x\}$ if and only if the independent-set polynomial for $G$ is nonvanishing in the polydisc of radii $\{p_x\}$. Furthermore, we show that the usual proof of the Lovász Local Lemma – which provides a sufficient condition for this to occur – corresponds to a simple inductive argument for the nonvanishing of the independent-set polynomial in a polydisc, which was discovered implicitly by Shearer [28] and explicitly by Dobrushin [12, 13]. We also present a generalization of the Lovász Local Lemma that allows for ‘soft’ dependencies. The paper aims to provide an accessible discussion of these results, which are drawn from a longer paper [26] that has appeared elsewhere.
A Hamiltonian cycle in a 3-uniform hypergraph is a cyclic ordering of the vertices in which every three consecutive vertices form an edge. In this paper we prove an approximate and asymptotic version of an analogue of Dirac's celebrated theorem for graphs: for each γ>0 there exists n0 such that every 3-uniform hypergraph on $n\geq n_0$ vertices, in which each pair of vertices belongs to at least $(1/2+\gamma)n$ edges, contains a Hamiltonian cycle.
The main results of this paper are regularity and counting lemmas for 3-uniform hypergraphs. A combination of these two results gives a new proof of a theorem of Frankl and Rödl, of which Szemerédi's theorem for arithmetic progressions of length 4 is a notable consequence. Frankl and Rödl also prove regularity and counting lemmas, but the proofs here, and even the statements, are significantly different. Also included in this paper is a proof of Szemerédi's regularity lemma, some basic facts about quasirandomness for graphs and hypergraphs, and detailed explanations of the motivation for the definitions used.
Nearly a century after the discovery of Brun's sieve, we can look back and see how the subject has developed, and, to some extent, indicate how it may develop in the next 100 years.
One of the dominant themes of the twentieth century number theory has been the ‘modular connection’. In 1955, Yutaka Taniyama (1927–58) first hinted at a connection between elliptic curves and automorphic forms. The Langlands program has absorbed this theme and the connection is expected to hold in a wider context. At the heart of the Langlands program lies the ‘Rankin–Selberg method’, which signals an ‘orthogonality principle’ for automorphic representations on GL(n). This point of view has suggested one mode of generalizing the large sieve inequalities of analytic number theory.
In a series of remarkable papers, H. Iwaniec and his school have developed the ‘modular connection’ and the cognate ‘spectral connection’ as it applies to GL(2) analogues of the large sieve inequality (see, for example,).
In this chapter, we give a brief overview of the work of Duke and Kowalski that suggests a future direction for the large sieve method. No doubt, there will be other directions of development, but the authors do not have a crystal ball to perceive them.
A duality principle
The large sieve inequality can be reduced to a statement in linear algebra, which in turn can be proven using matrix theory.
Viggo Brun (1885–1978) introduced the sieve that now bears his name in 1915 in the paper. It seems that Jean Merlin had made the first serious attempt to go beyond Eratosthenes. Unfortunately, he was killed in World War I (see) and only two of his manuscripts have survived, namely. The latter was prepared for publication by Jacques Hadamard (1865–1963) and published posthumously. Clearly, Brun read Merlin's papers very carefully and was inspired by them. Perhaps he was the only one to have done so. No doubt, this led to his 1915 paper on the subject and later these results were developed into a sophisticated sieve.
In his fundamental work, Brun proved that there are infinitely many integers n such that n and n + 2 have at most nine prime factors. He also showed that all sufficiently large even integers are the sum of two integers, each having at most nine prime factors. These represent tremendous advances towards the twin prime conjecture and the Goldbach conjecture. As a consequence of this work, he deduced that the sum of the reciprocals of the sequence of twin primes converges (see Corollary 5.4.5).
Brun's original papers on the subject were largely ignored. One story reports that Edmund Landau (1877–1938) had not looked at them for eight years, even though they were on his desk. Part of the difficulty lay in the unwieldy notation that Brun had used. Now, 80 years later, the ideas look simple enough and the notation has been streamlined.
It is now nearly 100 years since the birth of modern sieve theory. The theory has had a remarkable development and has emerged as a powerful tool, not only in number theory, but in other branches of mathematics, as well. Until 20 years ago, three sieve methods, namely Brun's sieve, Selberg's sieve and the large sieve of Linnik, could be distinguished as the major pillars of the theory. But after the fundamental work of Deshouillers and Iwaniec in the 1980's, the theory has been linked to the theory of automorphic forms and the fusion is making significant advances in the field.
This monograph is the outgrowth of seminars and graduate courses given by us during the period 1995–2004 at McGill and Queen's Universities in Canada, and Princeton University in the US. Its singular purpose is to acquaint graduate students to the difficult, but extremely beautiful area, and enable them to apply these methods in their research. Hence we do not develop the detailed theory of each sieve method. Rather, we choose the most expedient route to introduce it and quickly indicate various applications. The reader may find in the literature more detailed and encyclopedic accounts of the theory (many of these are listed in the references). Our purpose here is didactic and we hope that many will find the treatment elegant and enjoyable.