Báo cáo toán học: "Automorphisms and enumeration of switching classes of tournaments"

Tuyển tập các báo cáo nghiên cứu khoa học trên tạp chí toán học quốc tế đề tài: Automorphisms and enumeration of switching classes of tournaments. | Automorphisms and enumeration of switching classes of tournaments L. Babai and P. J. Cameron Department of Computer Science University of Chicago Chicago IL 60637 A. laci@ School of Mathematical Sciences Queen Mary and Westfield College London E1 4NS . Submitted December 14 1999 Accepted August 1 2000 Abstract Two tournaments T1 and T2 on the same vertex set X are said to be switching equivalent if X has a subset Y such that T2 arises from T1 by switching all arcs between Y and its complement X Y. The main result of this paper is a characterisation of the abstract finite groups which are full automorphism groups of switching classes of tournaments they are those whose Sylow 2-subgroups are cyclic or dihedral. Moreover if G is such a group then there is a switching class C with Aut C G such that every subgroup of G of odd order is the full automorphism group of some tournament in C. Unlike previous results of this type we do not give an explicit construction but only an existence proof. The proof follows as a special case of a result on the full automorphism group of random G-invariant digraphs selected from a certain class of probability distributions. We also show that a permutation group G acting on a set X is contained in the automorphism group of some switching class of tournaments with vertex set X if and only if the Sylow 2-subgroups of 1 THE ELECTRONIC .JOURNAL OF COMBINATORICS 7 2000 R38 2 G are cyclic or dihedral and act semiregularly on X. Applying this result to individual permutations leads to an enumeration of switching classes of switching classes admitting odd permutations and of tournaments in a switching class. We conclude by remarking that both the class of switching classes of finite tournaments and the class of local orders that is tournaments switching-equivalent to linear orders give rise to countably infinite structures with interesting automorphism groups by a theorem of Fraisse . MR Subject .

Không thể tạo bản xem trước, hãy bấm tải xuống
TÀI LIỆU LIÊN QUAN
TỪ KHÓA LIÊN QUAN
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.