Bounded groups of transformations

Supplements of Bounded Groups

Let be innnite cardinals and let be a set of cardinality. The bounded permutation group B ((), or simply B , is the group consisting of all permutations of which move fewer than points in. We say that a permutation group G acting on is a supplement of B if B G is the full symmetric group on. In 7], Macpherson and Neumann claimed to have classiied all supplements of bounded permutation groups. S...

Generalized Cayley Transformations of Bounded Symmetric Domains

Infinite Bounded Permutation Groups

This work concerns permutation groups on uncountable sets. The environment is ZFC, Set Theory with Axiom of Choice. Therefore the cardinal numbers are wellordered, a cardinal number k is infinite if and only if Ko < k, and each cardinal number k has a unique successor k. Throughout the paper Cl will be a set (usually infinite), n its cardinality, and m a cardinal number less than n. The support...

Supplements of Bounded Permutation Groups

Let ). < i, be infinite cardinals and let Q be a set of cardinality 'c. The bounded permutation group B. (Q), or simply B2, is the group consisting of all permutations of Q which move fewer than A points in Q. We say that a permutation group G acting on Q is a supplement of B2 if BA G is the full symmetric group on Q. In [7], Macpherson and Neumann claimed to have classified all supplements of ...

Revisiting bounded context block-sorting transformations

The Burrows-Wheeler Transform (bwt) produces a permutation of a string X, denoted X∗, by sorting the n cyclic rotations of X into full lexicographical order, and taking the last column of the resulting n× n matrix to be X∗. The transformation is reversible in O(n) time. In this paper, we consider an alteration to the process, called k-bwt, where rotations are only sorted to a depth k. We propos...