The k-Orbit Reconstruction for Abelian and Hamiltonian Groups

Let G be a permutation group on a set . Then G acts in the natural way on the collection ^{k} of all k-element subsets. Orbits under this action are called k-orbits. A problem similar to the Edge-Reconstruction Conjecture in graph theory can be posed for k-orbits of a general group G. Here the k-orbit reconstruction problem is solved for transitive Abelian and Hamiltonian groups: all k-orbits of Abelian groups are reconstructible if k>3 and the same is true for Hamiltonian groups if k>4.