Related papers: On Almost convergence on the real line and its app…

We introduce the relation of "almost-reduction" in an arbitrary topological Ramsey space R, as a generalization of the relation of "almost-inclusion" on the space of infinite sets of natural numbers (the Ellentuck space). This leads us to a…

We approximate the solution to some linear and degenerate quasi-linear problem involving a linear elliptic operator (like the semi-discrete in time implicit Euler approximation of Richards and Stefan equations) with measure right-hand side…

In this paper we provide an approximation \`a la Ambrosio-Tortorelli of some classical minimization problems involving the length of an unknown one-dimensional set, with an additional connectedness constraint, in dimension two. We introduce…

It is first shown that the nilpotent or the solvable approximation of an almost-Riemannian structure at a singular point is always a linear almost-Riemannian structure on a Lie group or a homogeneous space. The generic properties of…

The Robbins-Monro stochastic approximation algorithm is a foundation of many algorithmic frameworks for reinforcement learning (RL), and often an efficient approach to solving (or approximating the solution to) complex optimal control…

Hardy property of means has been extensively studied by P\'ales and Pasteczka since 2016. The core of this research is based on few of their properties: concavity, symmetry, monotonicity, repetition invariance and homogeneity (last axiom…

We discuss how asymptotic quantities, originally introduced on null infinity in terms of Bondi-type gauge conditions, can be calculated near space-like infinity to any desired precision.

We consider a robust variant of the classical $k$-median problem, introduced by Anthony et al. \cite{AnthonyGGN10}. In the \emph{Robust $k$-Median problem}, we are given an $n$-vertex metric space $(V,d)$ and $m$ client sets $\set{S_i…

For any $s\in (1/2,1]$, the series$F_s(x)=\sum_{n=1}^{\infty} e^{i\pi n^2 x}/n^s$ converges almost everywhere on $[-1,1]$ by a result of Hardy-Littlewood, but not everywhere. However, there does not yet exist an intrinsic description of the…

We introduce a concept of approximately invertible elements in non-unital normed algebras which is, on one side, a natural generalization of invertibility when having approximate identities at hand, and, on the other side, it is a direct…

In this paper we introduce the notion of almost flatness for (stably) relative bundles on a pair of topological spaces and investigate basic properties of it. First, we show that almost flatness of topological and smooth sense are…

This review paper presents the results, which cover the study of current problems of approximation theory in abstract linear spaces. Such research has been actively developed since the 2000s, based on the ideas and approaches initiated in…

We present a new method for approximating real-valued functions on ${\mathbb R}^+$ by linear combinations of exponential functions with complex coefficients. The approach is based on a multi-point Pad\'e approximation of the Laplace…

This work is motivated by a question published in E. Glasner's paper On a question of Kazhdan and Yom Din regarding the possibility to approximate functionals on a Banach space which are almost invariant with respect to an action of a…

Holomorphic almost modular forms are holomorphic functions of the complex upper half plane which can be approximated arbitrarily well (in a suitable sense) by modular forms of congruence subgroups of large index in $\SL(2,\ZZ)$. It is…

The theory of abstract convexity, also known as convexity without linearity, is an extension of the classical convex analysis. There are a number of remarkable results, mostly concerning duality, and some numerical methods, however, this…

We study algorithmic randomness notions via effective versions of almost-everywhere theorems from analysis and ergodic theory. The effectivization is in terms of objects described by a computably enumerable set, such as lower semicomputable…

Determination of quasi-invariant generalized functions is important for a variety of problems in representation theory, notably character theory and restriction problems. In this note, we review some new and easy-to-use techniques to show…

Temporal difference (TD) learning with linear function approximation (linear TD) is a classic and powerful prediction algorithm in reinforcement learning. While it is well-understood that linear TD converges almost surely to a unique point,…

Approximate lattices are aperiodic generalisations of lattices of locally compact groups that were first studied in seminal work of Yves Meyer. They are defined as those uniformly discrete approximate subgroups (symmetric subsets stable…