نتایج جستجو برای: strongly prime

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

2008
RICHARD M. FOOTE

This paper gives a complete classification of the finite groups that contain a strongly closed p-subgroup for p any prime.

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه ارومیه - دانشکده علوم 1391

a note on character kernels in finite groups of prime power orde

2009
Ramón J. Flores Richard M. Foote

This paper gives a complete classification of the finite groups that contain a strongly closed p-subgroup for p any prime.

Journal: :bulletin of the iranian mathematical society 0
e. yılmaz abant i̇zzet baysal university s. kılıçarslan cansu istanbul technical university

let $n$ be a submodule of a module $m$ and a minimal primary decomposition of $n$ is known‎. ‎a formula to compute baer's lower nilradical of $n$ is given‎. ‎the relations between classical prime submodules and their nilradicals are investigated‎. ‎some situations in which semiprime submodules can be written as finite intersection of classical prime submodule are stated‎.

2016
Md. Salim T. K. Dutta

In the year 1971, W. G. Lister [14] introduced the notion of ternary ring. Later in the year 2014, J. R. Castillo and Jocelyn S. ParaderoVilela [2] introduced the notion of krasner ternary hyperring. In [6] we introduce the notion of multiplicative ternary hyperring. In this paper we study prime hyperideals in a multiplicative ternary hyperring. We obtain some Characterizations of prime hyperid...

1978
JOGESH BABU

1. We say that g(n) is additive if g(mn)=g(m)+g(n) holds for every coprime pairs m, n of positive integers . If, moreover, g(p') =g(p)' for every prime power pa , then g(n) is called strongly additive . By p, pi , p2 , . . ., q, qr , q2 , . . . we denote prime numbers, c, Cl, c2i . . . are suitable positive constants . F(n) and x(n) denote the largest and the smallest prime factor of n . The sy...

Journal: :SIAM J. Control and Optimization 2017
Andrew Clark Basel Alomair Linda Bushnell Radha Poovendran

A common approach to controlling complex networks is to directly control a subset of input nodes, which then controls the remaining nodes via network interactions. Current approaches for selecting input nodes assume that either all system matrix entries are known and fixed, or are independent free parameters, and focus either on performance or controllability. In this paper, we make two contrib...

2003
Ville Ojanen Jyrki Tuomainen Mikko Sams

We studied the representations underlying audiovisual integration using a priming paradigm. Audiovisual primes, preceding auditory targets, were either incongruent (auditory /ba/ & visual /va/) or congruent (auditory /va/ & visual /va/, auditory /ba/ & visual /ba/). The targets were /ba/ or /va/. The intensity of the prime ́s auditory component was either 50 dB or 60 dB. Identification speed of ...

2015
Radislav Vaisman Matthew Roughan Dirk P. Kroese

Calculating the partition function of the zerotemperature antiferromagnetic model is an important problem in statistical physics. However, an exact calculation is hard, since it is strongly connected to a fundamental combinatorial problem of counting proper vertex colorings in undirected graphs, for which an efficient algorithm is not know to exist. Thus, one has to rely on approximation techni...

2015
JOHN LORCH

For prime powers q we use “strongly orthogonal” linear sudoku solutions of order q to construct ordered orthogonal arrays of type OOA(4, s, 2, q), and for each q we present a range of values of s for which these constructions are valid. These results rely strongly on flags of subspaces in a four dimensional vector space over a finite field.

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

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