Related papers: Some loose ends on unbounded order convergence
Lipschitz learning is a graph-based semi-supervised learning method where one extends labels from a labeled to an unlabeled data set by solving the infinity Laplace equation on a weighted graph. In this work we prove uniform convergence…
In this paper, we give a new completion for quasi-uniform spaces which generalizes the completion theories of Doitchinov [8] and Stoltenberg [20]. The presented completion theory is very well-behaved and extends the completion theory of…
Let $E$ and $F$ be Banach lattices. Let $G$ be a vector sublattice of $E$ and $T: G\rightarrow F$ be an order continuous positive compact (resp. weakly compact) operators. We show that if $G$ is an ideal or an order dense sublattice of $E$,…
We describe a generalization of the Lellouch-L\"uscher formula to the case of multiple strongly-coupled decay channels. As in the original formula, our final result is a relation between weak matrix elements in finite and infinite volumes.…
We prove the existence of free objects in certain subcategories of Banach lattices, including $p$-convex Banach lattices, Banach lattices with upper $p$-estimates, and AM-spaces. From this we immediately deduce that projectively universal…
The concept of a profile decomposition formalizes concentration compactness arguments on the functional-analytic level, providing a powerful refinement of the Banach-Alaoglu weak-star compactness theorem. We prove existence of profile…
We introduce a pointfree theory of convergence on lattices and coframes. A convergence lattice is a lattice $L$ with a monotonic map $\lim_L$ from the lattice of filters on $L$ to $L$, meant to be an abstract version of the map sending…
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…
Letting $E$, $F$ be Banach spaces, the main two results of this paper are the following: (1) If every (linear bounded) operator $E\rightarrow F$ is unconditionally converging, then every polynomial from $E$ to $F$ is unconditionally…
The applicability of classical Banach contraction mapping principle in solving diverse problems caught the attention of several researchers in various fields of science and engineering. Since its introduction, many extensions and…
In this paper, using generalized metric projection, we propose a new extragradient method for finding a common element of the solutions set of a generalized equilibrium problem and a variational inequality for an $\alpha$-inverse-strongly…
We study a convergence criterion which generalises the notion of being monotonically decreasing, and introduce a quantitative version of this criterion, a so called metastable rate of asymptotic decreasingness. We then present a concrete…
This article introduces an innovative mathematical framework designed to tackle non-linear convex variational problems in reflexive Banach spaces. Our approach employs a versatile technique that can handle a broad range of variational…
This paper establishes some equivalent conditions of a uninorm, extending an arbitrary triangular norm on [0, e] or an arbitrary triangular conorm on [e, 1] to the whole lattice.
The Cauchy problem for a quasilinear system of hyperbolic-parabolic equations is addressed with the method of linearization and fixed point. Coupling between the hyperbolic and parabolic variables is allowed in the linearization and we do…
We study the existence and the distribution of "long" chains in the Weihrauch degrees, mostly focusing on chains with uncountable cofinality. We characterize when such chains have an upper bound and prove that there are no cofinal chains…
We prove a sharp bound for the remainder term of the number of lattice points inside a ball, when averaging over a compact set of (not necessarily unimodular) lattices, in dimensions two and three. We also prove that such a bound cannot…
Consider the d-dimensional lattice Z^d where each vertex is ``open'' or ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w…
Trees are very agreeable objects to work with, offering a diversity of behaviour within a structure that is sufficiently simple to admit precise analysis. Thus we are able to offer fairly satisfactory necessary and sufficient conditions on…
We prove strong convergence theorems of some iterative algorithms in a real uniformly smooth Banach space. The results presented extend, generalize and improve the corresponding results recently announced by many authors.