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.
A subset X of a Polish group G is Haar null if there exists a Borel probability measure μ and a Borel set B containing X such that μ(gBh) = 0 for every g, h ∈ G. A set X is Haar meager if there exists a compact metric space K, a continuous function f : K → G and a Borel set B containing X such that f−1(gBh) is meager in K for every g, h ∈ G. We calculate (in ZFC) the four cardinal invariants (add, cov, non, cof) of these two σ-ideals for the simplest non-locally compact Polish group, namely in the case $G = \mathbb {Z}^\omega$. In fact, most results work for separable Banach spaces as well, and many results work for Polish groups admitting a two-sided invariant metric. This answers a question of the first named author and Vidnyánszky.
It is known that for Kn,n equipped with i.i.d. exp (1) edge costs, the minimum total cost of a perfect matching converges to $\zeta(2)=\pi^2/6$ in probability. Similar convergence has been established for all edge cost distributions of pseudo-dimension$q \geq 1$. In this paper we extend those results to all real positive q, confirming the Mézard–Parisi conjecture in the last remaining applicable case.
A k-permutation family on n vertices is a set-system consisting of the intervals of k permutations of the integers 1 to n. The discrepancy of a set-system is the minimum over all red–blue vertex colourings of the maximum difference between the number of red and blue vertices in any set in the system. In 2011, Newman and Nikolov disproved a conjecture of Beck that the discrepancy of any 3-permutation family is at most a constant independent of n. Here we give a simpler proof that Newman and Nikolov’s sequence of 3-permutation families has discrepancy $\Omega (\log \,n)$. We also exhibit a sequence of 6-permutation families with root-mean-squared discrepancy $\Omega (\sqrt {\log \,n} )$; that is, in any red–blue vertex colouring, the square root of the expected squared difference between the number of red and blue vertices in an interval of the system is $\Omega (\sqrt {\log \,n} )$.
This book provides a complete and reasonably self-contained account of a new classification of connected Lie groups into two classes. The first part describes the use of tools from potential theory to establish the classification and to show that the analytic and algebraic approaches to the classification are equivalent. Part II covers geometric theory of the same classification and a proof that it is equivalent to the algebraic approach. Part III is a new approach to the geometric classification that requires more advanced geometric technology, namely homotopy, homology and the theory of currents. Using these methods, a more direct, but also more sophisticated, approach to the equivalence of the geometric and algebraic classification is made. Background material is introduced gradually to familiarise readers with ideas from areas such as Lie groups, differential topology and probability, in particular, random walks on groups. Numerous open problems inspire students to explore further.