We show that the wreath product of two finite symmetric or alternating groups is 2-generated.

Let G = (V, E) be a simple connected graph. The geodesic distance between two vertices u, v in is the length terms of number edges shortest path vertices. In this paper, we determine Gd-distance wreath product graphs. Using formulae obtained here, have found exact value some classes

This paper gives necessary and sufficient conditions for the restricted wreath product of two monoids to be finitely generated or finitely presented.

The main result of the paper is a natural construction of the spherical subalgebra in a symplectic reflection algebra associated with a wreath-product in terms of quantum hamiltonian reduction of an algebra of differential operators on a representation space of an extended Dynkin quiver. The existence of such a construction has been conjectured in [EG]. We also present a new approach to reflect...

Results about wreath products of circulant graphs are used to construct infinitely many circulant graphswith efficient dominating setswhose elements need not be equally spaced in Zn. It is proved that if a circulant graph of large degree has an efficient dominating set, then either its elements are equally spaced, or the graph is the wreath product of a smaller circulant graph with an efficient...