Maximal Independent Generating Sets of the Symmetric Group
نویسندگان
چکیده
منابع مشابه
On Generating All Maximal Independent Sets
Generating all configurations that satisfy a given specification (e.g., all permutations of n objects that do not fix any object) is a well-studied problem in combinatorics [6]. Graph theory suggests many interesting problems of this type (see, e.g., [7]). Among them, generating all maximal independent sets of a given graph is one that has attracted considerable attention in the past [4,5,8]. (...
متن کاملGenerating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2 with (k, r)-bounded intersections, i.e. in which the intersection of any k distinct hyperedges has size at most r. We consider the problem MIS(A, I): given a hypergraph A and a subfamily I ⊆ I(A), of its maximal independent sets (MIS) I(A), either extend this subfamily by constructing a new MIS...
متن کاملIndependent generating sets and geometries for symmetric groups
Julius Whiston showed that the size of an independent generating set in the symmetric group Sn is at most n−1. We determine all sets meeting this bound. We also give some general remarks on the maximum size of an independent generating set of a group and its relationship to coset geometries for the group. In particular, we determine all coset geometries of maximum rank for the symmetric group S...
متن کاملMAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE
Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...
متن کاملMaximal Independent Sets for the Pixel Expansion of Graph Access Structure
Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2000
ISSN: 0021-8693
DOI: 10.1006/jabr.2000.8399