English
Related papers

Related papers: Obstruction to a Higman embedding theorem for resi…

200 papers

We prove that every countable left-ordered group embeds into a finitely generated left-ordered simple group. Moreover, if the first group has a computable left-order, then the simple group also has a computable left-order. We also obtain a…

Group Theory · Mathematics 2022-03-09 Arman Darbinyan , Markus Steenbock

We classify affine varieties with an action of a connected, reductive algebraic group such that the group is isomorphic to an open orbit in the variety. This is accomplished by associating a set of one-parameter subgroups of the group to…

Algebraic Geometry · Mathematics 2010-12-20 David Murphy

Let $X$ be an algebraic surface with $\mathcal{L}$ an ample line bundle on $X$. Let $\Gamma(X, \mathcal{L})$ be the \emph{geometric monodromy} group associated to family of nonsingular curves in $X$ that are zero loci of sections of…

Geometric Topology · Mathematics 2024-03-13 Ishan Banerjee

Explicit embeddings of the group $\mathbb{Q}$ into a finitely presented group $\mathcal{Q}$ and into a $2$-generator finitely presented group $T_{\mathcal{Q}}$ are suggested. The constructed embeddings reflect questions mentioned by…

Group Theory · Mathematics 2023-10-18 V. H. Mikaelian

Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. Under some restrictions on the number of conjugacy classes of (non-normal) maximal subgroups of $G$, we prove that if $\sigma_1(G)<\frac{117}{20}\,$, then $G$ is…

Group Theory · Mathematics 2024-09-23 Marius Tărnăuceanu

We give a uniform construction that, on input of a recursive presentation $P$ of a group, outputs a recursive presentation of a torsion-free group, isomorphic to $P$ whenever $P$ is itself torsion-free. We use this to re-obtain a known…

Group Theory · Mathematics 2016-10-20 Maurice Chiodo

We construct an embedding of a free Burnside group $B(m,n)$ of odd $n > 2^{48}$ and rank $m >1$ in a finitely presented group with some special properties. The main application of this embedding is an easy construction of finitely presented…

Group Theory · Mathematics 2007-05-23 S. V. Ivanov

In this paper, we will prove some sufficient conditions for the solvability of groups.

Group Theory · Mathematics 2009-12-07 Hung P. Tong-Viet

The Diophantine problem for a monoid $M$ is the decision problem to decide whether any given system of equations has a solution in $M$. In this note, we give a simple example of a context-free, word-hyperbolic, finitely presented, special…

Group Theory · Mathematics 2022-05-03 Carl-Fredrik Nyberg-Brodda

Previous formulations of group theory in ACL2 and Nqthm, based on either "encapsulate" or "defn-sk", have been limited by their failure to provide a path to proof by induction on the order of a group, which is required for most interesting…

Logic in Computer Science · Computer Science 2022-05-27 David M. Russinoff

Let $G$ be a connected reductive group. We find a necessary and sufficient condition for a quasiaffine homogeneous space of $G$ to be embeddable into an irreducible $G$-module. In addition, for an affine homogeneous space we find a…

Representation Theory · Mathematics 2010-06-03 Ivan V. Losev

We construct a finitely presented group with property (T) which can not act on on reasonable spaces. Such group is constructed using an generalization of Hall embedding theorem, where property (T) is added at the expense of weakening the…

Group Theory · Mathematics 2026-02-02 Indira Chatterji , Martin Kassabov

We study fundamental groups of non compact Riemannian manifolds. We find conditions which ensure that the fundamental group is trivial, finite or finitely generated.

Differential Geometry · Mathematics 2007-05-23 Nader Yeganefar

In general the endomorphisms of a non-abelian group do not form a ring under the operations of addition and composition of functions. Several papers have dealt with the ring of functions defined on a group which are endomorphisms when…

Rings and Algebras · Mathematics 2016-02-24 Gary Walls , Linhong Wang

Viewing Dehn's algorithm as a rewriting system, we generalise to allow an alphabet containing letters which do not necessarily represent group elements. This extends the class of groups for which the algorithm solves the word problem to…

Group Theory · Mathematics 2008-01-16 Oliver Goodman , Michael Shapiro

We introduce and investigate different definitions of effective amenability, in terms of computability of F{\o}lner sets, Reiter functions, and F{\o}lner functions. As a consequence, we prove that recursively presented amenable groups have…

Group Theory · Mathematics 2018-07-04 Matteo Cavaleri

We present an algorithm that decides whether a finitely generated linear group over an infinite field is solvable-by-finite: a computationally effective version of the Tits alternative. We also give algorithms to decide whether the group is…

Group Theory · Mathematics 2019-05-15 A. S. Detinko , D. L. Flannery , E. A. O'Brien

Let $G$ be a virtually special group. Then the residual finiteness growth of $G$ is at most linear. This result cannot be found by embedding $G$ into a special linear group. Indeed, the special linear group $\text{SL}_k(\mathbb{Z})$, for $k…

Group Theory · Mathematics 2014-10-27 Khalid Bou-Rabee , Mark F. Hagen , Priyam Patel

Let $R$ be a finite unital commutative ring. We introduce a new class of finite groups, which we call hereditary groups over $R$. Our main result states that if $G$ is a hereditary group over $R$ then a unital algebra isomorphism between…

Representation Theory · Mathematics 2020-05-12 Taro Sakurai

We study fibers of word maps in finite, profinite, and residually finite groups. Our main result is that, for any word w in the free group on d generators, there exists $\epsilon > 0$ such that if G is a residually finite group with…

Group Theory · Mathematics 2017-06-27 Michael Larsen , Aner Shalev