Related papers: Path partial groups
Given a subgroup H of a finite group G, we begin a systematic study of the partial representations of G that restrict to global representations of H. After adapting several results from [DEP00] (which correspond to the case where H is…
Let $G$ be a finite group and $\sigma$ a partition of the set of all? primes $\Bbb{P}$, that is, $\sigma =\{\sigma_i \mid i\in I \}$, where $\Bbb{P}=\bigcup_{i\in I} \sigma_i$ and $\sigma_i\cap \sigma_j= \emptyset $ for all $i\ne j$. If $n$…
Given a finite group $G,$ we denote by $\Delta(G)$ the graph whose vertices are the elements $G$ and where two vertices $x$ and $y$ are adjacent if there exists a minimal generating set of $G$ containing $x$ and $y.$ We prove that…
In this paper we introduce a new species of evolution algebras that we call Cayley evolution algebras. We show that if a field $k$ contains sufficiently many elements (for example if $k$ is infinite) then every finite group $G$ is…
We describe an underlying right angled building structure of any graph product of buildings. We describe the automorphism group of the graph product of buildings. We show that the notion of generalized graph product of a collection of…
In this study we introduce the notions of semi-homotopy of semi-continuous maps and of semi-paths. We also construct a group structure, which will be called semi-fundamental group, using semi-loops and explore some properties of…
We call a bipartite graph {\it homogeneous} if every finite partial automorphism which respects left and right can be extended to a total automorphism. A $(\kappa,{\lambda} )$ bipartite graph is a bipartite graph with left side of size…
The groups QF, QT, and QV are groups of quasi-automorphisms of the infinite binary tree. Their names indicate a similarity with Thompson's well-known groups F, T, and V. We will use the theory of diagram groups over semigroup presentations…
We show that every non-Archimedean Polish group $P$ is the outer automorphism group of a countable discrete group $G_P$. Moreover, our construction provides a Borel map $f$ from the Effros space of closed subgroups of the permutation group…
A finite group R is a CI-group if, whenever S and T are subsets of R with the Cayley graphs Cay(R,S) and Cay(R,T) isomorphic, there exists an automorphism x of R with S^x=T. The classification of CI-groups is an open problem in the theory…
Using the canonical JSJ splitting, we describe the outer automorphism group $\Out(G)$ of a one-ended word hyperbolic group $G$. In particular, we discuss to what extent $\Out(G)$ is virtually a direct product of mapping class groups and a…
A countable group $G$ is said to be \emph{matricial field} (MF) if it admits a strongly converging sequence of approximate homomorphisms into matrices; i.e, the norms of polynomials converge to those in the left regular representation. $G$…
Let $\hat G$ be the finite simply connected version of an exceptional Chevalley group, and let $V$ be a nontrivial irreducible module, of minimal dimension, for $\hat G$ over its field of definition. We explore the overgroup structure of…
We show that the fundamental groups of any two closed irreducible non-geometric graph-manifolds are quasi-isometric. This answers a question of Kapovich and Leeb. We also classify the quasi-isometry types of fundamental groups of…
We characterize connected tetravalent graphs $\Gamma$ which admit groups $M<H$ of automorphisms such that $\Gamma$ is $M$-half-arc-transitive and $H$-arc-transitive. Examples for each case are constructed, including a counter-example to a…
Bergman has given the following abstract characterisation of the inner automorphisms of a group $G$: they are exactly those automorphisms of $G$ which can be extended functorially along any homomorphism $G \rightarrow H$ to an automorphism…
A {\it Schmidt group} is a non-nilpotent finite group in which each proper subgroup is nilpotent. Each Schmidt group G can be described by three parameters p, q and v, where p and q are different primes and v is a natural number, $v\ge 1$.…
Given a countable abelian group $A$, we construct a row finite directed graph $\Gamma(A)$ such that the $K_{0}$-group of the graph $\textrm{C}^{\ast}$-algebra $\textrm{C}^{\ast}(\Gamma(A))$ is canonically isomorphic to $A$. Moreover, each…
Any finite group can be encoded as the automorphism group of an unlabeled simple graph. Recently Hartke, Kolb, Nishikawa, and Stolee (2010) demonstrated a construction that allows any ordered pair of finite groups to be represented as the…
Let G be a simple, finite, connected, and undirected graph. The middle graph M(G) of G is obtained from the subdivision graph S(G) after joining pairs of subdivided vertices that lie on adjacent edges of G and the central graph C(G) of G is…