Related papers: Counting Schur Rings over Cyclic Groups
The enumeration of Hamiltonian cycles on 2n*2n grids of nodes is a longstanding problem in combinatorics. Previous work has concentrated on counting all cycles. The current work enumerates nonisomorphic cycles -- that is, the number of…
For every Turing machine, we construct an automaton group that simulates it. Precisely, starting from an initial configuration of the Turing machine, we explicitly construct an element of the group such that the Turing machine stops if, and…
A partition n = p_1 + p_2 + ... + p_k with 1 <= p_1 <= p_2 <= ... <= p_k is called non-squashing if p_1 + ... + p_j <= p_{j+1} for 1 <= j <= k-1. Hirschhorn and Sellers showed that the number of non-squashing partitions of n is equal to the…
In this paper cyclic codes are established with respect to the Mannheim metric over some finite rings by using Gaussian integers and the decoding algorithm for these codes is given.
We give a partial solution a question of Grigorchuk, Nekrashevych, Sushchanskii and \v{S}uni\'k by giving an algorithm to test whether a finite state element of an infinite iterated (permutational) wreath product $\hat G = \mathbb…
We study the ring of sections A(X) of a complete symmetric variety X, that is of the wonderful completion of G/H where G is an adjoint semi-simple group and H is the fixed subgroup for an involutorial automorphism of G. We find generators…
After the fundamental work of Livschitz in [1; 2], various research directions emerged, among which the following stand out: (i) the study of cocycles with values in groups and semigroups beyond R, as well as the investigation of…
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…
We give an algorithm to determine finitely many generators for a subgroup of finite index in the unit group of an integral group ring $\mathbb{Z} G$ of a finite nilpotent group $G$, this provided the rational group algebra $\mathbb{Q} G$…
Let $G$ be a group and $H_1$,...,$H_s$ be subgroups of $G$ of indices $d_1$,...,$d_s$ respectively. In 1974, M. Herzog and J. Sch\"onheim conjectured that if $\{H_i\alpha_i\}_{i=1}^{i=s}$, $\alpha_i\in G$, is a coset partition of $G$, then…
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…
We determine the rings of invariants in the symmetric algebra on the dual of a vector space V over the field of two elements, for the group G of orthogonal transformations preserving a non-singular quadratic form on V. The invariant ring is…
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…
Improving upon previous work on the subject, we use Wright's Circle Method to derive an asymptotic formula for the number of parts in all partitions of an integer that are in any given arithmetic progression.
Using techniques from integrable systems, we obtain a number of exact results for random partitions. In particular, we prove a simple formula for correlation functions of what we call the Schur measure on partitions (which is a far reaching…
Determining if a symmetric function is Schur-positive is a prevalent and, in general, a notoriously difficult problem. In this paper we study the Schur-positivity of a family of symmetric functions. Given a partition \lambda, we denote by…
Skew polynomial rings over finite fields ([7] and [10]) and over Galois rings ([8]) have been used to study codes. In this paper, we extend this concept to finite chain rings. Properties of skew constacyclic codes generated by monic right…
Infinitely many large Schur sigma-groups G with non-elementary bicyclic commutator quotient G/G' = C(3^e) x C(3), e >= 2, are constructed as periodic sequences of vertices in descendant trees of finite 3-groups. A single root gives rise to…
We provide a general method for computing rational Chow rings of moduli of smooth complete intersections. We specialize this result in different ways: to compute the integral Picard group of the associated stack ; to obtain an explicit…
We present a method of computing elements of spin groups in the case of arbitrary dimension. This method generalizes Hestenes method for the case of dimension 4. We use the method of averaging in Clifford's geometric algebra previously…