Related papers: Residually rationally solvable one-relator groups
We construct a solvable group G of order 5648590729620 such that the set of element orders of G coincides with that of the simple group S(4,3). This completes the determination of finite simple groups isospectral to solvable groups.
Guralnick, Kunyavskii, Plotkin and Shalev have shown that the solvable radical of a finite group $G$ can be characterized as the set of all $x\in G$ such that $<x,y>$ is solvable for all $y\in G$. We prove two generalizations of this…
There is a natural way to associate with a transformation of an isotopy class of rational tangles to another, an element of the modular group. The correspondence between the isotopy classes of rational tangles and rational numbers follows,…
Special orthogonal matrices with rational elements form the group SO(n,Q), where Q is the field of rational numbers. A theorem describing the structure of an arbitrary matrix from this group is proved. This theorem yields an algorithm for…
In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are…
We show that every finitely generated cohomologically trivial module over $RG$, where $G$ is a finite $p$-group and $R$ is a $p$-adic ring, splits as the direct sum of a finite cohomologically trivial $RG$-module and a free $RG$-module.…
In this note we study sets of normal generators of finitely presented residually $p$-finite groups. We show that if an infinite, finitely presented, residually $p$-finite group $G$ is normally generated by $g_1,\dots,g_k$ with order…
We present two tools, which could be useful in determining whether or not a non-Homogenous Linear Recurrence can reach a desired rational. First, we derive the determinant that is equal to the ith term in a non-Homogenous Linear Recurrence.…
We construct examples of finitely generated infinite simple groups of homeomorphisms of the real line. Equivalently, these are examples of finitely generated simple left (or right) orderable groups. This answers a well known open question…
We show that the derived category of any singularity over a field of characteristic 0 can be embedded fully and faithfully into a smooth triangulated category which has a semiorthogonal decomposition with components equivalent to derived…
It has been known since \cite{Pgroupchunk} that any group definable in an $o$-minimal expansion of the real field can be equipped with a Lie group structure. It is therefore natural to ask when is a Lie group Lie isomorphic to a group…
In this paper we study residual solvability of the amalgamated product of two finitely generated free groups, in the case of doubles. We find conditions where this kind of structure is residually solvable, and show that in general this is…
We give a construction of a family of locally finite residually finite groups with just-infinite C*-algebra. This answers a question from [2]. Additionally, we show that residually finite groups of finite exponent are never just-infinite.
Some simple nonlinear recursions which can be completely managed are identified and the behaviour of all their solutions is ascertained.
We show that the finitely generated simple left orderable groups $G_{\rho}$ constructed by the first two authors in arXiv:1807.06478 are uniformly perfect - each element in the group can be expressed as a product of three commutators of…
We investigate the finite soluble groups $G$ with the following property (replacement property): for every irredundant generating set $\{g_1,\dots,g_m\}$ of maximal size and for any $1\neq g\in G$ there exists an $i\in \{1,\dots,m\}$ so…
Uhlenbeck proved that a set of simple elements generates the group of rational loops in GL(n,C) that satisfy the U(n)-reality condition. For an arbitrary complex reductive group, a choice of representation defines a notion of rationality…
We show that every definable group G in an o-minimal structure is definably finitely generated. That is, G contains a finite subset that is not included in any proper definable subgroup. This provides another proof, and a generalization to…
The notion of a k-automatic set of integers is well-studied. We develop a new notion - the k-automatic set of rational numbers - and prove basic properties of these sets, including closure properties and decidability.
Given a connected linear algebraic group $G$, we descrive the subgroup of $G$ generated by all semisimple elements.