论文信息 - The k-Orbit Reconstruction for Abelian and Hamiltonian Groups

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.

V. B. Mnukhin | V. Mnukhin

[1] Peter J. Cameron. Groups, Combinatorics & Geometry: Some open problems on permutation groups , 1992 .

[2] V. B. Mnukhin,et al. The k-orbit reconstruction and the orbit algebra , 1992 .

[3] Adalbert Kerber,et al. Algebraic combinatorics via finite group actions , 1991 .

[4] Frank Harary,et al. The graph reconstruction number , 1985, J. Graph Theory.

[5] Frank Harary,et al. Graph Theory , 2016 .

[6] J. D. Key,et al. Regular Sets and Geometric Groups , 1987 .

[7] E. A. Maxwell. Generators and Relations for Discrete Groups. By H. S. M. Coxeter and W O. Moser. Pp. ix, 161. DM. 32. (Second Edition; Springer-Verlag) , 1966, The Mathematical Gazette.

[8] V. B. Mnukhin. Reconstruction of k-orbits of a permutation group , 1987 .

[9] Noga Alon,et al. Combinatorial reconstruction problems , 1989, J. Comb. Theory, Ser. B.

[10] H. Coxeter,et al. Generators and relations for discrete groups , 1957 .

[11] H. Wielandt,et al. Finite Permutation Groups , 1964 .