zbMATH — the first resource for mathematics

Schurity of S-rings over a cyclic group and generalized wreath product of permutation groups. (English. Russian original) Zbl 1278.20002
St. Petersbg. Math. J. 24, No. 3, 431-460 (2013); translation from Algebra Anal. 24, No. 3, 84-127 (2012).
Summary: With the help of the generalized wreath product of permutation groups introduced in the paper, the automorphism group of an S-ring over a finite cyclic group $$G$$ is studied. Criteria for the generalized wreath product of two such S-rings to be Schurian or non-Schurian are proved. As a byproduct, it is shown that the group $$G$$ is a Schur one (i.e., any S-ring over it is Schurian) whenever the total number $$\Omega(n)$$ of prime factors of the integer $$n=|G|$$ does not exceed 3. Moreover, the structure of a non-Schurian S-ring over $$G$$ is described in the case where $$\Omega(n)=4$$. In particular, the last result implies that if $$n=p^3q$$, where $$p$$ and $$q$$ are primes, then $$G$$ is a Schur group.

MSC:
 20C05 Group rings of finite groups and their modules (group-theoretic aspects) 20E22 Extensions, wreath products, and other compositions of groups 16S34 Group rings 05E30 Association schemes, strongly regular graphs 20B25 Finite automorphism groups of algebraic, geometric, or combinatorial structures
Full Text:
References:
 [1] S. A. Evdokimov and I. N. Ponomarenko, On a family of Schur rings over a finite cyclic group, Algebra i Analiz 13 (2001), no. 3, 139 – 154 (Russian, with Russian summary); English transl., St. Petersburg Math. J. 13 (2002), no. 3, 441 – 451. [2] S. A. Evdokimov and I. N. Ponomarenko, Characterization of cyclotomic schemes and normal Schur rings over a cyclic group, Algebra i Analiz 14 (2002), no. 2, 11 – 55 (Russian, with Russian summary); English transl., St. Petersburg Math. J. 14 (2003), no. 2, 189 – 221. · Zbl 1056.20001 [3] S. A. Evdokimov and I. N. Ponomarenko, Recognition and verification of an isomorphism of circulant graphs in polynomial time, Algebra i Analiz 15 (2003), no. 6, 1 – 34 (Russian, with Russian summary); English transl., St. Petersburg Math. J. 15 (2004), no. 6, 813 – 835. [4] R. A. Bailey, Cheryl E. Praeger, C. A. Rowley, and T. P. Speed, Generalized wreath products of permutation groups, Proc. London Math. Soc. (3) 47 (1983), no. 1, 69 – 82. · Zbl 0496.20018 · doi:10.1112/plms/s3-47.1.69 · doi.org [5] Sergei Evdokimov and Ilia Ponomarenko, Permutation group approach to association schemes, European J. Combin. 30 (2009), no. 6, 1456 – 1476. · Zbl 1228.05311 · doi:10.1016/j.ejc.2008.11.005 · doi.org [6] -, Schur rings over a product of Galois rings (submitted to Beiträge zur Algebra und Geometrie). · Zbl 1291.05227 [7] V. V. Ishkhanov, B. B. Lur$$^{\prime}$$e, and D. K. Faddeev, The embedding problem in Galois theory, Translations of Mathematical Monographs, vol. 165, American Mathematical Society, Providence, RI, 1997. Translated from the 1990 Russian original by N. B. Lebedinskaya. · Zbl 0883.12002 [8] M. H. Klin and R. Pöschel, The König problem, the isomorphism problem for cyclic graphs and the method of Schur rings, Algebraic methods in graph theory, Vol. I, II (Szeged, 1978) Colloq. Math. Soc. János Bolyai, vol. 25, North-Holland, Amsterdam-New York, 1981, pp. 405 – 434. [9] Ka Hin Leung and Shing Hing Man, On Schur rings over cyclic groups. II, J. Algebra 183 (1996), no. 2, 273 – 285. · Zbl 0860.20005 · doi:10.1006/jabr.1996.0220 · doi.org [10] R. Pöschel, Untersuchungen von \?-Ringen, insbesondere im Gruppenring von \?-Gruppen, Math. Nachr. 60 (1974), 1 – 27 (German). · Zbl 0273.20005 · doi:10.1002/mana.19740600102 · doi.org [11] Helmut Wielandt, Finite permutation groups, Translated from the German by R. Bercov, Academic Press, New York-London, 1964. · Zbl 0138.02501 [12] -, Permutation groups through invariant relations and invariant functions, Lecture Notes Dept. Math. Ohio State Univ., Columbus, Ohio, 1969.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.