The main goal of this paper is to construct universal spaces for asymptotic dimension by generalizing to the coarse context an approach to constructing universal spaces for covering dimension using a factorization result due to Mardesic.

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.

We first introduce the concept of weak random periodic solutions of random dynamical systems. Then, we discuss the existence of such periodic solutions. Further, we introduce the definition of weak random periodic measures and study their relationship with weak random periodic solutions. In particular, we establish the existence of invariant measures of random dynamical systems by virtue of their weak random periodic solutions. We use concrete examples to illustrate the weak random periodic phenomena of dynamical systems induced by random and stochastic differential equations.

We study the relationship between weak* Dunford–Pettis and weakly (resp. M-weakly, order weakly, almost M-weakly, and almost L-weakly) operators on Banach lattices. The following is one of the major results dealing with this matter: If E and F are Banach lattices such that F is Dedekind $\sigma $-complete, then each positive weak* Dunford–Pettis operator $T:E\rightarrow F$ is weakly compact if and only if one of the following assertions is valid: (a) the norms of $E^{\prime }$ and F are order continuous; (b) E is reflexive; and (c) F is reflexive.

Solving a nonsmooth and nonconvex minimization problem can be approached as finding a zero of a set-valued operator. With this perspective, we propose a novel Majorizer–Minimizer technique to find a local minimizer of a nonsmooth and nonconvex function and establish its convergence. Our approach leverages Bregman distances to generalize the classical quadratic regularization. By doing so, we generate a family of regularized problems that encompasses quadratic regularization as a special case. To further demonstrate the effectiveness of our method, we apply it on a lasso regression model, showcasing its performance.

In this article, we establish three new versions of Landau-type theorems for bounded bi-analytic functions of the form $F(z)=\bar {z}G(z)+H(z)$, where G and H are analytic in the unit disk with $G(0)=H(0)=0$ and $H'(0)=1$. In particular, two of them are sharp, while the other one either generalizes or improves the corresponding result of Abdulhadi and Hajj. As consequences, several new sharp versions of Landau-type theorems for certain subclasses of bounded biharmonic mappings are proved.

Let $(M, F, m)$ be a forward complete Finsler measure space. In this paper, we prove that any nonnegative global subsolution in $L^p(M)(p>1)$ to the heat equation on $\mathbb R^+\times M$ is uniquely determined by the initial data. Moreover, we give an $L^p(0<p\leq 1)$ Liouville-type theorem for nonnegative subsolutions u to the heat equation on $\mathbb R\times M$ by establishing the local $L^p$ mean value inequality for u on M with Ric$_N\geq -K(K\geq 0)$.

We investigate Eisenstein congruences between the so-called Euler systems of Garrett–Rankin–Selberg type. This includes the cohomology classes of Beilinson–Kato, Beilinson–Flach, and diagonal cycles. The proofs crucially rely on different known versions of the Bloch–Kato conjecture, and are based on the study of the Perrin-Riou formalism and the comparison between the different p-adic L-functions.

The celebrated Erdős–Ko–Rado (EKR) theorem for Paley graphs of square order states that all maximum cliques are canonical in the sense that each maximum clique arises from the subfield construction. Recently, Asgarli and Yip extended this result to Peisert graphs and other Cayley graphs which are Peisert-type graphs with nice algebraic properties on the connection set. On the other hand, there are Peisert-type graphs for which the EKR theorem fails to hold. In this article, we show that the EKR theorem of Paley graphs extends to almost all pseudo-Paley graphs of Peisert-type. Furthermore, we establish the stability results of the same flavor.

We improve and expand in two directions the theory of norms on complex matrices induced by random vectors. We first provide a simple proof of the classification of weakly unitarily invariant norms on the Hermitian matrices. We use this to extend the main theorem in Chávez, Garcia, and Hurley (2023, Canadian Mathematical Bulletin 66, 808–826) from exponent $d\geq 2$ to $d \geq 1$. Our proofs are much simpler than the originals: they do not require Lewis’ framework for group invariance in convex matrix analysis. This clarification puts the entire theory on simpler foundations while extending its range of applicability.

In this paper, we solved an open problem raised by Cecil and Ryan (2015, Geometry of Hypersurfaces, Springer Monographs in Mathematics, Springer, New York, p. 531) by proving the nonexistence of non-Hopf Ricci-semisymmetric real hypersurfaces in $\mathbb {C}P^{2}$ and $\mathbb {C}H^{2}$.

Determining the range of complex maps plays a fundamental role in the study of several complex variables and operator theory. In particular, one is often interested in determining when a given holomorphic function is a self-map of the unit ball. In this paper, we discuss a class of maps in $\mathbb {C}^N$ that generalize linear fractional maps. We then proceed to determine precisely when such a map is a self-map of the unit ball. In particular, we take a novel approach, obtaining numerous new results about this class of maps along the way.

Although Naimark dilation theorem was originally stated in 1940, it still finds many important applications in various areas. The objective of this paper is to introduce a method for explicitly constructing the vectors of complementary frames in the Naimark dilation theorem, specifically in cases where the initial Parseval frame contains a Riesz basis as a subset. These findings serve as a foundation for the construction of dual frames.

Williamson’s theorem states that for any $2n \times 2n$ real positive definite matrix A, there exists a $2n \times 2n$ real symplectic matrix S such that $S^TAS=D \oplus D$, where D is an $n\times n$ diagonal matrix with positive diagonal entries known as the symplectic eigenvalues of A. Let H be any $2n \times 2n$ real symmetric matrix such that the perturbed matrix $A+H$ is also positive definite. In this paper, we show that any symplectic matrix $\tilde {S}$ diagonalizing $A+H$ in Williamson’s theorem is of the form $\tilde {S}=S Q+\mathcal {O}(\|H\|)$, where Q is a $2n \times 2n$ real symplectic as well as orthogonal matrix. Moreover, Q is in symplectic block diagonal form with the block sizes given by twice the multiplicities of the symplectic eigenvalues of A. Consequently, we show that $\tilde {S}$ and S can be chosen so that $\|\tilde {S}-S\|=\mathcal {O}(\|H\|)$. Our results hold even if A has repeated symplectic eigenvalues. This generalizes the stability result of symplectic matrices for non-repeated symplectic eigenvalues given by Idel, Gaona, and Wolf [Linear Algebra Appl., 525:45–58, 2017].

In 1993, E. Lutwak established a minimax inequality for inscribed cones of origin symmetric convex bodies. In this work, we re-prove Lutwak’s result using a maxmin inequality for circumscribed cylinders. Furthermore, we explore connections between the maximum volume of inscribed double cones of a centered convex body and the minimum volume of circumscribed cylinders of its polar body.

I provide simplified proofs for each of the following fundamental theorems regarding selection principles:

1. (1) The Quasinormal Convergence Theorem, due to the author and Zdomskyy, asserting that a certain, important property of the space of continuous functions on a space is actually preserved by Borel images of that space.

2. (2) The Scheepers Diagram Last Theorem, due to Peng, completing all provable implications in the diagram.

3. (3) The Menger Game Theorem, due to Telgársky, determining when Bob has a winning strategy in the game version of Menger’s covering property.

4. (4) A lower bound on the additivity of Rothberger’s covering property, due to Carlson.

The simplified proofs lead to several new results.

We obtain a new upper bound for Neumann eigenvalues of the Laplacian on a bounded convex domain in Euclidean space. As an application of the upper bound, we derive universal inequalities for Neumann eigenvalues of the Laplacian.

We prove that every topologically stable homeomorphism with global attractor of $\mathbb {R}^n$ is topologically stable on its global attractor. The converse is not true. On the other hand, if a homeomorphism with global attractor of a locally compact metric space is expansive and has the shadowing property, then it is topologically stable. This extends the Walters stability theorem (Walters, On the pseudo-orbit tracing property and its relationship to stability. The structure of attractors in dynamical systems, 1978, pp. 231–244).

We provide conditions under which a generalized shift-invariant (GSI) system can be approximated by a GSI system for which the generators have compact support in the Fourier domain. The approximation quality will be measured in terms of the Bessel bound (upper frame bound) for the difference between the two GSI systems. In particular, this leads to easily verifiable conditions for a perturbation of a GSI system to preserve the frame property.

We settle the question of how to compute the entry and leaving arcs for turnpikes in autonomous variational problems, in the one-dimensional case using the phase space of the vector field associated with the Euler equation, and the initial/final and/or the transversality condition. The results hinge on the realization that extremals are the contours of a well-known function and that the transversality condition is (generically) a curve. An approximation algorithm is presented, and an example is included for completeness.