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

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

2008
STANISLAV N. FEDOTOV

A connected component of an affine algebraic group is called periodic if all its elements have finite order. We give a characterization of periodic components in terms of automorphisms with finite number of fixed points. It is also discussed which connected groups have finite extensions with periodic components. The results are applied to the study of the normalizer of a maximal torus in a simp...

Journal: :international journal of group theory 0
jiangtao shi yantai university

let $g={rm sl}_2(p^f)$ be a special linear group and $p$ be a sylow‎ ‎$2$-subgroup of $g$‎, ‎where $p$ is a prime and $f$ is a positive‎ ‎integer such that $p^f>3$‎. ‎by $n_g(p)$ we denote the normalizer of‎ ‎$p$ in $g$‎. ‎in this paper‎, ‎we show that $n_g(p)$ is nilpotent (or‎ ‎$2$-nilpotent‎, ‎or supersolvable) if and only if $p^{2f}equiv‎ ‎1,({rm mod},16)$‎.

‎Here‎, ‎we investigate a conjecture posed by Amiri and Ariannejad claiming‎ ‎that if every maximal subfield of a division ring $D$ has trivial normalizer‎, ‎then $D$ is commutative‎. ‎Using Amitsur classification of‎ ‎finite subgroups of division rings‎, ‎it is essentially shown that if‎ ‎$D$ is finite dimensional over its center then it contains a maximal‎ ‎subfield with non-trivial normalize...

Journal: :The Electronic Journal of Combinatorics 2009

Journal: :Integral Equations and Operator Theory 1999

Journal: :Australasian J. Combinatorics 2017
Michael Braun

All known direct constructions of designs over finite fields arise by subgroups of the normalizer of a Singer cycle, by lifted special linear groups, or lifted general linear groups. Other types of non-trivial automorphism groups for which designs over finite fields do exist have not been mentioned so far. In this paper we construct the first non-trivial designs over finite fields admitting the...

Journal: :Symmetry 2012
Allen D. Parks

It is shown that each element σ in the normalizer of the automorphism group Aut(G) of a simple graph G with labeled vertex set V is an Aut(G) invariant isomorphism between G and the graph obtained from G by the σ permutation of V—i.e., σ is a hidden permutation symmetry of G. A simple example illustrates the theory and the applied notion of system robustness for reconfiguration under symmetry c...

2009

Malwares are malignant software’s .It is designed to damage computer systems without the knowledge of the owner using the system. Software’s from reputable vendors also contain malicious code that affects the system or leaks information’s to remote servers.Malware’s includes computer viruses, spyware, dihonest ad-ware,rootkits,Trojans,dialers etc. The paper focuses on various Malware detection ...

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

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