Given two unital C*-algebras equipped with states and a positive operator in the enveloping von Neumann algebra of their minimal tensor product, we define three parameters that measure the capacity of the operator to align with a coupling of the two given states. Further, we establish a duality formula that shows the equality of two of the parameters for operators in the minimal tensor product of the relevant C*-algebras. In the context of abelian C*-algebras, our parameters are related to quantitative versions of Arveson's null set theorem and to dualities considered in the theory of optimal transport. On the other hand, restricting to matrix algebras we recover and generalize quantum versions of Strassen's theorem. We show that in the latter case our parameters can detect maximal entanglement and separability.

On all Bergman–Besov Hilbert spaces on the unit disk, we find self-adjoint weighted shift operators that are differential operators of half-order whose commutators are the identity, thereby obtaining uncertainty relations in these spaces. We also obtain joint average uncertainty relations for pairs of commuting tuples of operators on the same spaces defined on the unit ball. We further identify functions that yield equality in some uncertainty inequalities.

The principle of maximum entropy is a well-known approach to produce a model for data-generating distributions. In this approach, if partial knowledge about the distribution is available in terms of a set of information constraints, then the model that maximizes entropy under these constraints is used for the inference. In this paper, we propose a new three-parameter lifetime distribution using the maximum entropy principle under the constraints on the mean and a general index. We then present some statistical properties of the new distribution, including hazard rate function, quantile function, moments, characterization, and stochastic ordering. We use the maximum likelihood estimation technique to estimate the model parameters. A Monte Carlo study is carried out to evaluate the performance of the estimation method. In order to illustrate the usefulness of the proposed model, we fit the model to three real data sets and compare its relative performance with respect to the beta generalized Weibull family.

We establish an upper bound for the ground state energy per unit volume of a dilute Bose gas in the thermodynamic limit, capturing the correct second-order term, as predicted by the Lee–Huang–Yang formula. This result was first established in [20] by H.-T. Yau and J. Yin. Our proof, which applies to repulsive and compactly supported $V \in L^3 (\mathbb {R}^3)$ , gives better rates and, in our opinion, is substantially simpler.

Cells and organisms follow aligned structures in their environment, a process that can generate persistent migration paths. Kinetic transport equations are a popular modelling tool for describing biological movements at the mesoscopic level, yet their formulations usually assume a constant turning rate. Here we relax this simplification, extending to include a turning rate that varies according to the anisotropy of a heterogeneous environment. We extend known methods of parabolic and hyperbolic scaling and apply the results to cell movement on micropatterned domains. We show that inclusion of orientation dependence in the turning rate can lead to persistence of motion in an otherwise fully symmetric environment and generate enhanced diffusion in structured domains.

We compute the deficiency spaces of operators of the form $H_A{\hat {\otimes }} I + I{\hat {\otimes }} H_B$, for symmetric $H_A$ and self-adjoint $H_B$. This enables us to construct self-adjoint extensions (if they exist) by means of von Neumann's theory. The structure of the deficiency spaces for this case was asserted already in Ibort et al. [Boundary dynamics driven entanglement, J. Phys. A: Math. Theor.47(38) (2014) 385301], but only proven under the restriction of $H_B$ having discrete, non-degenerate spectrum.

We determine the reflexivity index of some closed set lattices by constructing maps relative to irrational rotations. For example, various nests of closed balls and some topological spaces, such as even-dimensional spheres and a wedge of two circles, have reflexivity index 2. We also show that a connected double of spheres has reflexivity index at most 2.

In this note, we show that in a complete $\operatorname {\mathrm {CAT}}(0)$ space pointwise convergence of proximal mappings under a certain normalization condition implies Mosco convergence.

We consider the Cauchy problem for a general class of parabolic partial differential equations in the Euclidean space ℝN. We show that given a weighted Lp-space $L_w^p({\mathbb {R}}^N)$ with 1 ⩽ p < ∞ and a fast growing weight w, there is a Schauder basis $(e_n)_{n=1}^\infty$ in $L_w^p({\mathbb {R}}^N)$ with the following property: given an arbitrary positive integer m there exists nm > 0 such that, if the initial data f belongs to the closed linear span of en with n ⩾ nm, then the decay rate of the solution of the problem is at least t−m for large times t.

The result generalizes the recent study of the authors concerning the classical linear heat equation. We present variants of the result having different methods of proofs and also consider finite polynomial decay rates instead of unlimited m.

This work is devoted to a vast extension of Sanov’s theorem, in Laplace principle form, based on alternatives to the classical convex dual pair of relative entropy and cumulant generating functional. The abstract results give rise to a number of probabilistic limit theorems and asymptotics. For instance, widely applicable non-exponential large deviation upper bounds are derived for empirical distributions and averages of independent and identically distributed samples under minimal integrability assumptions, notably accommodating heavy-tailed distributions. Other interesting manifestations of the abstract results include new results on the rate of convergence of empirical measures in Wasserstein distance, uniform large deviation bounds, and variational problems involving optimal transport costs, as well as an application to error estimates for approximate solutions of stochastic optimization problems. The proofs build on the Dupuis–Ellis weak convergence approach to large deviations as well as the duality theory for convex risk measures.

The Douglas–Rachford method is a splitting method frequently employed for finding zeros of sums of maximally monotone operators. When the operators in question are normal cone operators, the iterated process may be used to solve feasibility problems of the following form: Find $x\in \bigcap _{k=1}^{N}S_{k}$. The success of the method in the context of closed, convex, nonempty sets $S_{1},\ldots ,S_{N}$ is well known and understood from a theoretical standpoint. However, its performance in the nonconvex context is less well understood, yet it is surprisingly impressive. This was particularly compelling to Jonathan M. Borwein who, intrigued by Elser, Rankenburg and Thibault’s success in applying the method to solving sudoku puzzles, began an investigation of his own. We survey the current body of literature on the subject, and we summarize its history. We especially commemorate Professor Borwein’s celebrated contributions to the area.

The geometric structure of the nonparametric statistical model of all positive densities connected by an open exponential arc and its intimate relation to Orlicz spaces give new insights to well-known financial objects which arise in exponential utility maximization problems.

We present refined and reversed inequalities for the weighted arithmetic mean–harmonic mean functional inequality. Our approach immediately yields the related operator versions in a simple and fast way. We also give some operator and functional inequalities for three or more arguments. As an application, we obtain a refined upper bound for the relative entropy involving functional arguments.

We present solutions to nonzero-sum games of optimal stopping for Brownian motion in [0, 1] absorbed at either 0 or 1. The approach used is based on the double partial superharmonic characterisation of the value functions derived in Attard (2015). In this setting the characterisation of the value functions has a transparent geometrical interpretation of 'pulling two ropes' above 'two obstacles' which must, however, be constrained to pass through certain regions. This is an extension of the analogous result derived by Peskir (2009), (2012) (semiharmonic characterisation) for the value function in zero-sum games of optimal stopping. To derive the value functions we transform the game into a free-boundary problem. The latter is then solved by making use of the double smooth fit principle which was also observed in Attard (2015). Martingale arguments based on the Itô–Tanaka formula will then be used to verify that the solution to the free-boundary problem coincides with the value functions of the game and this will establish the Nash equilibrium.

We introduce the Hurwitz-type spectral zeta functions for the quantum Rabi models, and give their meromorphic continuation to the whole complex plane with only one simple pole at $s=1$. As an application, we give the Weyl law for the quantum Rabi models. As a byproduct, we also give a rationality of Rabi–Bernoulli polynomials introduced in this paper.

We present a new approach to Davie’s theorem on the uniqueness of solutions to the equation

for almost all Brownian paths. A generalization of this result and a discussion of some closely related problems are given.

In this paper a non-convex vector optimization problem among infinite-dimensional spaces is presented. In particular, a generalized Lagrange multiplier rule is formulated as a necessary and sufficient optimality condition for weakly minimal solutions of a constrained vector optimization problem, without requiring that the ordering cone that defines the inequality constraints has non-empty interior. This paper extends the result of Donato (J. Funct. Analysis261 (2011), 2083–2093) to the general setting of vector optimization by introducing a constraint qualification assumption that involves the Fréchet differentiability of the maps and the tangent cone to the image set. Moreover, the constraint qualification is a necessary and sufficient condition for the Lagrange multiplier rule to hold.

Dyadic shifts $D\oplus T$ of point distributions $D$ in the $d$-dimensional unit cube $U^{d}$ are considered as a form of randomization. Explicit formulas for the $L_{q}$-discrepancies of such randomized distributions are given in the paper in terms of Rademacher functions. Relying on the statistical independence of Rademacher functions, Khinchin’s inequalities, and other related results, we obtain very sharp upper and lower bounds for the mean $L_{q}$-discrepancies, $0<q\leqslant \infty$. The upper bounds imply directly a generalization of the well-known Chen theorem on mean discrepancies with respect to dyadic shifts (Theorem 2.1). From the lower bounds, it follows that for an arbitrary $N$-point distribution $D_{N}$ and any exponent $0<q\leqslant 1$, there exist dyadic shifts $D_{N}\oplus T$ such that the $L_{q}$-discrepancy ${\mathcal{L}}_{q}[D_{N}\oplus T]>c_{d,q}(\log N)^{(1/2)(d-1)}$ (Theorem 2.2). The lower bounds for the $L_{\infty }$-discrepancy are also considered in the paper. It is shown that for an arbitrary $N$-point distribution $D_{N}$, there exist dyadic shifts $D_{N}\oplus T$ such that ${\mathcal{L}}_{\infty }[D_{N}\oplus T]>c_{d}(\log N)^{(1/2)d}$ (Theorem 2.3).

Given a probability density, we estimate the rate of decay of the measure of the level sets of its evolutes by the Ornstein–Uhlenbeck semigroup. The rate is faster than what follows from the preservation of mass and Markov’s inequality.

It is known that the transport capacity of a dense wireless ad hoc network with n nodes scales like √n. We show that the transport capacity divided by √n approaches a nonrandom limit with probability 1 when the nodes are uniformly distributed on the unit square. To show the existence of the limit, we prove that the transport capacity under the protocol model is a subadditive Euclidean functional and use the machinery of subadditive functions in the spirit of Steele.