International Journal of Algebra and Computation 

About: International Journal of Algebra and Computation is an academic journal published by World Scientific. The journal publishes majorly in the area(s): Group (mathematics) & Semigroup. It has an ISSN identifier of 0218-1967. Over the lifetime, 1761 publications have been published receiving 22336 citations. The journal is also known as: IJAC.

Relatively hyperbolic groups

Abstract: In this paper we develop some of the foundations of the theory of relatively hyperbolic groups as originally formulated by Gromov. We prove the equivalence of two definitions of this notion. One is essentially that of a group admitting a properly discontinuous geometrically finite action on a proper hyperbolic space, that is, such that every limit point is either a conical limit point or a bounded parabolic point. The other is that of a group which admits a cofinite action on a connected fine hyperbolic graph. We define a graph to be "fine" if there are only finitely many circuits a given length containing any given edge, and we develop some of the properties of this notion. We show how a relatively hyperbolic group can be assumed to act on a proper hyperbolic space of a particular geometric form. We define the boundary of a relatively hyperbolic group, and show that the limit set of any geometrically finite action of the group is equivariantly homeomorphic to this boundary. This generalizes a result of Tukia for geometrically finite kleinian groups. We also describe when the boundary is connected.

The structure of residuated lattices

Abstract: A residuated lattice is an ordered algebraic structure such that is a lattice, is a monoid, and \ and / are binary operations for which the equivalences hold for all a,b,c ∈ L. It is helpful to think of the last two operations as left and right division and thus the equivalences can be seen as "dividing" on the right by b and "dividing" on the left by a. The class of all residuated lattices is denoted by ℛℒ The study of such objects originated in the context of the theory of ring ideals in the 1930s. The collection of all two-sided ideals of a ring forms a lattice upon which one can impose a natural monoid structure making this object into a residuated lattice. Such ideas were investigated by Morgan Ward and R. P. Dilworth in a series of important papers [15, 16, 45–48] and also by Krull in [33]. Since that time, there has been substantial research regarding some specific classes of residuated structures, see for example [1, 9, 26] and [38], but we believe that this is the first time that a general structural theory has been established for the class ℛℒ as a whole. In particular, we develop the notion of a normal subalgebra and show that ℛℒ is an "ideal variety" in the sense that it is an equational class in which congruences correspond to "normal" subalgebras in the same way that ring congruences correspond to ring ideals. As an application of the general theory, we produce an equational basis for the important subvariety ℛℒC that is generated by all residuated chains. In the process, we find that this subclass has some remarkable structural properties that we believe could lead to some important decomposition theorems for its finite members (along the lines of the decompositions provided in [27]).

Noncommutative symmetric functions vi: free quasi-symmetric functions and related algebras

Abstract: This article is devoted to the study of several algebras related to symmetric functions, which admit linear bases labelled by various combinatorial objects: permutations (free quasi-symmetric functions), standard Young tableaux (free symmetric functions) and packed integer matrices (matrix quasi-symmetric functions). Free quasi-symmetric functions provide a kind of noncommutative Frobenius characteristic for a certain category of modules over the 0-Hecke algebras. New examples of indecomposable Hn(0)-modules are discussed, and the homological properties of Hn(0) are computed for small n. Finally, the algebra of matrix quasi-symmetric functions is interpreted as a convolution algebra.

A millennium project: constructing small groups

Abstract: We survey the problem of constructing the groups of a given finite order. We provide an extensive bibliography and outline practical algorithmic solutions to the problem. Motivated by the millennium, we used these methods to construct the groups of order at most 2000; we report on this calculation and describe the resulting group library.