21,825 research outputs found
The topological centers and factorization properties of module actions and algebras
For Banach left and right module actions, we extend some propositions from
Lau and  into general situations and we establish the
relationships between topological centers of module actions. We also introduce
the new concepts as -property and -property for Banach
  and we obtain some conclusions in the topological center of
module actions and Arens regularity of Banach algebras. we also study some
factorization properties of left module actions and we find some relations of
them and topological centers of module actions. For Banach algebra , we
extend the definition of  algebra into Banach  
with some results in the factorizations of . We have some applications in
group algebras
Derivations And Cohomological Groups Of Banach Algebras
Let  be a Banach  and let . We investigate the
relationships between some cohomological groups of , that is, if the
topological center of the left module action 
of  on  is  and ,
then we have , and we find the relationships between
cohomological groups such as  and , spacial
 and . We obtain some results in
Connes-amenability of Banach algebras, and so for every compact group , we
conclude that . Let  be an
amenable locally compact group. Then there is a Banach  such
as  such that  We also obtain some conclusions in the Arens regularity of
module actions and weak amenability of Banach algebras. We introduce some new
concepts as  convergence property [property] and
 convergence property [property] with respect
to  and we show that if  and , respectively, have
property and property and  is weakly amenable, then
 is weakly amenable. We also show to relations between a derivation
 and this new concepts
Improved Online Algorithm for Weighted Flow Time
We discuss one of the most fundamental scheduling problem of processing jobs
on a single machine to minimize the weighted flow time (weighted response
time). Our main result is a -competitive algorithm, where  is the
maximum-to-minimum processing time ratio, improving upon the
-competitive algorithm of Chekuri, Khanna and Zhu (STOC 2001). We
also design a -competitive algorithm, where  is the
maximum-to-minimum density ratio of jobs. Finally, we show how to combine these
results with the result of Bansal and Dhamdhere (SODA 2003) to achieve a
-competitive algorithm (where  is the
maximum-to-minimum weight ratio), without knowing  in advance. As shown
by Bansal and Chan (SODA 2009), no constant-competitive algorithm is achievable
for this problem.Comment: 20 pages, 4 figure
- …
