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.
We give an alternative, probabilistic, approach to two of the subjects considered so far: the optimality of the exponent in the polynomial Bohnenblust-Hille inequality (see Chapter 6) and the lower bound for S in Bohr’s problem (see Chapters 1 and 4). We use a probabilistic device: the Kahane-Salem-Zygmund inequality. This shows that, for a given finite family of coefficients, a choice of signs can be found in such a way that the polynomial whose coefficients are the original ones multiplied by the signs has small norm (supremum on the polydisc). The proof uses Bernstein’s inequality and Rademacher random variables. We also look at the relationship between Rademacher and Steinhaus random variables, and deduce the classical Khinchin inequality from the Khinchin-Steinhaus inequality (see Chapter 6). We consider Dirichlet series, place signs before the coefficients, and define the almost sure abscissas (in each of the senses from Chapter 1) by considering each convergence for almost every choice of signs. An analogue of Bohr’s problem in this sense is considered.
Given a function f on the n-dimensional polydisc, the Bohr radius (recall Chapter 8) looks for the best r for which the supremum of ∑ | c_α z^α| for || z ||_∞ <r is less than or equal to the supremum of |f(z)| for || z ||_∞ <1. Here an analogous problem is considered, replacing the sup-norm by another p-norm. The corresponding Bohr radius for l_p-balls is defined, and its asymptotic behaviour is computed. This is done in three steps. First, an m-homogeneous version (where only m-homogeneous polynomials are considered) is defined, and it is shown how these m-homogeneous radii determine the general Bohr radius. In the second step, this homogenous radius is related to the unconditional basis constant of the monomials in the space of homogeneous polynomials on l_p. Finally, this unconditional basis constant is computed.
For each 1 ≤ p ≤ ∞, the Hardy space \mathcal{H}_p of Dirichlet series is defined as the image through the Bohr transform of the Hardy space of functions on the infinite-dimensional polytorus. The Dirichlet polynomials are dense in \mathcal{H}_p for every 1 ≤ p < ∞. For p=2 this coincides with the space of Dirichlet series whose coefficients are square-summable. A Dirichlet series with coefficients a_n belongs to\mathcal{H}_p if and only if the series with coefficients a_n/n^ε is in \mathcal{H}_p for every ε >0 and the norms are uniformly bounded. In this case, the series is the limit as ε tends to 0. As a technical tool to see this, vector-valued Dirichlet series (that is, series with coefficients in some Banach space) are introduced, and some basic definitions and properties (such as the convergence abscissas, Bohr-Cahen formulas) are given.
We give an introduction to vector-valued holomorphic functions in Banach spaces, defined through Fréchet differentiability. Every function defined on a Reinhardt domain of a finite-dimensional Banach space is analytic, i.e. can be represented by a monomial series expansion, where the family of coefficients is given through a Cauchy integral formula. Every separate holomorphic (holomorphic on each variable) function is holomorphic. This is Hartogs’ theorem, which is proved using Leja’s polynomial lemma. For infinite-dimensional spaces, homogeneous polynomials are defined as the diagonal of multilinear mappings. A function is holomorphic if and only if it is Gâteaux holomorphic and continuous, if and only if it has representation as a series of homogeneous polynomials (known as Taylor expansion). A function is weak holomorphic if the composition with every functional is holomorphic. A function is holomorphic if and only if it is weak holomorphic. Analytic functions are holomorphic.
The Bohnenblust-Hille inequality bounds the (2m)/(m+1)-norm of the coefficients of an m-homogeneous polynomial in n variables by a constant (depending on m but not on n) multiplied by the norm (the supremum on the n-dimensional polydisc) of the polynomial. This follows from the inequality for m-linear forms. Littlewood’s inequality shows that the 4/3-norm of a bilinear form is bounded by a constant (not depending on n) multiplied by the norm of the form and that 4/3 cannot be improved. A tool is the Khinchin-Steinhaus inequality, showing that the L_p-norms (for 1 ≤ p < ∞) of a polynomial are equivalent to the l_2 norm of the coefficients. Other tools are inequalities relating mixed norms of the coefficients of a matrix with the norm of the associated multilinear form. All these give the multilinear Bohnenblust-Hille inequality, showing also that the (2m)/(m+1) cannot be improved. The exponent in the polynomial inequality is also optimal (this does not follow from the multilinear case). As a consequence of the inequality we have S^m=(2m)/(m-1) (see Chapter 4). By a generalized Hölder inequality the constant in the multilinear inequality grows at most polynomially on m.
The classical Monge–Kantorovich (MK) problem as originally posed is concerned with how best to move a pile of soil or rubble to an excavation or fill with the least amount of work relative to some cost function. When the cost is given by the square of the Euclidean distance, one can define a metric on densities called the Wasserstein distance. In this note, we formulate a natural matrix counterpart of the MK problem for positive-definite density matrices. We prove a number of results about this metric including showing that it can be formulated as a convex optimisation problem, strong duality, an analogue of the Poincaré–Wirtinger inequality and a Lax–Hopf–Oleinik–type result.
The Hamming graph H(d, n) is the Cartesian product of d complete graphs on n vertices. Let ${m=d(n-1)}$ be the degree and $V = n^d$ be the number of vertices of H(d, n). Let $p_c^{(d)}$ be the critical point for bond percolation on H(d, n). We show that, for $d \in \mathbb{N}$ fixed and $n \to \infty$,
which extends the asymptotics found in [10] by one order. The term $O(m^{-1}V^{-1/3})$ is the width of the critical window. For $d=4,5,6$ we have $m^{-3} =O(m^{-1}V^{-1/3})$, and so the above formula represents the full asymptotic expansion of $p_c^{(d)}$. In [16] we show that this formula is a crucial ingredient in the study of critical bond percolation on H(d, n) for $d=2,3,4$. The proof uses a lace expansion for the upper bound and a novel comparison with a branching random walk for the lower bound. The proof of the lower bound also yields a refined asymptotics for the susceptibility of a subcritical Erdös–Rényi random graph.
We prove the analog for the $K$-theory of forms of the $Q=+$ theorem in algebraic $K$-theory. That is, we show that the $K$-theory of forms defined in terms of an $S_{\bullet }$-construction is a group completion of the category of quadratic spaces for form categories in which all admissible exact sequences split. This applies for instance to quadratic and hermitian forms defined with respect to a form parameter.
Let R be a commutative ring with unit. We endow the categories of filtered complexes and of bicomplexes of R-modules, with cofibrantly generated model structures, where the class of weak equivalences is given by those morphisms inducing a quasi-isomorphism at a certain fixed stage of the associated spectral sequence. For filtered complexes, we relate the different model structures obtained, when we vary the stage of the spectral sequence, using the functors shift and décalage.
Let 𝔟 be the Borel subalgebra of the Lie algebra 𝔰𝔩2 and V2 be the simple two-dimensional 𝔰𝔩2-module. For the universal enveloping algebra $\[{\cal A}: = U(\gb \ltimes {V_2})\]$ of the semi-direct product 𝔟⋉V2 of Lie algebras, the prime, primitive and maximal spectra are classified. Please approve edit to the sentence “The sets of completely prime…”.The sets of completely prime ideals of $\[{\cal A}\]$ are described. The simple unfaithful $\[{\cal A}\]$-modules are classified and an explicit description of all prime factor algebras of $\[{\cal A}\]$ is given. The following classes of simple U(𝔟⋉V2)-modules are classified: the Whittaker modules, the 𝕂[X]-torsion modules and the 𝕂[E]-torsion modules.
This special issue is devoted to the Mathematical Analysis of Algorithms, which aims to predict the performance of fundamental algorithms and data structures in general use in Computer Science. The simplest measure of performance is the expected value of a cost function under natural models of randomness for the data, and finer properties of the cost distribution provide a deeper understanding of the complexity. Research in this area, which is intimately connected to combinatorics and random discrete structures, uses a rich variety of combinatorial, analytic and probabilistic methods.
We develop a general procedure to study the combinatorial structure of Arthur packets for $p$-adic quasisplit $\mathit{Sp}(N)$ and $O(N)$ following the works of Mœglin. This will allow us to answer many delicate questions concerning the Arthur packets of these groups, for example the size of the packets.
Let G(n,M) be a uniform random graph with n vertices and M edges. Let ${\wp_{n,m}}$ be the maximum block size of G(n,M), that is, the maximum size of its maximal 2-connected induced subgraphs. We determine the expectation of ${\wp_{n,m}}$ near the critical point M = n/2. When n − 2M ≫ n2/3, we find a constant c1 such that
This study relies on the symbolic method and analytic tools from generating function theory, which enable us to describe the evolution of $n^{-1/3}\,\E{\left({\wp_{n,{{(n/2)}({1+\lambda n^{-1/3}})}}}\right)}$ as a function of λ.
Given graphs G and H, a family of vertex-disjoint copies of H in G is called an H-tiling. Conlon, Gowers, Samotij and Schacht showed that for a given graph H and a constant γ>0, there exists C>0 such that if $p \ge C{n^{ - 1/{m_2}(H)}}$, then asymptotically almost surely every spanning subgraph G of the random graph 𝒢(n, p) with minimum degree at least
contains an H-tiling that covers all but at most γn vertices. Here, χcr(H) denotes the critical chromatic number, a parameter introduced by Komlós, and m2(H) is the 2-density of H. We show that this theorem can be bootstrapped to obtain an H-tiling covering all but at most $\gamma {(C/p)^{{m_2}(H)}}$ vertices, which is strictly smaller when $p \ge C{n^{ - 1/{m_2}(H)}}$. In the case where H = K3, this answers the question of Balogh, Lee and Samotij. Furthermore, for an arbitrary graph H we give an upper bound on p for which some leftover is unavoidable and a bound on the size of a largest H -tiling for p below this value.
Smooth solutions of the incompressible Euler equations are characterized by the property that circulation around material loops is conserved. This is the Kelvin theorem. Likewise, smooth solutions of Navier–Stokes are characterized by a generalized Kelvin's theorem, introduced by Constantin–Iyer (2008). In this note, we introduce a class of stochastic fluid equations, whose smooth solutions are characterized by natural extensions of the Kelvin theorems of their deterministic counterparts, which hold along certain noisy flows. These equations are called the stochastic Euler–Poincaré and stochastic Navier–Stokes–Poincaré equations respectively. The stochastic Euler–Poincaré equations were previously derived from a stochastic variational principle by Holm (2015), which we briefly review. Solutions of these equations do not obey pathwise energy conservation/dissipation in general. In contrast, we also discuss a class of stochastic fluid models, solutions of which possess energy theorems but do not, in general, preserve circulation theorems.