Related papers: Building Groups From Restricted Diagrams of Groups
Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…
We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…
Recently, we have endowed various categories of groups with topologies. The purpose of this paper is to introduce on these categories others topologies which are statistically more suitable to study well-known problems in groups theory. We…
We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.
We discuss in the context of finite extensions two classical theorems of Takahasi and Howson on subgroups of free groups. We provide bounds for the rank of the intersection of subgroups within classes of groups such as virtually free…
We generalise structure tree theory, which is based on removing finitely many edges, to removing finitely many vertices. This gives a significant generalization of Tutte's tree decomposition of 2-connected graphs into 3-connected blocks.…
Given a construction $f$ on groups, we say that a group $G$ is \textit{$f$-realisable} if there is a group $H$ such that $G\cong f(H)$, and \textit{completely $f$-realisable} if there is a group $H$ such that $G\cong f(H)$ and every…
We consider the realization of fundamental groups of $AF$-algebras in a certain class. We find the fundametal groups of $AF$-algebras with finite dimensional trace space which is not realizable as a fundamental group of von Neumann…
Restriction categories were established to handle maps that are partially defined with respect to composition. Tensor topology realises that monoidal categories have an intrinsic notion of space, and deals with objects and maps that are…
We describe constraints that need to be satisfied ``near the top'' of the portraits of the elements in Grigorchuk group. These constraints, if satisfied by the portraits of all sections of some binary tree automorphism, guarantee that this…
In this work we ask when a group is a 3-manifold group, or more specifically, when does a group presentation come naturally from a Heegaard diagram for a 3-manifold? We will give some conditions for partial answers to this form of the…
The aim of this paper is to survey some aspects of mapping class groups with focus on their finite dimensional representations arising in topological quantum field theory.
For a finitely generated free group F_n, of rank at least 2, any finite subgroup of Out(F_n) can be realized as a group of automorphisms of a graph with fundamental group F_n. This result, known as Out(F_n) realization, was proved by…
In this paper, we study the structures of finite groups using some arithmetic conditions on the sizes of real conjugacy classes. We prove that a finite group is solvable if the prime graph on the real class sizes of the group is…
We study the realization problem of finite groups as the group of homotopy classes of self-homotopy equivalences of finite spaces. Let $G$ be a finite group. Using an infinite family of pairwise non weakly homotopic asymmetric spaces we…
Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…
This paper aims to examine the version of the topological group structure in proximity and especially descriptive proximity spaces, that is, the concepts of proximal group and descriptive proximal group are introduced. In addition, the…
In this paper we obtain significant bounds for the number of maximal subgroups of a given index of a finite group. These results allow us to give new bounds for the number of random generators needed to generate a finite $d$-generated group…
This paper investigates the critical group of a faithful representation of a finite group. It computes the order of the critical group in terms of the character values, and gives some restrictions on its subgroup structure. It also computes…
The critical group of a graph is a finite abelian group whose order is the number of spanning forests of the graph. This paper provides three basic structural results on the critical group of a line graph. The first deals with connected…