نتایج جستجو برای: normal p

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

Abstract. A subgroup H of a group G is said to be SS-embedded in G if there exists a normal subgroup T of G such that HT is subnormal in G and H T H sG , where H sG is the maximal s- permutable subgroup of G contained in H. We say that a subgroup H is an SS-normal subgroup in G if there exists a normal subgroup T of G such that G = HT and H T H SS , where H SS is an SS-embedded subgroup of ...

Abolhasan Nadim, Amanollah Shafiee, Mansour Moetabar, Mohammad Danesh Pajouh,

Syndrome de P -R court et QRS normal avec les crises de tachycardie Paroxystique ou le syndrome de (Lown-Ganong-Levine). Dans une enqete epidemiologique sur les ma­ladies cardiovasculaires chez deux populations rurales de Roudsar et Azarbaidjan oriental nous avons retrouve 6 cas de P -R court avec QRS normal. Dans cet article nous avons brievement passe en revue les vois de conduction auriculov...

Journal: :Transactions of the American Mathematical Society 1966

Journal: :Colloquium Mathematicum 1981

2014
Antonio Beltrán María José Felipe Changguo Shao Evgenii I. Khukhro A. Beltrán M. J. Felipe C. Shao

LetN be a normal subgroup of a groupG and let p be a prime. We prove that if the p-part of jx j is a constant for every prime-power order element x 2 N n Z.N /, then N is solvable and has normal p-complement.

Journal: :J. Artif. Intell. Res. 2016
Petr Savický Petr Kucera

A matched formula is a CNF formula, such that the system of the sets of the variables, which appear in individual clauses, has a system of distinct representatives. Such a formula is always satisfiable. Matched formulas are used, for example, in the area of parametrized complexity. We prove that the problem of counting the number of the models (satisfying assignments) of a matched formula is #P...

2017
Petr Savický Petr Kucera

A matched formula is a CNF formula whose incidence graph admits a matching which matches a distinct variable to every clause. Such a formula is always satisfiable. Matched formulas are used, for example, in the area of parameterized complexity. We prove that the problem of counting the number of the models (satisfying assignments) of a matched formula is #P-complete. On the other hand, we defin...

Journal: :CoRR 2012
Koji Kobayashi

1. Overview This paper talks about difference between P and NP by using topological space that mean resolution principle. I pay attention to restrictions of antecedent and consequent in resolution, and show what kind of influence the restrictions have for difference of structure between P and NP regarding relations of relation. First, I show the restrictions of antecedent and consequent in reso...

Journal: :Annali di Matematica Pura ed Applicata (1923 -) 2014

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

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