Related papers: Enumeration Techniques on Cyclic Schur Rings

In this paper, we introduce a new function related to the sum of element orders of finite groups. It is used to give some criteria for a finite group to be cyclic, abelian, nilpotent, supersolvable and solvable, respectively.

We derive an explicit simple formula for expectations of all Schur functions in the real Ginibre ensemble. It is a positive integer for all entries of the partition even and zero otherwise. The result can be used to determine the average of…

The purpose of this paper is to investigate the properties of spectral and tiling subsets of cyclic groups, with an eye towards the spectral set conjecture in one dimension, which states that a bounded measurable subset of $\mathbb{R}$…

The computation of the normaliser of a permutation group in the full symmetric group is an important and hard problem in computational group theory. This article reports on an algorithm that builds a descending chain of overgroups to…

A Petri net is structurally cyclic if every configuration is reachable from itself in one or more steps. We show that structural cyclicity is decidable in deterministic polynomial time. For this, we adapt the Kosaraju's approach for the…

In this paper, a polynomial time algorithm for finding the set of all cyclic subsets in a graph is presented. The concept of cyclic subsets has already been introduced in an earlier paper. The algorithm finds cyclic subsets in a graph G by…

This paper addresses the problem of finding $Q_{m,t}\left(n\right)$, the number of possible ways to partition any member $n$ of the cyclic group $\mathbb{Z}/m\mathbb{Z}$ into $t$ distinct parts. When $m$ is odd, it was previously known that…

We define a class of finite groups based on the properties of the closed twins of their power graphs and study the structure of those groups. As a byproduct, we obtain results about finite groups admitting a partition by cyclic subgroups.

We investigate a new model for partitioning a set of items into groups (clusters). The number of groups is given and the distances between items are well defined. These distances may include weights. The sum of the distances between all…

An algorith to count, or alternatively generate, all k-element transversals of a set system is presented and compared with three known methods. For special cases it works in output-linear time.

This article examines group ring codes over finite fields and finite groups. We also present a section on two-dimensional cyclic codes in the quotient ring $\mathbb{F}_q[x, y] / \langle x^{l} - 1, y^{m} - 1 \rangle$. These two-dimensional…

We use generating functions over group rings to count polynomials over finite fields with the first few coefficients prescribed and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of…

We present the proof of the cyclic sieving conjectures for generalised non-crossing partitions associated to well-generated complex reflection groups due to Armstrong, respectively to Bessis and Reiner, for the 26 exceptional well-generated…

We define a generalization of the winding number of a piecewise $C^1$ cycle in the complex plane which has a geometric meaning also for points which lie on the cycle. The computation of this winding number relies on the Cauchy principal…

A semiring scheme generalizes a scheme in such a way that the underlying algebra is that of semirings. We generalize \v{C}ech cohomology theory and invertible sheaves to semiring schemes. In particular, when $X=\mathbb{P}^n_M$, a projective…

The group ring of the automorphism group of a p-group is studied using the automorphism groups of subgroups and quotient groups of P.

The simple connected graphs may be classified by their cycle composition (number and lengths of cycles). This work derives the counting series of the simple connected graphs that have cycles of unrestricted number and length, but no…

For more than 150 years the structure of the periodic system of the chemical elements has intensively motivated research in different areas of chemistry and physics. However, there is still no unified picture of what a periodic system is.…

In this paper, by using the Groebner-Shirshov bases, we give characterizations of the Schreier extensions of groups when the group is presented by generators and relations. An algorithm to find the conditions of a group to be a Schreier…

We define the rank of elements of general unital rings, discuss its properties and give several examples to support the definition. In semiprime rings we give a characterization of rank in terms of invertible elements. As an application we…