Related papers: When the lower central series stops: a comprehensi…

We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are…

We show that the problem of constructing a real rational knot of a reasonably low degree can be reduced to an algebraic problem involving the pure braid group: expressing an associated element of the pure braid group in terms of the…

A general method for calculating or constructing lower central factors of groups is presented. {\it Relative basic commutators} are defined.

In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…

We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup…

Delta finite-type invariants are defined analogously to finite-type invariants, using delta moves instead of crossing changes. We show that they are closely related to the lower central series of the commutator subgroup of the pure braid…

We define an operation on finite graphs, called co-contraction. By showing that co-contraction of a graph induces an injective map between right-angled Artin groups, we exhibit a family of graphs, without any induced cycle of length at…

Sublinear time algorithms represent a new paradigm in computing, where an algorithm must give some sort of an answer after inspecting only a small portion of the input. The most typical situation where sublinear time algorithms are…

In this paper, we determine the genus of the subgroup lattice of several families of abelian groups. In doing so, we classify all finite abelian groups whose subgroup lattices can be embedded into the torus.

In this note we study the finite groups whose subgroup lattices are dismantlable.

Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups preserving the linear, projective and combinatorial…

We introduce the notion of the depth of a finite group $G$, defined as the minimal length of an unrefinable chain of subgroups from $G$ to the trivial subgroup. In this paper we investigate the depth of (non-abelian) finite simple groups.…

The graph braid group of a complete bipartite graph is the fundamental group of a configuration space of points on the graph, which is a CAT(0) cube complex. We combine an analysis of the topology of links of vertices in this complex, the…

Differential central simple algebras are the main object of study in this survey article. We recall some crucial notions such as differential subfields, differential splitting fields, tensor products etc. Our main focus is on differential…

A finite group G is said to be a cut group if all central units in the integral group ring ZG are trivial. In this article, we extend the notion of cut groups, by introducing extended cut groups. We study the properties of extended cut…

We study the lower central series of the right-angled Coxeter group $RC_\mathcal K$ and the corresponding associated graded Lie algebra $L(RC_\mathcal K)$ and describe the basis of the fourth graded component of $L(RC_\mathcal K)$ for any…

We generalize the common notion of descending and ascending central series. The descending approach determines a naturally graded Lie ring and the ascending version determines a graded module for this ring. We also link derivations of these…

This study focuses on exploring the use of local interpretability methods for explaining time series clustering models. Many of the state-of-the-art clustering models are not directly explainable. To provide explanations for these…

An algorithm for the explicit computation of a complete set of primitive central idempotents, Wedderburn decomposition and the automorphism group of the semisimple group algebra of a finite metabelian group is developed. The algorithm is…

We classify gradings on matrix algebras by a finite abelian group. A grading is called good if all elementary matrices are homogeneous. For cyclic groups, all gradings on a matrix algebra over an algebraically closed field are good. We can…