相关论文: Computing generators of the unit group of an integ…
We study the problem of finding a subgroup of a given order in a finite group, where the group is represented by its Cayley table. We analyze the complexity of the problem in the special case of abelian groups and present an optimal…
The problem of computing the dimension of a left/right ideal in a group algebra F[G] of a finite group G over a field F is considered. The ideal dimension is related to the rank of a matrix originating from a regular left/right…
An isomorphism between the group ring of a finite group and a ring of certain block diagonal matrices is established. The group ring $RG$ of a finite group $G$ is isomorphic to the set of {\em group ring matrices} over $R$. It is shown that…
Given a finite abelian group $G$ and elements $x, y \in G$, we prove that there exists $\phi \in \text{Aut}(G)$ such that $\phi(x) = y$ if and only if $G/\langle x \rangle \cong G/\langle y \rangle$. This result leads to our development of…
We classify, up to isomorphism, the $\mathbb{Z}_pG$-modules of rank $1$ (i.e., the quotients of $\mathbb{Z}_pG$) for $G$ cyclic of order $p$, where $\mathbb{Z}_p$ is the ring of $p$-adic integers. This allows us in particular to determine…
We find finite, reasonably small, generator sets of the coordinate rings of G-character varieties of finitely generated groups for all classical groups G. This result together with the method of Grobner basis gives an algorithm for…
This paper classifies the derivations of twisted group algebras in terms of the generators and defining relations of the group. In particular, we generalize some know results over group algebras to the case of twisted group algebras. We…
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…
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…
Previously the second author has constructed by cobordism methods, an invariant associated to a finite group $G$. This invariant approximates the number of subgroups of a group, giving in some cases the number of abelian and cyclic…
We study a form of refined class number formula (resp. type number formula) for maximal orders in totally definite quaternion algebras over real quadratic fields, by taking into consideration the automorphism groups of right ideal classes…
The integral group rings $\mathbb{Z}G$ for finite groups $G$ are precisely those fusion rings whose basis elements have Frobenius-Perron dimension 1, and each is categorifiable in the sense that it arises as the Grothendieck ring of a…
This paper investigates the structure of $K_2$-groups for certain quotient rings of the integral group ring $\mathbb{Z}[G]$. Let $G$ be a finite abelian $p$-group with $p$-rank $r$, let $\Gamma$ be the maximal $\mathbb{Z}$-order of…
An order is a commutative ring that as an abelian group is finitely generated and free. A commutative ring is reduced if it has no non-zero nilpotent elements. In this paper we use a new tool, namely, the fact that every reduced order has a…
We present a method for computing the number of epimorphisms from a finitely-presented group G to a finite solvable group \Gamma, which generalizes a formula of G\"aschutz. Key to this approach are the degree 1 and 2 cohomology groups of G,…
In the study of Fuchsian groups, it is a nontrivial problem to determine a set of generators. Using a dynamical approach we construct for any cocompact arithmetic Fuchsian group a fundamental region in $\mathbf{SL}_2(\mathbb{R})$ from which…
L\'{a}szl\'{o} Fuchs posed the following question: which abelian groups arise as the group of units in a ring? In this paper, we investigate a related question: for such realizable groups $G$, when is there a ring $R$ with unit group $G$…
We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in…
We give an explicit and character-free construction of a complete set of orthogonal primitive idempotents of a rational group algebra of a finite nilpotent group and a full description of the Wedderburn decomposition of such algebras. An…
Let L be an abelian number field of degree n with Galois group G. In this paper we study how to compute efficiently a normal integral basis for L, if there is at least one, assuming that the group G and an integral basis for L are known.