In this paper, we prove uniform bounds for $\operatorname {GL}(3)\times \operatorname {GL}(2) \ L$-functions in the $\operatorname {GL}(2)$ spectral aspect and the t aspect by a delta method. More precisely, let $\phi $ be a Hecke–Maass cusp form for $\operatorname {SL}(3,\mathbb {Z})$ and f a Hecke–Maass cusp form for $\operatorname {SL}(2,\mathbb {Z})$ with the spectral parameter $t_f$. Then for $t\in \mathbb {R}$ and any $\varepsilon>0$, we have

$$\begin{align*}L(1/2+it,\phi\times f) \ll_{\phi,\varepsilon} (t_f+|t|)^{27/20+\varepsilon}. \end{align*}$$

$L(1/2+it,\phi \times f)$

$|t|-t_f \gg (|t|+t_f)^{3/5+\varepsilon }$

Looking at Blau-Weiss as the first Zionist youth movement in Germany between 1912 and 1927, the article examines the role of dress in expressing new feelings of national belonging as “Jewish” in modern Germany. Drawing on publications of the movement, memoirs, and photographs, the article shows how Blau-Weiss members tried to become visible as Jews while at the same time trying to copy the dress codes of the nationalist German youth movement Wandervogel. It further shows how, after the First World War, Blau-Weiss tried to forge their own way of Zionist dressing. The article argues that it was not the actual clothes worn or the perception of others that was most crucial to the creation of a national Jewish identity, but rather the inner function that reflections and debates on dress had for Blau-Weiss members in forging and redefining their feelings of belonging and identification as Zionist Jews in Germany.

A random k-out mapping (digraph) on [n] is generated by choosing k random images of each vertex one at a time, subject to a 'preferential attachment' rule: the current vertex selects an image i with probability proportional to a given parameter α = α(n) plus the number of times i has already been selected. Intuitively, the larger α becomes, the closer the resulting k-out mapping is to the uniformly random k-out mapping. We prove that α = Θ(n1/2) is the threshold for α growing 'fast enough' to make the random digraph approach the uniformly random digraph in terms of the total variation distance. We also determine an exact limit for this distance for the α = βn1/2 case.

Records from are analyzed, where {Yj} is an independent sequence of random variables. Each Yj has a continuous distribution function Fj = Fλj for some distribution F and some λ j > 0. We study records, record times and related quantities for this sequence. Depending on the sequence of powers , a wide spectrum of behaviour is exhibited.

In this paper, a concept of nearness convergence is introduced which contains the proximal convergence of Leader as a special case. It is proved that uniform convergence and this nearness convergence are equivalent on totally bounded uniform nearness spaces. One of the features of this convergence is that it lies between uniform convergence and pointwise convergence, and implies uniform convergence on compacta. Some other weaker notions of nearness convergence which are sufficient to preserve nearness maps are also discussed.

Relations between uniform paracompactness and uniform para-Lindelöfness of a uniform space and its uniform weight are established.