Related papers: Enumeration Techniques on Cyclic Schur Rings
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…
In 1993, Muzychuk \cite{muzychuk} showed that the rational Schur rings over a cyclic group $Z_n$ are in one-to-one correspondence with sublattices of the divisor lattice of $n$, or equivalently, with sublattices of the lattice of subgroups…
A finite group is said to be weakly separable if every algebraic isomorphism between two $S$-rings over this group is induced by a combinatorial isomorphism. In the paper we prove that every abelian weakly separable group belongs to one of…
A finite group $G$ is called a Schur group if every $S$-ring over $G$ is schurian, i.e. associated in a natural way with a subgroup of $\sym(G)$ that contains all right translations. We prove that every nonabelian nilpotent Schur group…
We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the obtained codes share most properties of cyclic codes. Since…
By using the structure and some properties of extraspecial and generalized/almost extraspecial $p$-groups, we explicitly determine the number of elements of specific orders in such groups. As a consequence, one may find the number of cyclic…
We introduce the notion of a Schur-finite element in a $\lambda$-ring.
We consider the groups of regular circulant matrices over finite fields and integer residue class rings. In both cases we present a formula for the order of these groups. We also make a first step towards finding the algebraic structure of…
In this paper, cyclic codes are established over some finite quaternion integer rings with respect to the quaternion Mannheim distance, and de- coding algorithm for these codes is given.
This note is a continuation of postgraduate thesis research carried out by the first author under the supervision of the second author at the University of Malta. In that research we took a look at several results relating Schur rings to…
We describe an algorithm for computing Schur indices of irreducible characters of a finite group $G$, based on computations within $G$ and its subgroups and with their character tables. The algorithm has been implemented within \Magma\ and…
In this work we explore the structure of the branching graph of the unitary group using Schur transitions. We find that these transitions suggest a new combinatorial expression for counting paths in the branching graph. This formula, which…
In this paper we investigate Schur ultrafilters on groups. Using the algebraic structure of Stone-\v{C}ech compactifications of discrete groups and Schur ultrafilters, we give a new description of Bohr compactifications of topological…
We study Schur Q-polynomials evaluated on a geometric progression, or equivalently q-enumeration of marked shifted tableaux, seeking explicit formulas that remain regular at q=1. We obtain several such expressions as multiple basic…
We classify the subsets of a group by their sizes, formalize the basic methods of partitions and apply them to partition a group to subsets of prescribed sizes.
An $S$-ring (Schur ring) is called separable with respect to a class of $S$-rings $\mathcal{K}$ if it is determined up to isomorphism in $\mathcal{K}$ only by the tensor of its structure constants. An abelian group is said to be separable…
Periodic Schur process is a generalization of the Schur process introduced in math.CO/0107056. We compute its correlation functions and their bulk scaling limits, and discuss several applications including asymptotic analysis of uniform…
We propose constructions of codes over quotient rings of Eisenstein integers equipped with the Euclidean, square Euclidean, and hexagonal distances as a generalization of codes over Eisenstein integer fields. By set partitioning, we…
We study the Schur elements and the a-function for cyclotomic Hecke algebras. As a consequence, we show the existence of canonical basic sets, as defined by Geck-Rouquier, for certain complex reflection groups. This includes the case of…
Self-dual cyclic codes form an important class of linear codes. It has been shown that there exists a self-dual cyclic code of length $n$ over a finite field if and only if $n$ and the field characteristic are even. The enumeration of such…