On the Relational Complexity of a Finite Permutation Group
نویسنده
چکیده
The relational complexity ρ(X,G) of a finite permutation group is the least k for which the group can be viewed as an automorphism group acting naturally on a homogeneous relational system whose relations are k-ary (an explicit permutation group theoretic version of this definition is also given). In the context of primitive permutation groups, the natural questions are (a) rough estimates, or (preferably) precise values for ρ in natural cases; (b) a rough determination of the primitive permutation groups with ρ either very small (bounded), or very large (much larger than the logarithm of the degree). The rough version of (a) is relevant to (b). Our main result is an explicit characterization of the binary (ρ = 2) primitive affine permutation groups. We also compute the precise relational complexity of Altn acting on k-sets, correcting [4, Example 5].
منابع مشابه
QUASI-PERMUTATION REPRESENTATIONS OF SUZtTKI GROUP
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 fai...
متن کاملOn the Mark and Markaracter Tables of Finite Groups
Let G be a finite group and C(G) be the family of representative conjugacy classes of subgroups of G. The matrix whose H,K-entry is the number of fixed points of the set G/K under the action of H is called the table of marks of G where H,K run through all elements in C(G). Shinsaku Fujita for the first time introduced the term “markaracter” to discuss marks for permutation representati...
متن کامل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...
متن کاملSome counting problems related to permutation groups
1 'I count a lot of things that there's no need to count,' Cameron said. 'Just because that's the way I am. But I count all the things that need to be counted.' A relational structure M consists of a set X and a family of relations on X. The age of M is the class of finite relational structures (in the same language) embeddable in M.
متن کاملGroups with Two Extreme Character Degrees and their Minimal Faithful Representations
for a finite group G, we denote by p(G) the minimal degree of faithful permutation representations of G, and denote by c(G), the minimal degree of faithful representation of G by quasi-permutation matrices over the complex field C. In this paper we will assume that, G is a p-group of exponent p and class 2, where p is prime and cd(G) = {1, |G : Z(G)|^1/2}. Then we will s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013