منابع مشابه
Constructing Permutation Representations for Matrix Groups
New techniques, both theoretical and practical, are presented for constructing permutation representations for computing with matrix groups defined over finite fields. The permutation representation is constructed on a conjugacy class of subgroups of prime order. We construct a base for the permutation representation, which in turn simplifies the computation of a strong generating set. In addit...
متن کاملA unified approach to computations with permutation and matrix groups
We survey algorithms to compute with large finite permutation and matrix groups. Particular attention will be given to handling both types of groups with similar methods, using structural properties to answer even basic questions such as the order of the input group. Mathematics Subject Classification (2000). Primary 20B40; Secondary 20B15.
متن کاملQUASI-PERMUTATION REPRESENTATIONS OF METACYCLIC 2-GROUPS
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus, every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fa...
متن کاملPermutation Groups
The theory of permutation groups is essentially the theory of symmetry for mathematical and physical systems. It therefore has major impact in diverse areas of mathematics. Twentieth-century permutation group theory focused on the theory of finite primitive permutation groups, and this theory continues to become deeper and more powerful as applications of the finite simple group classification,...
متن کاملGalois Groups as Permutation Groups
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 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2007
ISSN: 0024-3795
DOI: 10.1016/j.laa.2006.11.007