Related papers: Counting Schur Rings over Cyclic Groups
We introduce a notion of {\em cyclic Schur-positivity} for sets of permutations, which naturally extends the classical notion of Schur-positivity, and it involves the existence of a bijection from permutations to standard Young tableaux…
In this paper we investigate some properties of ideals in group algebras of finite groups over fields. First, we highlight an important link between their dimension, their minimal Hamming distance and the group order. This is a generalized…
This article investigates structural connections between unrefinable partitions into distinct parts and numerical semigroups. By analysing the hooksets of Young diagrams associated with numerical sets, new criteria for recognising…
We compute the number of orbits of pairs in a finitely generated torsion module (more generally, a module of bounded order) over a discrete valuation ring. The answer is found to be a polynomial in the cardinality of the residue field whose…
We give a proper definition of the multiplicative structure of the following rings: the Cox ring of invertible sheaves on a general algebraic stack; and the Cox ring of rank one reflexive sheaves on a normal and excellent algebraic stack.…
We extend the notion of free $p$-central groups for odd primes $p$ to the case $p=2$ by introducing a variant of the lower $p$-central series. This enables us to calculate Schur multipliers of free $p$-central groups. We also prove that for…
The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…
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…
In discrete logarithm based cryptography, a method by Pohlig and Hellman allows solving the discrete logarithm problem efficiently if the group order is known and has no large prime factors. The consequence is that such groups are avoided.…
Let $C$ be a smooth and projective curve over the truncated polynomial ring $k_m:=k[t]/(t^m), $ where $k$ is a field of characteristic 0. Using a candidate for the motivic cohomology group ${\rm H}^{3}_{\pazocal{M}}(C,\mathbb{Q}(3))$ based…
Suppose $C(G)$ denotes the set of all cyclic subgroups of a finite group $G$, and $\mathcal{O}_{2}(G)$ denotes the number of elements of order $2$ in $G$. In [Marius T., Finite groups with a certain number of cyclic subgroups. The American…
A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: for any prime $p$, reduce its coefficients mod $p$ and consider its action on the field $\mathbb{F}_p$. The questions of whether and…
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…
For a reductive group $G$ over a finite field $k$, and a smooth projective curve $X/k$, we give a motivic counting formula for the number of absolutely indecomposable $G$-bundles on $X$. We prove that the counting can be expressed via the…
It was recently understood that one can identify a chiral algebra in any four-dimensional N=2 superconformal theory. In this note, we conjecture the full set of generators of the chiral algebras associated with the T_n theories. The…
This paper investigates the algebraic and graphical structure of the ring $\mathbb{Z}_{sp}$, with a focus on its decomposition into finite fields, kernels, and special subsets. We establish classical isomorphisms between $\mathbb{F}_s$ and…
Which groups can be the group of units in a ring? This open question, posed by L\'{a}szl\'{o} Fuchs in 1960, has been studied by the authors and others with a variety of restrictions on either the class of groups or the class of rings under…
We describe a group theoretic analysis of Shor's algorithm and other related hidden subgroup problems in mathematics and relate these to symmetries of molecular and condensed phase assemblies. By recasting Shor's algorithm through the lens…
We prove that the number of groups of order $p^n$ whose Frattini subgroup is central is for fixed $n$ a PORC (`polynomial on residue classes') function of $p$. This extends a result of G. Higman.
We present a method to explicitly compute a complete set of orthogonal primitive idempotents in a simple component with Schur index 1 of a rational group algebra $\mathbb{Q}G$ for $G$ a finite generalized strongly monomial group. For the…