Related papers: Centralizers in R. Thompson's group V_n

The theory of nilpotent orbits of simple Lie algebras has seen tremendous developments over the past decades. In this context an important role is played by the component group of the stabilizer of a nilpotent element. In this work, the aim…

Let $G$ be a finite group, and let $N(G)$ be the set of sizes of its conjugacy classes. We show that if a finite group $G$ has trivial center and $N(G)$ equals to $N(Alt_n)$ or $N(Sym_n)$ for $n\geq 23$, then $G$ has a composition factor…

This paper is concerned with the completion of the proof of the Bergman centralizer theorem by using generic matrices based on our previous quantization proof \cite{KBRZh}. Additionally, we establish that the algebra of generic matrices…

The universal centralizer of a semisimple algebraic group is the family of centralizers of regular elements, parametrized by their conjugacy classes. When the group is of adjoint type, we construct a smooth, log-symplectic fiberwise…

It is shown that for any action of a finitely presented group $G$ on an $\R$-tree, there is a decomposition of $G$ as the fundamental group of a graph of groups related to this action. If the action of $G$ on $T$ is non-trivial, i.e. there…

This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…

In this article we study the centralizer of a minimal aperiodic action of a countable group on the Cantor set (an aperiodic minimal Cantor system). We show that any countable residually finite group is the subgroup of the centralizer of…

We develop a method for proving the Boone--Higman Conjecture for groups acting on locally finite trees. As a consequence, we prove the Boone--Higman Conjecture for all Baumslag--Solitar groups and for all free(finite rank)-by-cyclic groups,…

The groups G_{k,1} of Richard Thompson and Graham Higman can be generalized in a natural way to monoids, that we call M_{k,1}, and to inverse monoids, called Inv_{k,1}; this is done by simply generalizing bijections to partial functions or…

We prove an analogue of the Centralizer Theorem in the context of Artin-Tits groups.

We find a recursive algorithm for computing the precise centralizers of the complex orthogonal and symplectic groups, and hence the isotropy groups, with respect to the similarity transformation on the spaces of skew-symmetric and…

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…

The Poisson centralizer of the trace element is determined in the coordinate ring of SL_n endowed with the Poisson structure obtained as the semiclassical limit of its quantized coordinate ring. It turns out that this maximal…

The twistor construction is applied for obtaining examples of generalized complex structures (in the sense of N. Hitchin) that are not induced by a complex or a symplectic structure.

Tree-graded spaces are generalizations of R-trees. They appear as asymptotic cones of groups (when the cones have cut points). Since many questions about endomorphisms and automorphisms of groups, solving equations over groups, studying…

We discuss metric and combinatorial properties of Thompson's group T, including normal forms for elements and unique tree pair diagram representatives. We relate these properties to those of Thompson's group F when possible, and highlight…

Let Gamma be a connected, locally finite graph of finite tree width and G be a group acting on it with finitely many orbits and finite node stabilizers. We provide an elementary and direct construction of a tree T on which G acts with…

In this paper we define a new family of groups which generalize the {\it classical braid groups on} $\C $. We denote this family by $\{B_n^m\}_{n \ge m+1}$ where $n,m \in \N$. The family $\{ B_n^1 \}_{n \in \N}$ is the set of classical…

We consider formal maps in any finite dimension $d$ with coefficients in an integral domain $K$ with identity. Those invertible under formal composition form a group $\mathcal{G}$. We consider the centraliser $C_g$ of an element…

Higher-order unification has been shown to be undecidable. Miller discovered the pattern fragment and subsequently showed that higher-order pattern unification is decidable and has most general unifiers. We extend the algorithm to…