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.
There was an incorrect argument in the proof of the main theorem in ‘On percolation and the bunkbed conjecture’, in Combin. Probab. Comput. (2011) 20 103–117 doi: 10.1017/S0963548309990666. I thus no longer claim to have a proof for the bunkbed conjecture for outerplanar graphs.
Over 100 years ago Harald Bohr identified a deep problem about the convergence of Dirichlet series, and introduced an ingenious idea relating Dirichlet series and holomorphic functions in high dimensions. Elaborating on this work, almost twnety years later Bohnenblust and Hille solved the problem posed by Bohr. In recent years there has been a substantial revival of interest in the research area opened up by these early contributions. This involves the intertwining of the classical work with modern functional analysis, harmonic analysis, infinite dimensional holomorphy and probability theory as well as analytic number theory. New challenging research problems have crystallized and been solved in recent decades. The goal of this book is to describe in detail some of the key elements of this new research area to a wide audience. The approach is based on three pillars: Dirichlet series, infinite dimensional holomorphy and harmonic analysis.
The present paper concerns the system ut + [ϕ(u)]x = 0, vt + [ψ(u)v]x = 0 having distributions as initial conditions. Under certain conditions, and supposing ϕ, ψ: ℝ → ℝ functions, we explicitly solve this Cauchy problem within a convenient space of distributions u,v. For this purpose, a consistent extension of the classical solution concept defined in the setting of a distributional product (not constructed by approximation processes) is used. Shock waves, δ-shock waves, and also waves defined by distributions that are not measures are presented explicitly as examples. This study is carried out without assuming classical results about conservation laws. For reader's convenience, a brief survey of the distributional product is also included.
We study class 𝒮 for locally compact groups. We characterize locally compact groups in this class as groups having an amenable action on a boundary that is small at infinity, generalizing a theorem of Ozawa. Using this characterization, we provide new examples of groups in class 𝒮 and prove a unique prime factorization theorem for group von Neumann algebras of products of locally compact groups in this class. We also prove that class 𝒮 is a measure equivalence invariant.
In this paper, we consider a kind of ideal quotient of an extriangulated category such that the ideal is the kernel of a functor from this extriangulated category to an abelian category. We study a condition when the functor is dense and full, in another word, the ideal quotient becomes abelian. Moreover, a new equivalent characterization of cluster tilting subcategories is given by applying homological methods according to this functor. As an application, we show that in a connected 2-Calabi-Yau triangulated category ℬ, a functorially finite, extension closed subcategory 𝒯 of ℬ is cluster tilting if and only if ℬ /𝒯 is an abelian category.
For a compact metric space (K, d), LipK denotes the Banach algebra of all complex-valued Lipschitz functions on (K, d). We show that the continuous Hochschild cohomology Hn(LipK, (LipK)*) and Hn(LipK, ℂe) are both infinite-dimensional vector spaces for each n ≥ 1 if the space K contains a certain infinite sequence which converges to a point e ∈ K. Here (LipK)* is the dual module of LipK and ℂe denotes the complex numbers with a LipK-bimodule structure defined by evaluations of LipK-functions at e. Examples of such metric spaces include all compact Riemannian manifolds, compact geodesic metric spaces and infinite compact subsets of ℝ. In particular, the (small) global homological dimension of LipK is infinite for every such space. Our proof uses the description of point derivations by Sherbert [‘The structure of ideals and point derivations in Banach algebras of Lipschitz functions’, Trans. Amer. Math. Soc.111 (1964), 240–272] and directly constructs non-trivial cocycles with the help of alternating cocycles of Johnson [‘Higher-dimensional weak amenability’, Studia Math.123 (1997), 117–134]. An alternating construction of cocycles on the basis of the idea of Kleshchev [‘Homological dimension of Banach algebras of smooth functions is equal to infinity’, Vest. Math. Mosk. Univ. Ser. 1. Mat. Mech.6 (1988), 57–60] is also discussed.
We introduce a notion of Koszul A∞-algebra that generalizes Priddy's notion of a Koszul algebra and we use it to construct small A∞-algebra models for Hochschild cochains. As an application, this yields new techniques for computing free loop space homology algebras of manifolds that are either formal or coformal (over a field or over the integers). We illustrate these techniques in two examples.
This book is a readable, digestible introduction to exponential families, encompassing statistical models based on the most useful distributions in statistical theory, including the normal, gamma, binomial, Poisson, and negative binomial. Strongly motivated by applications, it presents the essential theory and then demonstrates the theory's practical potential by connecting it with developments in areas like item response analysis, social network models, conditional independence and latent variable structures, and point process models. Extensions to incomplete data models and generalized linear models are also included. In addition, the author gives a concise account of the philosophy of Per Martin-Löf in order to connect statistical modelling with ideas in statistical physics, including Boltzmann's law. Written for graduate students and researchers with a background in basic statistical inference, the book includes a vast set of examples demonstrating models for applications and exercises embedded within the text as well as at the ends of chapters.
For given graphs G1,…, Gk, the size-Ramsey number $\hat R({G_1}, \ldots ,{G_k})$ is the smallest integer m for which there exists a graph H on m edges such that in every k-edge colouring of H with colours 1,…,k, H contains a monochromatic copy of Gi of colour i for some 1 ≤ i ≤ k. We denote $\hat R({G_1}, \ldots ,{G_k})$ by ${\hat R_k}(G)$ when G1 = ⋯ = Gk = G.
Haxell, Kohayakawa and Łuczak showed that the size-Ramsey number of a cycle Cn is linear in n, ${\hat R_k}({C_n}) \le {c_k}n$ for some constant ck. Their proof, however, is based on Szemerédi’s regularity lemma so no specific constant ck is known.
In this paper, we give various upper bounds for the size-Ramsey numbers of cycles. We provide an alternative proof of ${\hat R_k}({C_n}) \le {c_k}n$, avoiding use of the regularity lemma, where ck is exponential and doubly exponential in k, when n is even and odd, respectively. In particular, we show that for sufficiently large n we have ${\hat R_2}({C_n}) \le {10^5} \times cn$, where c = 6.5 if n is even and c = 1989 otherwise.
We establish the first global results for groups definable in tame expansions of o-minimal structures. Let ${\mathcal{N}}$ be an expansion of an o-minimal structure ${\mathcal{M}}$ that admits a good dimension theory. The setting includes dense pairs of o-minimal structures, expansions of ${\mathcal{M}}$ by a Mann group, or by a subgroup of an elliptic curve, or a dense independent set. We prove: (1) a Weil’s group chunk theorem that guarantees a definable group with an o-minimal group chunk is o-minimal, (2) a full characterization of those definable groups that are o-minimal as those groups that have maximal dimension; namely, their dimension equals the dimension of their topological closure, (3) as an application, if ${\mathcal{N}}$ expands ${\mathcal{M}}$ by a dense independent set, then every definable group is o-minimal.
Let φ : ℝn × [0, ∞) → [0, ∞) satisfy that φ(x, · ), for any given x ∈ ℝn, is an Orlicz function and φ( · , t) is a Muckenhoupt A∞ weight uniformly in t ∈ (0, ∞). The (weak) Musielak–Orlicz Hardy space Hφ(ℝn) (WHφ(ℝn)) generalizes both the weighted (weak) Hardy space and the (weak) Orlicz Hardy space and hence has wide generality. In this paper, two boundedness criteria for both linear operators and positive sublinear operators from Hφ(ℝn) to Hφ(ℝn) or from Hφ(ℝn) to WHφ(ℝn) are obtained. As applications, we establish the boundedness of Bochner–Riesz means from Hφ(ℝn) to Hφ(ℝn), or from Hφ(ℝn) to WHφ(ℝn) in the critical case. These results are new even when φ(x, t): = Φ(t) for all (x, t) ∈ ℝn × [0, ∞), where Φ is an Orlicz function.
Keller proved in 1999 that the Gerstenhaber algebra structure on the Hochschild cohomology of an algebra is an invariant of the derived category. In this paper, we adapt his approach to show that the Gerstenhaber algebra structure on the Tate–Hochschild cohomology of an algebra is preserved under singular equivalences of Morita type with level, a notion introduced by the author in previous work.
We give a complete computation of the Bieri–Neumann–Strebel–Renz invariants Σm(Hn) of the Houghton groups Hn. Partial results were previously obtained by the author, with a conjecture about the full picture, which we now confirm. The proof involves covering relevant subcomplexes of an associated CAT (0) cube complex by their intersections with certain locally convex subcomplexes, and then applying a strong form of the Nerve Lemma. A consequence of the full computation is that for each 1 ≤ m ≤ n − 1, Hn admits a map onto ℤ whose kernel is of type Fm−1 but not Fm; moreover, no such kernel is ever of type Fn−1.
We investigate the Gibbs–Wilbraham phenomenon for generalized sampling series, and related interpolation series arising from cardinal functions. We prove the existence of the overshoot characteristic of the phenomenon for certain cardinal functions, and characterize the existence of an overshoot for sampling series.
This paper concerns the study of some bifurcation properties for the following class of Choquard-type equations:(P)
$$\left\{ {\begin{array}{*{20}{l}}{ - \Delta u = \lambda f(x)\left[ {u + \left( {{I_\alpha }*f( \cdot )H(u)} \right)h(u)} \right],{\rm{ in }} \ {{\mathbb{R}}^3},}\\{{{\lim }_{|x| \to \infty }}u(x) = 0,\quad u(x) > 0,\quad x \in {{\mathbb{R}}^3},\quad u \in {D^{1,2}}({{\mathbb{R}}^3}),}\end{array}} \right.$$
where ${I_\alpha }(x) = 1/|x{|^\alpha },\,\alpha\in (0,3),\,\lambda> 0,\,f:{{\mathbb{R}}^3} \to {\mathbb{R}}$ is a positive continuous function and h : ${\mathbb{R}} \to {\mathbb{R}}$ is a bounded Hölder continuous function. The main tools used are Leray–Schauder degree theory and a global bifurcation result due to Rabinowitz.
Given two k-graphs (k-uniform hypergraphs) F and H, a perfect F-tiling (or F-factor) in H is a set of vertex-disjoint copies of F that together cover the vertex set of H. For all complete k-partite k-graphs K, Mycroft proved a minimum codegree condition that guarantees a K-factor in an n-vertex k-graph, which is tight up to an error term o(n). In this paper we improve the error term in Mycroft’s result to a sublinear term that relates to the Turán number of K when the differences of the sizes of the vertex classes of K are co-prime. Furthermore, we find a construction which shows that our improved codegree condition is asymptotically tight in infinitely many cases, thus disproving a conjecture of Mycroft. Finally, we determine exact minimum codegree conditions for tiling K(k)(1, … , 1, 2) and tiling loose cycles, thus generalizing the results of Czygrinow, DeBiasio and Nagle, and of Czygrinow, respectively.
Consider any fixed graph whose edges have been randomly and independently oriented, and write {S ⇝} to indicate that there is an oriented path going from a vertex s ∊ S to vertex i. Narayanan (2016) proved that for any set S and any two vertices i and j, {S ⇝ i} and {S ⇝ j} are positively correlated. His proof relies on the Ahlswede–Daykin inequality, a rather advanced tool of probabilistic combinatorics.
In this short note I give an elementary proof of the following, stronger result: writing V for the vertex set of the graph, for any source set S, the events {S ⇝ i}, i ∊ V, are positively associated, meaning that the expectation of the product of increasing functionals of the family {S ⇝ i} for i ∊ V is greater than the product of their expectations.
We give a simple set of geometric conditions on curves $\unicode[STIX]{x1D702}$, $\widetilde{\unicode[STIX]{x1D702}}$ in $\mathbf{H}$ from $0$ to $\infty$ so that if $\unicode[STIX]{x1D711}:\mathbf{H}\rightarrow \mathbf{H}$ is a homeomorphism which is conformal off $\unicode[STIX]{x1D702}$ with $\unicode[STIX]{x1D711}(\unicode[STIX]{x1D702})=\widetilde{\unicode[STIX]{x1D702}}$ then $\unicode[STIX]{x1D711}$ is a conformal automorphism of $\mathbf{H}$. Our motivation comes from the fact that it is possible to apply our result to random conformal welding problems related to the Schramm–Loewner evolution (SLE) and Liouville quantum gravity (LQG). In particular, we show that if $\unicode[STIX]{x1D702}$ is a non-space-filling $\text{SLE}_{\unicode[STIX]{x1D705}}$ curve in $\mathbf{H}$ from $0$ to $\infty$, and $\unicode[STIX]{x1D711}$ is a homeomorphism which is conformal on $\mathbf{H}\setminus \unicode[STIX]{x1D702}$, and $\unicode[STIX]{x1D711}(\unicode[STIX]{x1D702})$, $\unicode[STIX]{x1D702}$ are equal in distribution, then $\unicode[STIX]{x1D711}$ is a conformal automorphism of $\mathbf{H}$. Applying this result for $\unicode[STIX]{x1D705}=4$ establishes that the welding operation for critical ($\unicode[STIX]{x1D6FE}=2$) LQG is well defined. Applying it for $\unicode[STIX]{x1D705}\in (4,8)$ gives a new proof that the welding of two independent $\unicode[STIX]{x1D705}/4$-stable looptrees of quantum disks to produce an $\text{SLE}_{\unicode[STIX]{x1D705}}$ on top of an independent $4/\sqrt{\unicode[STIX]{x1D705}}$-LQG surface is well defined.
Let Ω ⊂ ℝn be a bounded Lipschitz domain. Let $L: {\mathbb R}^n\rightarrow \bar {\mathbb R}= {\mathbb R}\cup \{+\infty \}$ be a continuous function with superlinear growth at infinity, and consider the functional $\mathcal {I}(u)=\int \nolimits _\Omega L(Du)$, u ∈ W1,1(Ω). We provide necessary and sufficient conditions on L under which, for all f ∈ W1,1(Ω) such that $\mathcal {I}(f) < +\infty $, the problem of minimizing $\mathcal {I}(u)$ with the boundary condition u|∂Ω = f has a solution which is stable, or – alternatively – is such that all of its solutions are stable. By stability of $\mathcal {I}$ at u we mean that $u_k\rightharpoonup u$ weakly in W1,1(Ω) together with $\mathcal {I}(u_k)\to \mathcal {I}(u)$ imply uk → u strongly in W1,1(Ω). This extends to general boundary data some results obtained by Cellina and Cellina and Zagatti. Furthermore, with respect to the preceding literature on existence results for scalar variational problems, we drop the assumption that the relaxed functional admits a continuous minimizer.
The aim of this paper is to provide and numerically test in the presence of measurement noise a procedure for target classification in wave imaging based on comparing frequency-dependent distribution descriptors with precomputed ones in a dictionary of learned distributions. Distribution descriptors for inhomogeneous objects are obtained from the scattering coefficients. First, we extract the scattering coefficients of the (inhomogeneous) target from the perturbation of the reflected waves. Then, for a collection of inhomogeneous targets, we build a frequency-dependent dictionary of distribution descriptors and use a matching algorithm in order to identify a target from the dictionary up to some translation, rotation and scaling.