Related papers: Genericity, the Arzhantseva-Ol'shanskii method and…

Two representations of a reductive group G are spectrally equivalent if the same irreducible representations appear in both of them. The semigroup of finite dimensional representations of G with tensor product and up to spectral equivalence…

We introduce and study Polish topologies on various spaces of countable enumerated groups, where an enumerated group is simply a group whose underlying set is the set of natural numbers. Using elementary tools and well known examples from…

Let $G$ be a non-trivial torsion free group and $s(t)=g_{1}t^{\epsilon_{1}}g_{2}t^{\epsilon_{2}} \cdots g_{n}t^{\epsilon_{n}}=1 \; (g_{i} \in G,\ \epsilon_i=\pm 1)$ be an equation over $G$ containing no blocks of the form…

Let $G$ be a higher rank semisimple real Lie group or the product of at least two automorphism groups of regular trees. We prove all probability measure preserving actions of lattices in such groups have cost one, answering Gaboriau's fixed…

The analogue of Lagrangians for symplectic forms over finite groups is studied, motivated by the fact that symplectic G-forms with a normal Lagrangian N<G are in one-to-one correspondence, up to inflation, with bijective 1-cocycle data on…

Given two automorphisms of a group $G$, one is interested in knowing whether they are conjugate in the automorphism group of $G$, or in the abstract commensurator of $G$, and how these two properties may differ. When $G$ is the fundamental…

Using the theory of group action, we first introduce the concept of the automorphism group of an exponential family or a graphical model, thus formalizing the general notion of symmetry of a probabilistic model. This automorphism group…

Let $M$ be a compact, connected manifold of positive dimension and let $\mathcal G\leq\textrm{Homeo}(M)$ be \emph{locally approximating} in the sense that for all open $U\subseteq M$ compactly contained in a single Euclidean chart of $M$,…

Let $G$ be a finitely generated group, and let $\Sigma$ be a finite subset that generates $G$ as a monoid. The \emph{word problem of $G$ with respect to $\Sigma$} consists of all words in the free monoid $\Sigma^{\ast}$ that are equal to…

As it follows from G\"odel's incompleteness theorems, any consistent formal system of axioms and rules of inference should imply a true unprovable statement. Actually, this fundamental principle can be efficiently applicable in…

This is the second in a series of four papers (with research announcement posted on this arXiv) that together develop a decomposition theory for subgroups of Out(F_n). In this paper we relativize the "Kolchin-type theorem" from the work of…

Let $V$ be a finite-dimensional unitary representation of a compact quantum group $\mathrm{G}$ and denote by $\mathrm{G}_W$ the isotropy subgroup of a linear subspace $W\le V$ regarded as a point in the Grassmannian $\mathbb{G}(V)$. We show…

We show that finitely generated irreducible $\mathrm{II}_1$ subfactors are generic in the following sense. Given a separable $\mathrm{II}_1$ factor $M$ and an integer $n\geq 2$, equip the set of $n$-tuples of self-adjoint operators in $M$…

In this paper, we focus on a question of M. Newman on isomorphic subgroups of solvable groups. We get a reduction theorem of this question: for each prime q, assume that this question holds for every characteristic q-groups, then this…

Let $G$ be a reductive algebraic group---possibly non-connected---over a field $k$ and let $H$ be a subgroup of $G$. If $G= GL_n$ then there is a degeneration process for obtaining from $H$ a completely reducible subgroup $H'$ of $G$; one…

An m-endomorphism of a free semigroup is an endomorphism that sends every generator to a word of length at most m. Two m-endomorphisms are combinatorially equivalent if they are conjugate under an automorphism of the semigroup. In this…

Let $G$ be a linear algebraic group over an algebraically closed field of characteristic $p\geq 0$. We show that if $H_1$ and $H_2$ are connected subgroups of $G$ such that $H_1$ and $H_2$ have a common maximal unipotent subgroup and…

Based on the notions of conciseness and semiconciseness, we show that these properties are not equivalent by proving that a word originally presented by Ol'shanskii is semiconcise but not concise. We further establish that every…

For any integers $m,n$ with $m\ne 0$ and $n>0$, let $G_{m,n}$ denote the group presented by $\langle x,y,z\mid x=[z^m,x][z^n,y]\rangle$; for any integers $m,n>0$, let $H_{m,n}$ denote the group presented by $\langle x,y,z\mid…

It is well known that the graph isomorphism problem is polynomial-time reducible to the graph automorphism problem (in fact these two problems are polynomial-time equivalent). We show that, analogously, the group isomorphism problem is…