English
Related papers

Related papers: Weak topologies for unbounded nets in CAT($0$) spa…

200 papers

In the setting of CAT(k) spaces, common fixed point iterations built from prox mappings (e.g. prox-prox, Krasnoselsky-Mann relaxations, nonlinear projected-gradients) converge locally linearly under the assumption of linear metric…

Optimization and Control · Mathematics 2021-12-13 Florian Lauster , D. Russell Luke

We have derived that on certain Banach spaces having a graph structure $G$, the iterations for asymptotically $G$-nonexpansive map will converge weakly towards a fixed point. This result unifies and extends several theorems on fixed points…

Functional Analysis · Mathematics 2022-02-28 Asrifa Sultana

In practice, since many communication networks are huge in scale or complicated in structure even dynamic, the predesigned network codes based on the network topology is impossible even if the topological structure is known. Therefore,…

Information Theory · Computer Science 2010-10-12 Xuan Guang , Fang-Wei Fu

The aim of this paper is to investigate the links between ${\cal T}_C$-class algorithms, CQ Algorithm and shrinking projection methods. We show that strong convergence of these algorithms are related to coherent ${\cal T}_C$-class sequences…

Optimization and Control · Mathematics 2009-09-21 Jean-Philippe Chancelier

We construct a weak Hilbert space that is a twisted Hilbert space.

Functional Analysis · Mathematics 2025-01-23 Jesús Suárez

We will study two subclasses of the class of feebly compact spaces in the class of (para)topological groups, the compact-bounded and weakly compact-bounded spaces, both introduced by J. Angoa, Y. F. Ortiz-Castillo and A. Tamariz-Mascar\'ua…

General Topology · Mathematics 2023-09-06 J. A. Martínez-Cadena

In this paper we have shown that a double sequence in a topological space satisfies certain conditions which in turn are capable to generate a topology on a non empty set. Also we have used the idea of I-convergence of double sequences to…

General Topology · Mathematics 2016-09-05 Amar Kumar Banerjee , Rahul Mondal

We consider random linear continuous operators $\Omega \to \mathcal{L}(\mathcal{H}, \mathcal{H})$ on a Hilbert space $\mathcal{H}$. For example, such random operators may be random quantum channels. The Central Limit Theorem is known for…

Functional Analysis · Mathematics 2025-10-07 S. V. Dzhenzher

This paper is concerned with relationships of weakly mixing, topologically weakly mixing, and sensitivity for non-autonomous discrete systems. It is shown that weakly mixing implies topologically weakly mixing and sensitivity for measurable…

Dynamical Systems · Mathematics 2016-06-07 Hua Shao , Yuming Shi , Hao Zhu

We establish general results for weak relative compactness of sequences of It\^o integrals with respect to Skorohod's functional M1 topology, under general conditions. Moreover, we are able to explicitly characterise the form of the limit…

Probability · Mathematics 2025-09-01 Fabrice Wunderlich

A dual pair formulation for asymmetric locally convex spaces is developed that strictly generalises the ordinary vector space setting. The concept of a polar topology carries over to the asymmetric case and some familiar results are…

General Topology · Mathematics 2026-02-24 Jobst Ziebell

In Functional Analysis, certain conclusions apply to sequences, but they cannot be carried over when we consider nets. In fact, some nets, including sequences, can behave unexpectedly. In this paper we are interested in exploring the…

Functional Analysis · Mathematics 2024-01-17 Sheldon Dantas , Daniel L. Rodríguez-Vidanes

We discuss some basic properties of polar convergence in metric spaces. Polar convergence is closely connected with the notion of Delta-convergence of T.C. Lim known for several years. Possible existence of a topology which induces polar…

Functional Analysis · Mathematics 2016-01-14 Giuseppe Devillanova , Sergio Solimini , Cyril Tintarev

In practice, since many communication networks are huge in scale, or complicated in structure, or even dynamic, the predesigned linear network codes based on the network topology is impossible even if the topological structure is known.…

Information Theory · Computer Science 2013-02-26 Xuan Guang , Fang-Wei Fu

One-counter nets (OCN) are Petri nets with exactly one unbounded place. They are equivalent to a subclass of one-counter automata with only a weak test for zero. We show that weak simulation preorder is decidable for OCN and that weak…

Formal Languages and Automata Theory · Computer Science 2014-06-17 Piotr Hofman , Richard Mayr , Patrick Totzke

We propose a new class of hypertopologies, called here weak$^{\ast }$ hypertopologies, on the dual space $\mathcal{X}^{\ast }$ of a real or complex topological vector space $\mathcal{X}$. The most well-studied and well-known hypertopology…

Functional Analysis · Mathematics 2021-03-16 J. -B. Bru , W. de Siqueira Pedra

This article is concerned with the study of weak solutions of a linear transport equation on a bounded domain with coupled boundary data for general non smooth space and time dependent velocity fields. The existence of solutions, its…

Analysis of PDEs · Mathematics 2015-06-29 Arne Roggensack

The theory of graphons is ultimately connected with the so-called cut norm. In this paper, we approach the cut norm topology via the weak* topology (when considering a predual of $L^{1}$-functions). We prove that a sequence…

Combinatorics · Mathematics 2021-01-05 Martin Doležal , Jan Grebík , Jan Hladký , Israel Rocha , Václav Rozhoň

Classically, there are two model category structures on coalgebras in the category of chain complexes over a field. In one, the weak equivalences are maps which induce an isomorphism on homology. In the other, the weak equivalences are maps…

Algebraic Topology · Mathematics 2015-05-26 Gabriel C. Drummond-Cole , Joseph Hirsh

A set N is called a "weak epsilon-net" (with respect to convex sets) for a finite set X in R^d if N intersects every convex set that contains at least epsilon*|X| points of X. For every fixed d>=2 and every r>=1 we construct sets X in R^d…

Combinatorics · Mathematics 2013-03-25 Boris Bukh , Jiří Matoušek , Gabriel Nivasch