Related papers: $\R^{n} \rtimes G(n)$ is Algebraically Determined

A Polish group is surjectively universal if it can be continuously homomorphically mapped onto every Polish group. Making use of a type of new metrics on free groups \cite{DG}, we prove the existence of surjectively universal Polish groups,…

We give sufficient conditions for a linear differential equation to have a given semisimple group as its Galois group. For any linear algebraic group G given as a semidirect product of a finite subgroup and a normal subgroup that is a…

We define the Born group as the group of transformations that leave invariant the line element of Minkowski's spacetime written in terms of Fermi coordinates of a Born congruence. This group depends on three arbitrary functions of a single…

We construct a new family of Cayley automatic representations of semidirect products $\mathbb{Z}^n \rtimes_A \mathbb{Z}$ for which none of the projections of the normal subgroup $\mathbb{Z}^n$ onto each of its cyclic components is finite…

The cone of a classical group $G$ is an affine $G\times G$-variety. The aim of this note is to initiate its combinatorial study in the cases when $G$ is the complex orthogonal or symplectic group. The coordinate ring of the cone of $G$ is a…

Let $H$ be a semisimple Hopf algebra over an algebraically closed field $\mathbbm{k}$ of characteristic $p>\dim_{\mathbbm{k}}(H)^{1/2}$ and $p\nmid 2\dim_{\mathbbm{k}}(H)$. In this paper, we consider the smash product semisimple Hopf…

The motivation of this article is to introduce a kind of orbit equivalence relations which can well describe structures and properties of Polish groups from the perspective of Borel reducibility. Given a Polish group $G$, let $E(G)$ be the…

A random algebraic graph is defined by a group $G$ with a uniform distribution over it and a connection $\sigma:G\longrightarrow[0,1]$ with expectation $p,$ satisfying $\sigma(g)=\sigma(g^{-1}).$ The random graph…

Let $G$ be a linear algebraic group over an algebraically closed field $k$ and $\mathrm{Aut}_{\mathrm{alg}}(G)$ the group of all algebraic group automorphisms of $G$. For every $\varphi\in \mathrm{Aut}_{\mathrm{alg}}(G)$ let…

Let $\Gamma$ be a finitely generated group and $N$ be a normal subgroup of $\Gamma$. The fiber product of $\Gamma$ with respect to $N$ is the subgroup $\Gamma \times_N \Gamma=\{(\gamma, \gamma w): \gamma \in \Gamma, w \in N\}$ of the direct…

For an analytic $P$-ideal $I$, $S_I$ is the Polish group of all the permutations of $\mathbb{N}$ whose support is in $I$, with Polish topology given by the corresponding submeasure on $I$. We show that if $\mbox{Fin} \subsetneq I$, then…

Let $\Aut(G)$ denote the group of (bi-)continuous automorphisms %and $\Out(G)$ the outer automorphism group of a non-Archimedean Polish group~$G$. We show that for any such $G$ with an invariant countable basis of open subgroups, the group…

A group of matrices $G$ with entries in a number field $K$ is defined to be numerical if $G$ has a finite index subgroup of matrices whose entries are algebraic integers. It is shown that an irreducible or completely reducible subgroup of…

A connected linear algebraic group G is called a Cayley group if the Lie algebra of G endowed with the adjoint G-action and the group variety of G endowed with the conjugation G-action are birationally G-isomorphic. In particular, the…

By an automorphism of a topological group G we mean an isomorphism of G onto itself which is also a homeomorphism. In this article, we study the automorphism group Aut(G) of a dense subgroup G of R^n, n>=1. We show that Aut(G) can be…

In this article, we introduce a hierarchy on the class of non-archimedean Polish groups that admit a compatible complete left-invariant metric. We denote this hierarchy by $\alpha$-CLI and L-$\alpha$-CLI where $\alpha$ is a countable…

In this article, motivated by a problem asked by Allison and Panagiotopoulos, we study a problem concerning the complexity of group extensions within a hierarchy (denoted by $\alpha$-CLI and L-$\alpha$-CLI) on the class of non-archimedean…

In this paper, we investigate the computational complexity of isomorphism testing for finite groups and quasigroups, given by their multiplication tables. We crucially take advantage of their various decompositions to show the following: -…

A {\it graph product} $G$ on a graph $\Gamma$ is a group defined as follows: For each vertex $v$ of $\Gamma$ there is a corresponding non-trivial group $G_v$. The group $G$ is the quotient of the free product of the $G_v$ by the commutation…

We prove that no quantifier-free formula in the language of group theory can define the $\aleph_1$-half graph in a Polish group, thus generalising some results from [6]. We then pose some questions on the space of groups of automorphisms of…