Related papers: Constructing Nearby Commuting Matrices for Ogata's…

Approximate lattices of Euclidean spaces, also known as Meyer sets, are aperiodic subsets with fascinating properties. In general, approximate lattices are defined as approximate subgroups of locally compact groups that are discrete and…

We establish the existence of common fixed points for $C_q$-commuting self-mappings satisfying a generalized Gregus-type inequality with quadratic terms in $q$-starshaped subsets of normed linear spaces. Our framework extends classical…

We generalize entanglement detection with covariance matrices for an arbitrary set of observables. A generalized uncertainty relation is constructed using the covariance and commutation matrices, then a criterion is established by…

We study moderate deviations of suprema of parametrized sequences of sample bounded Gaussian processes $\{X _x(t), t\in T _x\}$, and first present recent sharp bounds in simple cases. In the almost periodic case, we prove an approximation…

It is shown that the correlation functions of the random variables $\det(\lambda - X)$, in which $X$ is a real symmetric $ N\times N$ random matrix, exhibit universal local statistics in the large $N$ limit. The derivation relies on an…

This paper investigates the properties of Quasi Maximum Likelihood estimation of an approximate factor model for an $n$-dimensional vector of stationary time series. We prove that the factor loadings estimated by Quasi Maximum Likelihood…

We define a stochastic variant of the proximal point algorithm in the general setting of nonlinear (separable) Hadamard spaces for approximating zeros of the mean of a stochastically perturbed monotone vector field and prove its convergence…

A new method to represent and approximate rotation matrices is introduced. The method represents approximations of a rotation matrix $Q$ with linearithmic complexity, i.e. with $\frac{1}{2}n\lg(n)$ rotations over pairs of coordinates,…

The approximate representation of operators by finite matrices is analysed in terms of accuracy and convergence. The identity operator, for example, can be reconstructed using a basis of harmonic oscillator states leading to a narrow peak…

In this document, some structured operator approximation theoretical methods for system identification of nearly eventually periodic systems, are presented. Let $\mathbb{C}^{n\times m}$ denote the algebra of $n\times m$ complex matrices.…

Using matrix-model methods we study three different N=2 models: U(N) x U(N) with matter in the bifundamental representation, U(N) with matter in the symmetric representation, and U(N) with matter in the antisymmetric representation. We find…

A discrete countable group G is matricially stable if the finite dimensional approximate unitary representations of G are perturbable to genuine representations in the point-norm topology. For large classes of groups G, we show that…

One of the most important classes of even $\Delta$-matroids arises from orientable ribbon graphs, which play a role analogous to that of graphic matroids in matroid theory. Motivated by a natural correspondence between strong…

We initiate the study of approximation algorithms and computational barriers for constructing sparse $\alpha$-navigable graphs [IX23, DGM+24], a core primitive underlying recent advances in graph-based nearest neighbor search. Given an…

In this paper, we prove a theorem that gives a simple criterion for generating commuting pairs of generalized almost complex structures on spaces that are the product of two generalized almost contact metric spaces. We examine the…

In this paper, we derive a new generalisation of the strong subadditivity of the entropy to the setting of general conditional expectations onto arbitrary finite-dimensional von Neumann algebras. The latter inequality, which we call…

We use the principle of almost orthogonality to give a new and simple proof that a sparse Lerner operator is bounded on a matrix- or operator-weighted space $L_W^{2}(\mu)$, where $\mu$ is a doubling measure on $\R^d$ if and only if the…

In the framework of General Relativity we develop a method for analysis of the operation of the optical position meters in their photodetectors proper reference frames. These frames are non-inertial in general due to the action of external…

In recent years, several algorithms, which approximate matrix decomposition, have been developed. These algorithms are based on metric conservation features for linear spaces of random projection types. We show that an i.i.d sub-Gaussian…

In this paper, we prove that the product of strongly quasi-nonexpansive $\Delta$-demiclosed mappings is also a strongly quasi-nonexpansive orbital $\Delta$-demiclosed mapping in Hadamard spaces. Additionally, we establish the…