Related papers: On planar right groups

The present article continues the study of median groups initiated in [6, 9, 10]. Some classes of median groups are introduced and investigated with a stress upon the class of the so called A-groups which contains as remarkable subclasses…

We give an example of a monoid with finitely many left and right ideals, all of whose Schutzenberger groups are presentable by finite complete rewriting systems, and so each have finite derivation type, but such that the monoid itself does…

We describe sufficient conditions which guarantee that a finite set of mapping classes generate a right-angled Artin group quasi-isometrically embedded in the mapping class group. Moreover, under these conditions, the orbit map to…

In this article we introduce and study a class of finite groups for which the orders of normal subgroups satisfy a certain inequality. It is closely connected to some well-known arithmetic classes of natural numbers.

In the paper it is proven that Carter subgroups of a finite group are conjugate. A complete classification of Carter subgroups in finite almost simple groups is also obtained.

We say that two elements of a group or semigroup are $\Bbbk$-linear conjugates if their images under any linear representation over $\Bbbk$ are conjugate matrices. In this paper we characterize $\Bbbk$-linear conjugacy for finite semigroups…

We obtain a complete description of the planar cubic Cayley graphs, providing an explicit presentation and embedding for each of them. This turns out to be a rich class, comprising several infinite families. We obtain counterexamples to…

We give a new characterisation of virtually free groups using graph minors. Namely, we prove that a finitely generated, infinite group is virtually free if and only if for any finite generating set, the corresponding Cayley graph is minor…

A balanced graph is a bipartite graph with no induced circuit of length 2 mod 4. These graphs arise in linear programming. We focus on graph-algebraic properties of balanced graphs to prove a complete classification of balanced Cayley…

In this paper we show that almost all Cayley digraphs have automorphism group as small as possible; that is, they are digraphical regular representations (DRRs). More precisely, we show that as $r$ tends to infinity, for every finite group…

An algebra is said to be quasi-directly finite when any left-invertible element in its unitization is automatically right-invertible. It is an old observation of Kaplansky that the von Neumann algebra of a discrete group has this property;…

We describe the groups that have the same holomorph as a finite perfect group. Our results are complete for centerless groups. When the center is non-trivial, some questions remain open. The peculiarities of the general case are illustrated…

Every mathematician is familiar with the beautiful structure of finite commutative groups. What is less well known is that finite commutative semigroups also have a neat and well-described structure. We prove this in an efficient fashion.…

A linear algebraic group G is over a field K is called a Cayley K-group if it admits a Cayley map, i.e., a G-equivariant K-birational isomorphism between the group variety G and its Lie algebra. We classify real reductive algebraic groups…

Let $G$ be a finite group. A number of graphs with the vertex set $G$ have been studied, including the power graph, enhanced power graph, and commuting graph. These graphs form a hierarchy under the inclusion of edge sets, and it is useful…

Using generating functions, we enumerate regular semisimple conjugacy classes in the finite classical groups. For the general linear, unitary, and symplectic groups this gives a different approach to known results; for the special…

In this paper, we consider the automorphism groups of the Cayley graph with respect to the Coxeter generators and the Davis complex of an arbitrary Coxeter group. We determine for which Coxeter groups these automorphism groups are discrete.…

In this note we introduce and characterize a class of finite groups for which the element orders satisfy a certain inequality. This is contained in some well-known classes of finite groups.

The power graph of a group $G$ is the graph whose vertex set is $G$ and two distinct vertices are adjacent if one is a power of the other. This paper investigates the minimal separating sets of power graphs of finite groups. For power…

We study P-groupoids that arise from certain decompositions of complete graphs. We show that left distributive P-groupoids are distributive, quasigroups. We characterize P-groupoids when the corresponding decomposition is a Hamiltonian…