English
Related papers

Related papers: Enumeration Techniques on Cyclic Schur Rings

200 papers

A finite group $G$ is called a Schur group, if any Schur ring over $G$ is the transitivity module of a point stabilizer in a subgroup of $\sym(G)$ that contains all right translations. We complete a classification of abelian $2$-groups by…

Combinatorics · Mathematics 2017-06-21 Mikhail Muzychuk , Ilya Ponomarenko

A finite group $G$ is called a Schur group if every Schur ring over $G$ is schurian, i.e. associated in a natural way with a subgroup of the symmetric group $Sym(G)$ that contains all right translations of $G$. The list of all possible…

Combinatorics · Mathematics 2026-05-19 Grigory Ryabov

A finite group $G$ is called a Schur group if any Schur ring over $G$ is associated in a natural way with a subgroup of $Sym(G)$ that contains all right translations. It is proved that the group $C_3\times C_3\times C_p$ is Schur for any…

Group Theory · Mathematics 2018-05-08 Ilia Ponomarenko , Grigory Ryabov

We study commutative Schur rings over the symplectic groups Sp$(n,2)$ containing the class $\mathcal C$ of symplectic transvections. We find the possible partitions of $\mathcal C$ determined by the Schur ring. We show how this restricts…

Group Theory · Mathematics 2024-04-12 Stephen P. Humphries

A Schur ring over a finite group is said to be decomposable if it is the generalized wreath product of Schur rings over smaller groups. In this paper we establish a sufficient condition for a decomposable Schur ring over the direct product…

Combinatorics · Mathematics 2018-10-24 István Kovács , Grigory Ryabov

The generalized wreath product of permutation groups is introduced. By means of it we study the schurity problem for S-rings over a cyclic group $G$ and the automorphism groups of them. Criteria for the schurity and non-schurity of the…

Combinatorics · Mathematics 2015-05-07 Sergei Evdokimov , Ilya Ponomarenko

For any finite group $G$ and a positive integer $m$, we define andstudy a Schur ring over the direct power $G^m$, which gives an algebraic interpretation of the partition of $G^m$ obtained by the $m$-dimensional Weisfeiler-Leman algorithm.…

Group Theory · Mathematics 2023-02-03 Gang Chen , Qing Ren , Ilia Ponomarenko

We describe a framework for systematic enumeration of families combinatorial structures which possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These…

Combinatorics · Mathematics 2008-02-28 Marni Mishna

A finite group $G$ is called a Schur group if any $S$-ring over $G$ is associated in a natural way with a subgroup of $Sym(G)$ that contains all right translations. We prove that the groups $\mathbb{Z}_3\times \mathbb{Z}_{3^n}$, where…

Group Theory · Mathematics 2017-09-13 Grigory Ryabov

Hierarchical clustering is a powerful tool for exploratory data analysis, organizing data into a tree of clusterings from which a partition can be chosen. This paper generalizes these ideas by proving that, for any reasonable hierarchy, one…

Machine Learning · Computer Science 2025-11-13 Andrew Draganov , Pascal Weber , Rasmus Skibdahl Melanchton Jørgensen , Anna Beer , Claudia Plant , Ira Assent

An explicit formula for the Schur multiplier of the group of unitriangular matrices over products of cyclic rings $\ZZ/m\ZZ$ and $\ZZ$ is derived. We use it to provide presentations of the corresponding covering groups and touch upon the…

Group Theory · Mathematics 2013-05-20 Urban Jezernik

We study the enumeration of set partitions, according to their length, number of parts, cyclic type, and genus. We introduce genus-dependent Bell, Stirling numbers, and Fa\`a di Bruno coefficients. Besides attempting to summarize what is…

Combinatorics · Mathematics 2024-02-13 Robert Coquereaux , Jean-Bernard Zuber

We determine the commutative Schur rings over $S_6$ that contain the sum of all the transpositions in $S_6$. There are eight such types (up to conjugacy), of which four have the set of all the transpositions as a principal set of the Schur…

Group Theory · Mathematics 2015-08-25 Amanda E. Francis , Stephen P. Humphries

Clustering is a common technique for statistical data analysis, which is used in many fields, including machine learning, data mining, pattern recognition, image analysis and bioinformatics. Clustering is the process of grouping similar…

Data Structures and Algorithms · Computer Science 2012-05-08 T. Soni Madhulatha

The cyclotomic matrix is commonly used to arrange cyclotomic numbers in a convenient format. A natural question is whether the structure of the matrix can reflect properties of these numbers. In this article, we examine cyclotomic numbers…

Rings and Algebras · Mathematics 2025-11-18 Wei-Liang Sun

We make a list of finite simple groups whose group rings over a given field are serial.

Rings and Algebras · Mathematics 2017-01-16 Andrei Kukharev , Gena Puninski

An $S$-ring (a Schur ring) is said to be separable with respect to a class of groups $\mathcal{K}$ if every algebraic isomorphism from the $S$-ring in question to an $S$-ring over a group from $\mathcal{K}$ is induced by a combinatorial…

Group Theory · Mathematics 2019-12-17 Grigory Ryabov

We present a new proof of a theorem of Schur's determining the least common multiple of the orders of all finite groups of complex $n \times n$-matrices whose elements have traces in the field of rational numbers. The basic method of proof…

Group Theory · Mathematics 2007-05-23 Robert M. Guralnick , Martin Lorenz

An $S$-ring (a Schur ring) is said to be separable with respect to a class of groups $\mathcal{K}$ if every its algebraic isomorphism to an $S$-ring over a group from $\mathcal{K}$ is induced by a combinatorial isomorphism. We prove that…

Combinatorics · Mathematics 2019-12-17 Grigory Ryabov

In this paper we propose a heuristic technique for distributing points on the surface of a unit n-dimensional Euclidean sphere, generated as the orbit of a finite cyclic subgroup of orthogonal matrices, the so called cyclic group codes.…

Information Theory · Computer Science 2015-09-21 João E. Strapasson , Cristiano Torezzan