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.
In this paper, we give necessary and sufficient conditions for the rigidity of the perimeter inequality under Schwarz symmetrization. The term rigidity refers to the situation in which the equality cases are only obtained by translations of the symmetric set. In particular, we prove that the sufficient conditions for rigidity provided in M. Barchiesi, F. Cagnetti and N. Fusco [Stability of the Steiner symmetrization of convex sets. J. Eur. Math. Soc. 15 (2013), 1245-1278.] are also necessary.
For closed subgroups L and R of a compact Lie group G, a left L-space X, and an L-equivariant continuous map $A:X\to G/R$, we introduce the twisted action of the equivariant cohomology $H_R^{\bullet }(\mathrm {pt},\Bbbk )$ on the equivariant cohomology $H_L^{\bullet }(X,\Bbbk )$. Considering this action as a right action, $H_L^{\bullet }(X,\Bbbk )$ becomes a bimodule together with the canonical left action of $H_L^{\bullet }(\mathrm {pt},\Bbbk )$. Using this bimodule structure, we prove an equivariant version of the Künneth isomorphism. We apply this result to the computation of the equivariant cohomologies of Bott–Samelson varieties and to a geometric construction of the bimodule morphisms between them.
Many industrial design problems are characterized by a lack of an analytical expression defining the relationship between design variables and chosen quality metrics. Evaluating the quality of new designs is therefore restricted to running a predetermined process such as physical testing of prototypes. When these processes carry a high cost, choosing how to gather further data can be very challenging, whether the end goal is to accurately predict the quality of future designs or to find an optimal design. In the multi-fidelity setting, one or more approximations of a design’s performance are available at varying costs and accuracies. Surrogate modelling methods have long been applied to problems of this type, combining data from multiple sources into a model which guides further sampling. Many challenges still exist; however, the foremost among them is choosing when and how to rely on available low-fidelity sources. This tutorial-style paper presents an introduction to the field of surrogate modelling for multi-fidelity expensive black-box problems, including classical approaches and open questions in the field. An illustrative example using Australian elevation data is provided to show the potential downfalls in blindly trusting or ignoring low-fidelity sources, a question that has recently gained much interest in the community.
Two asymptotic configurations on a full $\mathbb {Z}^d$-shift are indistinguishable if, for every finite pattern, the associated sets of occurrences in each configuration coincide up to a finitely supported permutation of $\mathbb {Z}^d$. We prove that indistinguishable asymptotic pairs satisfying a ‘flip condition’ are characterized by their pattern complexity on finite connected supports. Furthermore, we prove that uniformly recurrent indistinguishable asymptotic pairs satisfying the flip condition are described by codimension-one (dimension of the internal space) cut and project schemes, which symbolically correspond to multidimensional Sturmian configurations. Together, the two results provide a generalization to $\mathbb {Z}^d$ of the characterization of Sturmian sequences by their factor complexity $n+1$. Many open questions are raised by the current work and are listed in the introduction.
Let $B(\Omega )$ be a Banach space of holomorphic functions on a bounded connected domain $\Omega $ in ${{\mathbb C}^n}$. In this paper, we establish a criterion for $B(\Omega )$ to be reflexive via evaluation functions on $B(\Omega )$, that is, $B(\Omega )$ is reflexive if and only if the evaluation functions span the dual space $(B(\Omega ))^{*} $.
Edited by
R. A. Bailey, University of St Andrews, Scotland,Peter J. Cameron, University of St Andrews, Scotland,Yaokun Wu, Shanghai Jiao Tong University, China
Edited by
R. A. Bailey, University of St Andrews, Scotland,Peter J. Cameron, University of St Andrews, Scotland,Yaokun Wu, Shanghai Jiao Tong University, China
Eigenvalues of the Laplacian matrix of a graph have been widely used in studying connectivity and expansion properties of networks, and also in analyzing random walks on a graph. Independently, statisticians introduced various optimality criteria in experimental design, the goal being to obtain more accurate estimates of quantities of interest in an experiment. It turns out that the most popular of these optimality criteria for block designs are determined by the Laplacian eigenvalues of the concurrence graph, or of the Levi graph, of the design. The most important optimality criteria, called A (average), D (determinant) and E (extreme), are related to the conductance of the graph as an electrical network, the number of spanning trees, and the isoperimetric properties of the graphs, respectively. The number of spanning trees is also an evaluation of the Tutte polynomial of the graph, and is the subject of the Merino–Welsh conjecture relating it to acyclic and totally cyclic orientations, of interest in their own right. This chapter ties these ideas together, building on the work in [4] and [5].
Edited by
R. A. Bailey, University of St Andrews, Scotland,Peter J. Cameron, University of St Andrews, Scotland,Yaokun Wu, Shanghai Jiao Tong University, China
Edited by
R. A. Bailey, University of St Andrews, Scotland,Peter J. Cameron, University of St Andrews, Scotland,Yaokun Wu, Shanghai Jiao Tong University, China
Edited by
R. A. Bailey, University of St Andrews, Scotland,Peter J. Cameron, University of St Andrews, Scotland,Yaokun Wu, Shanghai Jiao Tong University, China
Edited by
R. A. Bailey, University of St Andrews, Scotland,Peter J. Cameron, University of St Andrews, Scotland,Yaokun Wu, Shanghai Jiao Tong University, China
We give an introduction to a topic in the “stable algebra of matrices,” as related to certain problems in symbolic dynamics. We introduce enough symbolic dynamics to explain these connections, but the algebra is of independent interest and can be followed with little attention to the symbolic dynamics. This “stable algebra of matrices” involves the study of properties and relations of square matrices over a semiring S, which are invariant under two fundamental equivalence relations: shift equivalence and strong shift equivalence. When S is a field, these relations are the same, and matrices over S are shift equivalent if and only if the nonnilpotent parts of their canonical forms are similar. We give a detailed account of these relations over other rings and semirings. When S is a ring, this involves module theory and algebraic K theory. We discuss in detail and contrast the problems of characterizing the possible spectra, and the possible nonzero spectra, of nonnegative real matrices.We also review key features of the automorphism group of a shift of finite type; the recently introduced stabilized automorphism group; and the work of Kim, Roush and Wagoner giving counterexamples to Williams’ shift equivalence conjecture.
Edited by
R. A. Bailey, University of St Andrews, Scotland,Peter J. Cameron, University of St Andrews, Scotland,Yaokun Wu, Shanghai Jiao Tong University, China
Edited by
R. A. Bailey, University of St Andrews, Scotland,Peter J. Cameron, University of St Andrews, Scotland,Yaokun Wu, Shanghai Jiao Tong University, China
These lecture notes provide quantum probabilistic concepts and methods for spectral analysis of graphs, in particular, for the study of asymptotic behavior of the spectral distributions of growing graphs. Quantum probability theory is an algebraic generalization of classical (Kolmogorovian) probability theory, where an element of a (not necessarily commutative) ∗-algebra is treated as a random variable. In this aspect the concepts and methods peculiar to quantum probability are applied to the spectral analysis of adjacency matrices of graphs. In particular, we focus on the method of quantum decomposition and the use of various concepts of independence. The former discloses the noncommutative nature of adjacency matrices and gives a systematic method of computing spectral distributions. The latter is related to various graph products and provides a unified aspect in obtaining the limit spectral distributions as corollaries of various central limit theorems.
Edited by
R. A. Bailey, University of St Andrews, Scotland,Peter J. Cameron, University of St Andrews, Scotland,Yaokun Wu, Shanghai Jiao Tong University, China
For $\lambda \in (0,\,1/2]$ let $K_\lambda \subset \mathbb {R}$ be a self-similar set generated by the iterated function system $\{\lambda x,\, \lambda x+1-\lambda \}$. Given $x\in (0,\,1/2)$, let $\Lambda (x)$ be the set of $\lambda \in (0,\,1/2]$ such that $x\in K_\lambda$. In this paper we show that $\Lambda (x)$ is a topological Cantor set having zero Lebesgue measure and full Hausdorff dimension. Furthermore, we show that for any $y_1,\,\ldots,\, y_p\in (0,\,1/2)$ there exists a full Hausdorff dimensional set of $\lambda \in (0,\,1/2]$ such that $y_1,\,\ldots,\, y_p \in K_\lambda$.
Edited by
R. A. Bailey, University of St Andrews, Scotland,Peter J. Cameron, University of St Andrews, Scotland,Yaokun Wu, Shanghai Jiao Tong University, China
This is an introduction to representation theory and harmonic analysis on finite groups. This includes, in particular, Gelfand pairs (with applications to diffusion processes à la Diaconis) and induced representations (focusing on the little group method of Mackey and Wigner). We also discuss Laplace operators and spectral theory of finite regular graphs. In the last part, we present the representation theory of GL(2, Fq), the general linear group of invertible 2 × 2 matrices with coefficients in a finite field with q elements. More precisely, we revisit the classical Gelfand–Graev representation of GL(2, Fq) in terms of the so-called multiplicity-free triples and their associated Hecke algebras. The presentation is not fully self-contained: most of the basic and elementary facts are proved in detail, some others are left as exercises, while, for more advanced results with no proof, precise references are provided.
All vital functions of living cells rely on the production of various functional molecules through gene expression. The production periods are burst-like and stochastic due to the discrete nature of biochemical reactions. In certain contexts, the concentrations of RNA or protein require regulation to maintain a fine internal balance within the cell. Here we consider a motif of two types of RNA molecules – mRNA and an antagonistic microRNA – which are encoded by a shared coding sequence and form a feed forward loop (FFL). This control mechanism is shown to be perfectly adapting in the deterministic context. We demonstrate that the adaptation (of the mean value) becomes imperfect if production occurs in random bursts. The FFL nevertheless outperforms the benchmark feedback loop in terms of counterbalancing variations in the signal. Methodologically, we adapt a hybrid stochastic model, which has widely been used to model a single regulatory molecule, to the current case of a motif involving two species; the use of the Laplace transform thereby circumvents the problem of moment closure that arises owing to the mRNA–microRNA interaction. We expect that the approach can be applicable to other systems with nonlinear kinetics.
The main theorem of this paper establishes a uniform syndeticity result concerning the multiple recurrence of measure-preserving actions on probability spaces. More precisely, for any integers $d,l\geq 1$ and any $\varepsilon> 0$, we prove the existence of $\delta>0$ and $K\geq 1$ (dependent only on d, l, and $\varepsilon $) such that the following holds: Consider a solvable group $\Gamma $ of derived length l, a probability space $(X, \mu )$, and d pairwise commuting measure-preserving $\Gamma $-actions $T_1, \ldots , T_d$ on $(X, \mu )$. Let E be a measurable set in X with $\mu (E) \geq \varepsilon $. Then, K many (left) translates of
cover $\Gamma $. This result extends and refines uniformity results by Furstenberg and Katznelson. As a combinatorial application, we obtain the following uniformity result. For any integers $d,l\geq 1$ and any $\varepsilon> 0$, there are $\delta>0$ and $K\geq 1$ (dependent only on d, l, and $\varepsilon $) such that for all finite solvable groups G of derived length l and any subset $E\subset G^d$ with $m^{\otimes d}(E)\geq \varepsilon $ (where m is the uniform measure on G), we have that K-many (left) translates of