نتایج جستجو برای: cosets

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

2009
Ulf H. Danielsson Sheikh Shajidul Haque Gary Shiu Thomas Van Riet

We investigate the type II string effective potential at tree-level and derive necessary ingredients for having de Sitter solutions in orientifold models with fluxes. Furthermore, we examine some explicit O6 compactifications in IIA theory on manifolds with SU(3)-structure in the limit where the orientifold sources are smeared. In particular, we use a simple ten-dimensional Ansatz for four-dime...

Journal: :Wireless Personal Communications 1995
Peter W. J. Van Eetvelt Simon J. Shepherd Stephen K. Barton

This paper presents the results of a preliminary investigation into the distribution of peak factors in the QPSK message space for different numbers of carriers with the aim of determining those messages which exhibit a low peak factor relative to a given threshold. A group structure is suggested which associates cosets of 16 messages into equivalence classes having the same peak power. Algorit...

Journal: :International Journal of Computer Applications 2010

Journal: :Fundamental journal of mathematics and applications 2022

The motivation of this article is to define approximately near rings, some types $N$-groups, ideals, and rings all descriptive cosets. Moreover, properties these algebraic structures are given. Furthermore, near-ring homomorphisms introduced their investigated.

Journal: :Monatshefte für Mathematik 2022

Abstract Let G be a finite group, N normal subgroup of and K conjugacy class . We prove that if $$K\cup K^{-1}$$ K ∪ - 1 is union cosets , then soluble, real-imaginary class, is, every irreducible character takes ...

2002
Julius Kusuma Kannan Ramchandran

We describe a constructive coset-based coding framework for the general broadcast problem. Our construction is inspired by the information-theoretic framework of Marton [16], who used the concept of random binning to provide the best-known achievable broadcast region to date. Our approach leverages our recent coset-based construction for the Slepian-Wolf coding problem. The key enabling idea is...

2004
Günter Lettl Zhi-Wei Sun ZHI-WEI SUN

Let G be any abelian group and {asGs}ks=1 be a finite system of cosets of subgroups G1, . . . , Gk. We show that if {asGs} k s=1 covers all the elements of G at least m times with the coset atGt irredundant then [G : Gt] 6 2 and furthermore k > m + f([G : Gt]), where f( ∏ r i=1 p αi i ) = ∑ r i=1 αi(pi − 1) if p1, . . . , pr are distinct primes and α1, . . . , αr are nonnegative integers. This ...

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

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