نتایج جستجو برای: bounded approximate character amenability

تعداد نتایج: 207521  

2006
Badrish Chandramouli Jun Yang Amin Vahdat

As networks continue to grow in size and complexity, distributed network monitoring and resource querying are becoming increasingly difficult. Our aim is to design, build, and evaluate a scalable infrastructure for answering queries over distributed measurements, at reduced costs (in terms of both network traffic and query latency) while maintaining required precision. In this infrastructure, e...

Journal: :CoRR 2018
Alex Galakatos Michael Markovitch Carsten Binnig Rodrigo Fonseca Tim Kraska

Index structures are one of the most important tools that DBAs leverage in order to improve the performance of analytics and transactional workloads. However, with the explosion of data that is constantly being generated in a wide variety of domains including autonomous vehicles, Internet of Œings (IoT) devices, and E-commerce sites, building several indexes can o‰en become prohibitive and cons...

Journal: :bulletin of the iranian mathematical society 2011
a. r. medghalchi m. h. sattari t. yazdanpanah

2008
Kevin Whyte

We determine when a quasi-isometry between discrete spaces is at bounded distance from a bilipschitz map. From this we prove a geometric version of the Von Neumann conjecture on amenability. We also get some examples in geometric groups theory which show that the sign of the Euler characteristic is not a coarse invariant. Finally we get some general results on uniformly we finite homology which...

Journal: :international journal of group theory 2015
seyed ali moosavi

the concept of the bipartite divisor graph for integer subsets has been considered in [‎graph combinator., ‎ 26 (2010) 95--105‎.]. ‎in this paper‎, ‎we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph‎. ‎we show that if $g$ is a solvable group‎, ‎then the number of connected components of this graph is at most $2$ and if $g...

In this paper,  pseudo-amenability and pseudo-Connes amenability of weighted semigroup algebra $ell^1(S,omega)$ are studied. It is proved that pseudo-Connes amenability and pseudo-amenability of weighted group algebra $ell^1(G,omega)$ are the same. Examples are given to show that the class of $sigma$-Connes amenable dual Banach algebras is larger than that of Connes amenable dual Banach algebras.

In this paper among many other things we prove that the topological left amenability and left amenability of a weighted hypergroup (K, ?) are equivalent. For a normal subgroup H of K, we define a weight function ?? on KIH and obtain connection between left amenability of (K, ?) and (K|H, ??). Let H be a compact subhypergroup of K. We define the weight function on K||H and obtain connection...

2008
VLADIMIR PESTOV V. PESTOV

In this paper we further study links between concentration of measure in topological transformation groups, existence of fixed points, and Ramsey-type theorems for metric spaces. We prove that whenever the group Iso (U) of isometries of Urysohn’s universal complete separable metric space U, equipped with the compact-open topology, acts upon an arbitrary compact space, it has a fixed point. The ...

A. Khotanloo B. Tabatabaie Shourijeh G. H. Esslamzadeh

Let  and  be Banach algebras, ,  and . We define an -product on  which is a strongly splitting extension of  by . We show that these products form a large class of Banach algebras which contains all module extensions and triangular Banach algebras. Then we consider spectrum, Arens regularity, amenability and weak amenability of these products.

2002
Volker Runde

We define a Banach algebra A to be dual if A = (A∗) ∗ for a closed submodule A∗ of A∗. The class of dual Banach algebras includes all W ∗-algebras, but also all algebras M(G) for locally compact groups G, all algebras L(E) for reflexive Banach spaces E, as well as all biduals of Arens regular Banach algebras. The general impression is that amenable, dual Banach algebras are rather the exception...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید