Related papers: Canonicality of Makanin-Razborov Diagrams - Counte…

We prove that for any automorphism $\alpha$ of a free group F of finite rank, one can efficiently compute a basis of the fixed point subgroup Fix(\alpha).

We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…

We show that counterexamples of Iyengar and Walker to the algebraic version of Gunnar Carlsson's conjecture on the rank of the homology of a free complex can be extended to examples over any finite group with many choices of the complex.

A word in a group is called a test element if any endomorphism fixing it is necessarily an automorphism. In this note, we give a sufficient condition in geometry to construct test elements for monomorphisms of a free group, by using the…

This paper classifies the derivations of group algebras in terms of the generators and defining relations of the group. If $RG$ is a group ring, where $R$ is commutative and $S$ is a set of generators of $G$ then necessary and sufficient…

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…

Given an arbitrary, finitely presented, residually finite group $\Gamma$, one can construct a finitely generated, residually finite, free-by-free group $M_\Gamma = F_\infty\rtimes F_4$ and an embedding $M_\Gamma \hookrightarrow (F_4\ast…

Renormalization group method is one of the most powerful tool to obtain approximate solutions to differential equations. We apply the renormalization group method to Hamiltonian systems whose integrable parts linearly depend on action…

We prove that coherent configurations can be represented as modules over Frobenius structures in the category of real nonnegative matrices. We generalize the notion of admissible morphism from association schemes to coherent configurations.…

Let $U^-_q = U^-_q(\mathfrak g)$ be the negative part of the quantum group associated to a finite dimensional simple Lie algebra $\mathfrak g$, and $\sigma : \mathfrak g \to \mathfrak g$ be the automorphism obtained from the diagram…

We will explore the nature of when certain finite groups have an equal covering, and when finite groups do not. Not to be confused with the concept of a cover group, a covering of a group is a collection of proper subgroups whose…

We prove that, given a finitely generated subgroup $H$ of a free group $F$, the following questions are decidable: is $H$ closed (dense) in $F$ for the pro-(met)abelian topology? is the closure of $H$ in $F$ for the pro-(met)abelian…

We show that computing canonical representations for circular-arc (CA) graphs reduces to computing certain subsets of vertices called flip sets. For a broad class of CA graphs, which we call uniform, it suffices to compute a CA…

Let $G$, $H$ be groups and $\kappa$ be a cardinal. A bijection $f:G\to H$ is caled on asymorphism if, for any $X\in[G]^{<\kappa}$, $Y\in[H]^{<\kappa}$, there exist $X'\in[G]^{<\kappa}$, $Y'\in[H]^{<\kappa}$ such that for all $x\in G$ and…

Answering a question due to Min, we prove that a finite graph of roses admits a regluing such that the resulting graph of roses has hyperbolic fundamental group.

In order to apply canonical labelling of graphs and isomorphism checking in interactive theorem provers, these checking algorithms must either be mechanically verified or their results must be verifiable by independent checkers. We analyze…

Frobenius built a representation theory of finite groups in the process of obtaining the irreducible factorization of the group determinant. Here, we give a generalization of Frobenius' theorem. The generalization leads to a corollary on…

Let G be any locally compact, unimodular, metrizable group. The main result of this paper, roughly stated, is that if F<G is any finitely generated free group and \Gamma < G any lattice, then up to a small perturbation and passing to a…

It is well known that the opposite F^{op} of the category F of finitely generated free groups is a Lawvere theory for groups, and also that F is a free symmetric monoidal category on a commutative Hopf monoid, or, in other words, a PROP for…

We prove a result that relates the number of homomorphisms from the fundamental group of a compact nonorientable surface to a finite group $G$, where conjugacy classes of the boundary components of the surface must map to prescribed…