This paper examines the containment and covering of people and objects in burials throughout later prehistory in Britain. Recent analyses of grave assemblages with exceptionally well-preserved organic remains have revealed some of the particular roles played by covers in funerary contexts. Beyond these spectacular examples, however, the objects involved in covering and containing have largely been overlooked. Many of the ‘motley crew’ of pots and stones used to wrap, cover, and contain bodies (and objects) were discarded or destroyed by antiquarian investigators in their quest for more immediately dazzling items. Organic containers and covers – bags, coffins, shrouds, blankets – are rarely preserved. Our study brings together the diverse and often elusive objects that played a part in covering and containing prehistoric burials, including items that directly enclosed bodies and objects, and those that potentially pinned together (now mostly absent) organic wraps. Overall, we contend, wrapping, covering, and containing were significantly more prevalent in prehistoric funerary practices than has previously been recognised.

It is shown that the unit ball in ${{\mathbb{C}}^{n}}$ is the only complexmanifold that can universally cover both Stein and non-Stein strictly pseudoconvex domains.

We investigate topological realizations of higher-rank graphs. We show that the fundamental group of a higher-rank graph coincides with the fundamental group of its topological realization. We also show that topological realization of higher-rank graphs is a functor and that for each higher-rank graph Λ, this functor determines a category equivalence between the category of coverings of Λ and the category of coverings of its topological realization. We discuss how topological realization relates to two standard constructions for k-graphs: projective limits and crossed products by finitely generated free abelian groups.

In the field, both covering materials and shelters are commonly available to sea urchins. The behavioural decision between covering and sheltering thus obviously exists. However, no information is available on the preference between the two natural behaviours. Two conditions were designed with covering and sheltering materials to comparatively describe the diel trade-off between covering and sheltering behaviours in male and female Strongylocentrotus intermedius. In the present study S. intermedius had an obvious diel trade-off between covering and sheltering behaviours, preferring covering over sheltering when both behaviours were possible. Sex did not significantly affect the trade-off between the two behaviours, no matter whether covering materials were inside or outside the shelters. The rhythm of covering behaviour was not well correlated with intensity of light in the trade-off with sheltering behaviour. The present study provides new insights into behavioural ecology of sea urchins.

Let G be a finite group. A subset X of G is a set of pairwise noncommuting elements if any two distinct elements of X do not commute. In this paper we determine the maximum size of these subsets in any finite nonabelian metacyclic p-group for an odd prime p.

Consider a projective limit G of finite groups Gn. Fix a compatible family δn of coactions of the Gn on a C*-algebra A. From this data we obtain a coaction δ of G on A. We show that the coaction crossed product of A by δ is isomorphic to a direct limit of the coaction crossed products of A by the δn. If A=C*(Λ) for some k-graph Λ, and if the coactions δn correspond to skew-products of Λ, then we can say more. We prove that the coaction crossed product of C*(Λ) by δ may be realized as a full corner of the C*-algebra of a (k+1)-graph. We then explore connections with Yeend’s topological higher-rank graphs and their C*-algebras.

We apply the methods developed in our previous work to study holomorphic functions of slow growth on coverings of pseudoconvex domains in Stein manifolds. In particular, we extend and strengthen certain results of Gromov, Henkin and Shubin on holomorphic $L^{2}$ functions on coverings of pseudoconvex manifolds in the case of coverings of Stein manifolds.

In the paper we formulate a Covering Property Axiom, $\text{CP}{{\text{A}}_{\text{prism}}}$, which holds in the iterated perfect set model, and show that it implies the following facts, of which (a) and (b) are the generalizations of results of J. Steprāns.

(a) There exists a family $\mathcal{F}$ of less than continuum many ${{C}^{1}}$ functions from $\mathbb{R}$ to $\mathbb{R}$ such that ${{\mathbb{R}}^{2}}$ is covered by functions from $\mathcal{F}$, in the sense that for every $\left\langle x,\,y \right\rangle \,\in \,{{\mathbb{R}}^{2}}$${{\mathbb{R}}^{2}}$ there exists an $f\,\in \,\mathcal{F}$ such that either $f\left( x \right)\,=\,y$ or $f\left( y \right)\,=\,x$.

(b) For every Borel function $f:\,\mathbb{R}\,\to \,\mathbb{R}$ there exists a family $\mathcal{F}$ of less than continuum many “${{C}^{1}}$” functions (i.e., differentiable functions with continuous derivatives, where derivative can be infinite) whose graphs cover the graph of $f$.

(c) For every $n\,>\,0$ and a ${{D}^{n}}$ function $f:\,\mathbb{R}\,\to \,\mathbb{R}$ there exists a family $\mathcal{F}$ of less than continuum many ${{C}^{n}}$ functions whose graphs cover the graph of $f$.

We also provide the examples showing that in the above properties the smoothness conditions are the best possible. Parts (b), (c), and the examples are closely related to work of A. Olevskiî.

Consider a circle of circumference 1. Throw n points at random onto this circle and append to each of these points a clockwise arc of length s. The resulting random set is a union of a random number of connected components, each with specific size. Using tools designed by Steutel, we compute the joint distribution of the lengths of the connected components. Asymptotic results are presented when n goes to ∞ and s to 0 jointly according to different regimes.

The covering relation in the lattice of subuniverses of a finite distributive lattices is characterized in terms of how new elements in a covering sublattice fit with the sublattice covered. In general, although the lattice of subuniverses of a finite distributive lattice will not be modular, nevertheless we are able to show that certain instances of Dedekind's Transposition Principle still hold. Weakly independent maps play a key role in our arguments.