Related papers: Classifying Finitely Generated Indecomposable RA L…
We obtain several fundamental results on finite index ideals and additive subgroups of rings as well as on model-theoretic connected components of rings, which concern generating in finitely many steps inside additive groups of rings. Let…
This paper surveys basic properties of finite presentation in groups, Lie algebras and rings. It includes some new results and also new, more elementary proofs, of some results that are already in the literature. In particular, we discuss…
In this paper, in the first we give definitions of some classes of division rings which strictly contain the class of centrally finite division rings. One of our main purpose is to construct non-trivial examples of rings of new defined…
We obtain a complete classification of all finite-dimensional irreducible modules over classical map superalgebras, provide formulas for their (super)characters and a description of their extension groups. Furthermore, we describe the block…
We derive an expression in closed form for the action of a finite element of the Virasoro Group on generalized vertex operators. This complements earlier results giving an algorithm to compute the action of a finite string of generators of…
Which groups can occur as the group of units in a ring? Such groups are called realizable. Though the realizable members of several classes of groups have been determined (e.g., cyclic, odd order, alternating, symmetric, finite simple,…
Provably correct software is one of the key challenges in our softwaredriven society. While formal verification establishes the correctness of a given program, the result of program synthesis is a program which is correct by construction.…
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…
We construct an infinite finitely generated recursively presented residually finite algorithmically finite group $G$ answering thereby a question of Myasnikov and Osin. Moreover, $G$ is "very infinite" and "very algorithmically finite" in…
We focus on working on incidence rings, a class of (possibly infinite) matrix rings indexed by ordered sets. Some general properties about them are given, including how they are always the inverse limit of finite matrix rings, giving a…
We propose a new simplified definition of extended affine Lie algebras (EALAs for short), and also discuss a general version of extended affine Lie algebras, called locally extended affine Lie algebras (LEALAs for short). We prove a…
Let Rep(F;K) denote the category of functors from finite dimensional F-vector spaces to K-modules, where F is a field and K is a commutative ring. We prove that, if F is a finite field, and Char F is invertible in K, then the K-linear…
We determine the structure of the semisimple group algebra of certain groups over the rationals and over those finite fields where the Wedderburn decompositions have the least number of simple components. We apply our work to obtain similar…
We study the structure of the category of integrable level zero representations with finite dimensional weight spaces of affine Lie algebras. We show that this category possesses a weaker version of the finite length property, namely that…
We construct the first examples of residually finite non-exact groups. The construction is based on author's earlier construction of groups containing isometrically expanders using a graphical small cancellation.
We give a topological framework for the study of Sela's limit groups: limit groups are limits of free groups in a compact space of marked groups. Many results get a natural interpretation in this setting. The class of limit groups is known…
In this paper we compute extension groups in the category of strict polynomial superfunctors and thereby exhibit certain "universal extension classes" for the general linear supergroup. Some of these classes restrict to the universal…
Linear-constraint loops are programs whose transition relation is specified by a system of linear inequalities. The termination problem asks, given a loop, whether it admits an infinite computation. Decidability of termination remains open…
We study a combinatorial object, which we call a GRRS (generalized reflection root system); the classical root systems and GRSs introduced by V. Serganova are examples of finite GRRSs. A GRRS is finite if it contains a finite number of…
For a finite $\mathbb{Z}$-algebra $R$, i.e., for a ring which is not necessarily associative or unitary, but whose additive group is finitely generated, we construct a decomposition of $R/{\rm Ann}(R)$ into directly indecomposable factors…