نتایج جستجو برای: locally supersoluble group
تعداد نتایج: 1051288 فیلتر نتایج به سال:
In this paper, we introduce the probabilistic normed groups. Among other results, we investigate the continuityof inner automorphisms of a group and the continuity of left and right shifts in probabilistic group-norm. We also study midconvex functions defined on probabilistic normed groups and give some results about locally boundedness of such functions.
In this note, we show that cite[Corollary 3.2]{sad} is not always true. In fact, we characterize essential left $phi$-contractibility of the group algebras in terms of compactness of its related locally compact group. Also, we show that for any compact commutative group $G$, $L^{2}(G)$ is always essentially left $phi$-contractible. We discuss the essential left $phi$-contractibility of some Fou...
this study investigated the impact of explicit instruction of morphemic analysis and synthesis on the vocabulary development of the students. the participants were 90 junior high school students divided into two experimental groups and one control group. morphological awareness techniques (analysis/synthesis) and conventional techniques were used to teach vocabulary in the experimental groups a...
in this paper, we introduce the probabilistic normed groups. among other results, we investigate the continuityof inner automorphisms of a group and the continuity of left and right shifts in probabilistic group-norm. we also study midconvex functions defined on probabilistic normed groups and give some results about locally boundedness of such functions.
this is a survey article on centralizers of finite subgroups in locally finite, simple groups or lfs-groups as we will call them. we mention some of the open problems about centralizers of subgroups in lfs-groups and applications of the known information about the centralizers of subgroups to the structure of the locally finite group. we also prove the following: let $g$ be...
Locally Decodable codes(LDC) support decoding of any particular symbol of the input message by reading constant number of symbols of the codeword, even in presence of constant fraction of errors. In a recent breakthrough [9], Yekhanin constructed 3-query LDCs that hugely improve over earlier constructions. Specifically, for a Mersenne prime p = 2−1, binary LDCs of length 2O(n1/t) for infinitely...
in this paper we initiate the study of real group algebras and investigate some of its aspects.let l1 (g) be a group algebra of a locally compact group g,τ :g →g be a group homeomorphismsuch that τ 2 =τοτ = 1, the identity map, and lp (g,τ ) = { f ∈ lp (g) : fοτ = f } ( p ≥ 1) . in thispaper, among other results, we clarify the structure of lp (g,τ ) and characterize amenability ofl1 (g,τ ) and...
Following an active period of policy development and implementation in the 1990s,1 there have been two national great leaps forward that tackled geographical health inequalities in Australia in the new century. In 2000, in the context of growing disaffection in the rural electorate,2 the then health minister, Michael Wooldridge, was responsible for a federal Budget centrepiece of $562 million, ...
Matching families are one of the major ingredients in the construction of locally decodable codes (LDCs) and the best known constructions of LDCs with a constant number of queries are based on matching families. The determination of the largest size of any matching family in Zm, where Zm is the ring of integers modulo m, is an interesting problem. In this paper, we show an upper bound of O((pq)...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید