tailieunhanh - Báo cáo toán học: "On the structure and classification of SOMAs: generalizations of mutually orthogonal Latin"

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: On the structure and classification of SOMAs: generalizations of mutually orthogonal Latin. | On the structure and classification of SOMAs generalizations of mutually orthogonal Latin squares Leonard H. Soicher School of Mathematical Sciences Queen Mary and Westfield College Mile End Road London E1 4NS . email Submitted April 13 1999 Accepted July 4 1999. Dedicated to Jaap Seidel on the occasion of his 80th birthday Abstract Let k 0 and n 2 be integers. A SOMA or more specifically a SOMA k n is an n X n array A whose entries are k-subsets of a kn-set Q such that each element of Q occurs exactly once in each row and exactly once in each column of A and no 2-subset of Q is contained in more than one entry of A. A SOMA k n can be constructed by superposing k mutually orthogonal Latin squares of order n with pairwise disjoint symbol-sets and so a SOMA k n can be seen as a generalization of k mutually orthogonal Latin squares of order n. In this paper we first study the structure of SOMAs concentrating on how SOMAs can decompose. We then report on the use of computational group theory and graph theory in the discovery and classification of SOMAs. In particular we discover and classify SOMA 3 10 s with certain properties and discover two SOMA 4 14 s SOMAs with these parameters were previously unknown to exist . Some of the newly discovered SOMA 3 10 s come from superposing a Latin square of order 10 on a SOMA 2 10 . 1 Introduction Throughout this paper k and n denote integers with k 0 and n 2. We initially define a SOMA or more specifically a SOMA k n to be an n X n array A whose 1991 Mathematics Subject Classification. Primary 05B30 Secondary 05-04 05B15. 1 THE ELECTRONIC .JOURNAL OF COmBINATORICS 6 1999 R32 2 entries are k-subsets of a kn-set Q called the symbol-set for A such that each element of Q occurs exactly once in each row and exactly once in each column of A and no 2-subset of Q is contained in more than one entry of A. We will later hnd it more convenient to regard a SOMA as a set of permutations satisfying certain properties.

TÀI LIỆU LIÊN QUAN
TỪ KHÓA LIÊN QUAN
crossorigin="anonymous">
Đã 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.