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.
Given a finite set $A \subseteq \mathbb{R}^d$, points $a_1,a_2,\dotsc,a_{\ell} \in A$ form an $\ell$-hole in A if they are the vertices of a convex polytope, which contains no points of A in its interior. We construct arbitrarily large point sets in general position in $\mathbb{R}^d$ having no holes of size $O(4^dd\log d)$ or more. This improves the previously known upper bound of order $d^{d+o(d)}$ due to Valtr. The basic version of our construction uses a certain type of equidistributed point sets, originating from numerical analysis, known as (t,m,s)-nets or (t,s)-sequences, yielding a bound of $2^{7d}$. The better bound is obtained using a variant of (t,m,s)-nets, obeying a relaxed equidistribution condition.
A (not necessarily proper) vertex colouring of a graph has clustering c if every monochromatic component has at most c vertices. We prove that planar graphs with maximum degree $\Delta$ are 3-colourable with clustering $O(\Delta^2)$. The previous best bound was $O(\Delta^{37})$. This result for planar graphs generalises to graphs that can be drawn on a surface of bounded Euler genus with a bounded number of crossings per edge. We then prove that graphs with maximum degree $\Delta$ that exclude a fixed minor are 3-colourable with clustering $O(\Delta^5)$. The best previous bound for this result was exponential in $\Delta$.
Understanding the underlying principles of statistical techniques and effectively applying statistical methods can be challenging for researchers at all stages of their career. This concise, practical guide uses a simple, engaging approach to take scientists and clinicians working in laboratory-based life science and medical research through the steps of choosing and implementing appropriate statistical methods to analyse results. The author draws on her extensive experience of advising students and researchers over the past 30 years, breaking down complex concepts into easy-to-understand units. Practical examples using free online statistical tools are included throughout, with illustrations and diagrams employed to keep jargon to a minimum. Sample size calculations and considerations are covered in depth, and the book refers to types of data from experiments that clinicians and lab-based scientists are likely to encounter. Straightforward, accessible and encouraging throughout, this is a go-to reference for researchers who want to achieve statistical autonomy.
This chapter contains counterexamples on various modes of convergence, e.g. almost everywhere (uniform) convergence, convergence in measure, convergence in Lp, convergence in probability.
This chapter is a brief reminder of point-set topology including examples of the most prominent topologies needed later on in the text. Further topics include ordinal numbers and the ordinal space (as a topological space), cardinality and counting and the construction of the Cantor middle-thirds set and the Cantor function (devil’s staircase) and its inverse function.