نتایج جستجو برای: permutation groups

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

2015
KEITH CONRAD

Writing f(T ) = (T − r1) · · · (T − rn), the splitting field of f(T ) over K is K(r1, . . . , rn). Each σ in the Galois group of f(T ) over K permutes the ri’s since σ fixes K and therefore f(r) = 0⇒ f(σ(r)) = 0. The automorphism σ is completely determined by its permutation of the ri’s since the ri’s generate the splitting field over K. A permutation of the ri’s can be viewed as a permutation ...

Journal: :Israel Journal of Mathematics 2005

Journal: :Pacific Journal of Mathematics 1972

Journal: :Designs, Codes and Cryptography 2017

Journal: :Journal of the Australian Mathematical Society 1978

Journal: :European Journal of Combinatorics 1991

Journal: :Israel Journal of Mathematics 2022

In a 1937 paper B. H. Neumann constructed an uncountable family of 2-generated groups. We prove that all his groups are permutation stable by analyzing the structure their invariant random subgroups.

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

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