Related papers: Enumeration Techniques on Cyclic Schur Rings
This paper will briefly survey some recent methods of localization in group rings, which work in more general contexts than the classical Ore localization. In particular the Cohn localization using matrices will be described, but other…
In this article we describe the 2-cocycles, Schur multiplier and representation group of discrete Heisenberg groups over the unital rings of order $p^2$. We describe all projective representations of Heisenberg groups with entries from the…
This paper introduces a novel approach to enumerate and assess Trapping sets in quasi-cyclic codes, those with circulant sizes that are non-prime numbers. Leveraging the quasi-cyclic properties, the method employs a tabular technique to…
The exact degree bound for the generators of rings of polynomial invariants is determined for the finite, non-cyclic groups having a cyclic subgroup of index two. It is proved that the Noether number of these groups equals one half the…
Recently, it was proved that every commutative $p$-Schur ring over a group of order $p^3$ is Schurian. In this article, we consider the Schurity problem of non-commutative $p$-Schur rings over groups of order $p^3$. In particular, it is…
We describe and present a new construction method for codes using encodings from group rings. They consist primarily of two types: zero-divisor and unit-derived codes. Previous codes from group rings focused on ideals; for example cyclic…
Cluster analysis requires many decisions: the clustering method and the implied reference model, the number of clusters and, often, several hyper-parameters and algorithms' tunings. In practice, one produces several partitions, and a final…
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…
For a given permutation or set partition there is a natural way to assign a genus. Counting all permutations or partitions of a fixed genus according to cycle lengths or block sizes, respectively, is the main content of this article. After…
In this work, we generalize the integer enumeration basis. We also construct bijections between the elements of special sets and the elements of some groups, and treat the special case of the hyperoctohedral groups. Then, we find a code…
A theory of cyclic elements in semisimple Lie algebras is developed. It is applied to an explicit construction of regular elements in Weyl groups.
This article focuses on the study of cut groups, i.e., the groups which have only trivial central units in their integral group ring. We provide state of art for cut groups. The results are compiled in a systematic manner and have also been…
Integer partitions are one of the most fundamental objects of combinatorics (and number theory), and so is enumerating objects avoiding patterns. In the present paper we describe two approaches for the systematic counting of classes of…
The description of complex configuration is a difficult issue. We present a powerful technique for cluster identification and characterization. The scheme is designed to treat with and analyze the experimental and/or simulation data from…
In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the…
Maximal chord diagrams up to all isomorphisms are enumerated. The enumerating formula is based on a bijection between rooted one-vertex one-face maps on locally orientable surfaces and a certain class of symmetric chord diagrams. This…
A popular way to cluster a temporal network is to transform it into a sequence of networks, also called slices, where each slice corresponds to a time interval and contains the vertices and edges existing in that interval. A reason to…
We count tilings of the $n \times m$ rectangular grid, cylinder, and torus with arbitrary tile sets up to arbitrary symmetries of the square and rectangle, along with cyclic shifting of rows and columns. This provides a unifying framework…
Cyclic sieving is a well-known phenomenon where certain interesting polynomials, especially $q$-analogues, have useful interpretations related to actions and representations of the cyclic group. We propose a definition of sieving for an…
Let $RG$ be the gruop ring of the group $G$ over ring $R$ and $\mathscr{U}(RG)$ be its unit group. Finding the structure of the unit group of a finite group ring is an old topic in ring theory. In, G. Tang et al: Unit Groups of Group…