The Maximal Number of Orbits of a Permutation Group with Bounded Movement
β Scribed by Jung R. Cho; Pan Soo Kim; Cheryl E. Praeger
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 58 KB
- Volume
- 214
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract The number of independent vertex subsets is a graph parameter that is, apart from its purely mathematical importance, of interest in mathematical chemistry. In particular, the problem of maximizing or minimizing the number of independent vertex subsets within a given class of graphs has
We initiate a general approach for the fast enumeration of permutations with a prescribed number of occurrences of ''forbidden'' patterns that seems to indicate that the enumerating sequence is always P-recursive. We illustrate the method completely in terms of the patterns ''abc, '' ''cab,'' and ''
Let Ξ½ G denote the number of conjugacy classes of non-normal subgroups of a group G We prove that if G is a finite group and Ξ½ G = 0 then there is a cyclic subgroup C of prime power order contained in the centre of G such that the order of G/C is a product of at most Ξ½ G + 1 primes. We also obtain a
For a finite group G, let k G denote the number of conjugacy classes of G. We prove that a simple group of Lie type of untwisted rank l over the field of q Ε½ . l elements has at most 6 q conjugacy classes. Using this estimate we show that for Ε½ . Ε½ . 10 n completely reducible subgroups G of GL n, q