Related papers: Computing in unipotent and reductive algebraic gro…

We consider the natural Lie algebra structure on the (associative) group algebra of a finite group $G$, and show that the Lie subalgebras associated to natural involutive antiautomorphisms of this group algebra are reductive ones. We give a…

Let G be a profinite group. The following results are proved. The commutator subgroup G' is finite if and only if G is covered by countably many abelian subgroups. The group G is finite-by-nilpotent if and only if G is covered by countably…

We study the connectivity of proper power graphs of some family of finite groups including nilpotent groups, groups with a non-trivial partition, and symmetric and alternating groups.

The algorithm of computing generalized Green functions of a finite reductive group contains some unkonwn scalars occuring from the F_q structure of irreducible local systems on unipotent classes on G. In this paper, we determine such…

We consider spatial discretizations by the finite section method of the restricted group algebra of a finitely generated discrete group, which is represented as a concrete operator algebra via its left-regular representation. Special…

This paper deals with the number of subgroups of a given exponent in a finite abelian group. Explicit formulas are obtained in the case of rank two and rank three abelian groups. An asymptotic formula is also presented.

Group algebras have been used in the context of Coding Theory since the beginning of the latter, but not in its full power. The work of Ferraz and Polcino Milies entitled Idempotents in group algebras and minimal abelian codes (Finite…

Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus they model physically realizable computers. Engineering…

We give an algorithm for computing the irreducible admissible representations of a real reductive group with regular integral infinitesimal character. This algorithm has been implemented on a computer, as part of the Atlas of Lie Groups and…

The type and several invariant subspaces related to the upper annihilating series of finite-dimensional nilpotent evolution algebras are introduced. These invariants can be easily computed from any natural basis. Some families of nilpotent…

In the context of Higman embeddings of recursive groups into finitely presented groups we suggest an algorithm which uses Higman operations to explicitly constructs the specific recursively enumerable sets of integer sequences arising…

This paper is devoted to the complete algebraic classification of complex 5-dimensional nilpotent bicommutative algebras.

Hypergroups are lifted to power semigroups with negation, yielding a method of transferring results from semigroup theory. This applies to analogous structures such as hypergroups, hyperfields, and hypermodules, and permits us to transfer…

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 introduce and study some families of groups whose irreducible characters take values on quadratic extensions of the rationals. We focus mostly on a generalization of inverse semi-rational groups, which we call uniformly semi-rational…

The tropical semifield, i.e., the real numbers enhanced by the operations of addition and maximum, serves as a base of tropical mathematics. Addition is an abelian group operation, whereas the maximum defines an idempotent semigroup…

This paper focuses on the biderivations of 4-dimensional nilpotent complex Leibniz algebras. Using the existing classification of these algebras, we develop algorithms to compute derivations, antiderivations, and biderivations as pairs of…

A maximal abelian normal subgroup A in a nilpotent group N is self-centralizing. This makes their role an important one in determining the structure of the nilpotent group. For example if A is finite then N is also finite. In the free…

We prove that any finitely generated elementary amenable group of zero (algebraic) entropy contains a nilpotent subgroup of finite index or, equivalently, any finitely generated elementary amenable group of exponential growth is of…

In this paper we initiate a study of first-order rich groups, i.e., groups where the first-order logic has the same power as the weak second order logic. Surprisingly, there are quite a lot of finitely generated rich groups, they are…