We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save this undefined to your undefined account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your undefined account.
Find out more about saving content to .
To send this article to your Kindle, first ensure [email protected] 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 sending to your Kindle.
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 show Exel’s tight representation of an inverse semigroup can be described in terms of joins and covers in the natural partial order. Using this, we show that the ${C}^{\ast } $-algebra of a finitely aligned category of paths, developed by Spielberg, is the tight ${C}^{\ast } $-algebra of a natural inverse semigroup. This includes as a special case finitely aligned higher-rank graphs: that is, for such a higher-rank graph $\Lambda $, the tight ${C}^{\ast } $-algebra of the inverse semigroup associated to $\Lambda $ is the same as the ${C}^{\ast } $-algebra of $\Lambda $.
A definition of the reflexive index of a family of (closed) subspaces of a complex, separable Hilbert space $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}H$ is given, analogous to one given by D. Zhao for a family of subsets of a set. Following some observations, some examples are given, including: (a) a subspace lattice on $H$ with precisely five nontrivial elements with infinite reflexive index; (b) a reflexive subspace lattice on $H$ with infinite reflexive index; (c) for each positive integer $n$ satisfying dim $H\ge n+1$, a reflexive subspace lattice on $H$ with reflexive index $n$. If $H$ is infinite-dimensional and ${\mathcal{B}}$ is an atomic Boolean algebra subspace lattice on $H$ with $n$ equidimensional atoms and with the property that the vector sum $K+L$ is closed, for every $K,L\in {\mathcal{B}}$, then ${\mathcal{B}}$ has reflexive index at most $n$.
In this paper, we obtain the well posedness of the linear stochastic Korteweg–de Vries equation by the Galerkin method, and then establish the Carleman estimate, leading to the unique continuation property (UCP) for the linear stochastic Korteweg–de Vries equation. This UCP cannot be obtained from the classical Holmgren uniqueness theorem.
In this paper we prove two inequalities relating the warping function to various curvature terms, for warped products isometrically immersed in Riemannian manifolds. This extends work by B. Y. Chen [‘On isometric minimal immersions from warped products into real space forms’, Proc. Edinb. Math. Soc. (2) 45(3) (2002), 579–587 and ‘Warped products in real space forms’, Rocky Mountain J. Math.34(2) (2004), 551–563] for the case of immersions into space forms. Finally, we give an application where the target manifold is the Clifford torus.
We prove that if $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}X$ is a space satisfying the discrete countable chain condition with a rank 3-diagonal then the cardinality of $X$ is at most $\mathfrak{c}$.
While the separable quotient problem is famously open for Banach spaces, in the broader context of barrelled spaces we give negative solutions. Obversely, the study of pseudocompact $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}X$ and Warner bounded $X$ allows us to expand Rosenthal’s positive solution for Banach spaces of the form $ C_{c}(X) $ to barrelled spaces of the same form, and see that strong duals of arbitrary $C_{c}(X) $ spaces admit separable quotients.
We prove that if a space $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}X$ with a rank 2-diagonal either has the countable chain condition or is star countable then the cardinality of $X$ is at most $\mathfrak{c}$.
In this paper, it is shown that every compact Hausdorff $K$-space has countable tightness. This result gives a positive answer to a problem posed by Malykhin and Tironi [‘Weakly Fréchet–Urysohn and Pytkeev spaces’, Topology Appl.104 (2000), 181–190]. We show that a semitopological group $G$ that is a $K$-space is first countable if and only if $G$ is of point-countable type. It is proved that if a topological group $G$ is a $K$-space and has a locally paracompact remainder in some Hausdorff compactification, then $G$ is metrisable.
In this paper, it is proved that every isometry between the unit spheres of two real Banach spaces preserves the frames of the unit balls. As a consequence, if $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}X$ and $Y$ are $n$-dimensional Banach spaces and $T_0$ is an isometry from the unit sphere of $X$ onto that of $Y$ then it maps the set of all $(n-1)$-extreme points of the unit ball of $X$ onto that of $Y$.
We introduce a class of discrete-time stochastic processes, called disjunctive processes, which are important for reliable simulations in random iteration algorithms. Their definition requires that all possible patterns of states appear with probability 1. Sufficient conditions for nonhomogeneous chains to be disjunctive are provided. Suitable examples show that strongly mixing Markov chains and pairwise independent sequences, often employed in applications, may not be disjunctive. As a particular step towards a general theory we shall examine the problem arising when disjunctiveness is inherited under passing to a subsequence. An application to the verification problem for switched control systems is also included.
Recently, H’michane et al. [‘On the class of limited operators’, Acta Math. Sci. (submitted)] introduced the class of weak$^*$ Dunford–Pettis operators on Banach spaces, that is, operators which send weakly compact sets onto limited sets. In this paper, the domination problem for weak$^*$ Dunford–Pettis operators is considered. Let $S, T:E\to F$ be two positive operators between Banach lattices $E$ and $F$ such that $0\leq S\leq T$. We show that if $T$ is a weak$^{*}$ Dunford–Pettis operator and $F$ is $\sigma $-Dedekind complete, then $S$ itself is weak$^*$ Dunford–Pettis.
The cubic version of the Lucas cryptosystem is set up based on the cubic recurrence relation of the Lucas function by Said and Loxton [‘A cubic analogue of the RSA cryptosystem’, Bull. Aust. Math. Soc.68 (2003), 21–38]. To implement this type of cryptosystem in a limited environment, it is necessary to accelerate encryption and decryption procedures. Therefore, this paper concentrates on improving the computation time of encryption and decryption in cubic Lucas cryptosystems. The new algorithm is designed based on new properties of the cubic Lucas function and mathematical techniques. To illustrate the efficiency of our algorithm, an analysis was carried out with different size parameters and the performance of the proposed and previously existing algorithms was evaluated with experimental data and mathematical analysis.
In this paper we establish an existence result for a class of generalised variational-like inequalities, when the functions used in their definition are of type ql and satisfy some general continuity assumptions. We use a Brézis–Nirenberg–Stampacchia type result.
The paper considers a statistical concept of causality in continuous time between filtered probability spaces, based on Granger’s definition of causality. This causality concept is connected with the preservation of the martingale representation property when the filtration is getting smaller. We also give conditions, in terms of causality, for every martingale to be a continuous semimartingale, and we consider the equivalence between the concept of causality and the preservation of the martingale representation property under change of measure. In addition, we apply these results to weak solutions of stochastic differential equations. The results can be applied to the economics of securities trading.
Schmidt’s game is a powerful tool for studying properties of certain sets which arise in Diophantine approximation theory, number theory and dynamics. Recently, many new results have been proven using this game. In this paper we address determinacy and indeterminacy questions regarding Schmidt’s game and its variations, as well as more general games played on complete metric spaces (for example, fractals). We show that, except for certain exceptional cases, these games are undetermined on certain sets. Judging by the vast numbers of papers utilising these games, we believe that the results in this paper will be of interest to a large audience of number theorists as well as set theorists and logicians.