English
Related papers

Related papers: Solvable matrix groups and the Burnside problem

200 papers

We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…

Group Theory · Mathematics 2026-03-30 Alexey Talambutsa

In this paper, we investigate finite solvable tidy groups. We classify the tidy $\{ p, q \}$-groups. Combining this with a previous result, we are able to characterize the finite tidy solvable groups. Using this characterization, we bound…

We construct the first examples of an algorithmically complex finitely presented residually finite groups and first examples of finitely presented residually finite groups with arbitrarily large (recursive) Dehn function and depth function.…

Group Theory · Mathematics 2013-03-25 O. Kharlampovich , A. Myasnikov , M. Sapir

We prove that the quasivariety of groups generated by finite and locally indicable groups does not contain the class of periodic groups. This result is related to (and inspired by) the solvability of equations over groups. The proof uses…

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

Let $G$ be a solvable subgroup of the group $\diff{}{n}$ of local complex analytic diffeomorphisms. Analogously as for groups of matrices we bound the solvable length of $G$ by a function of $n$. Moreover we provide the best possible bounds…

Dynamical Systems · Mathematics 2017-02-10 Mitchael Martelo , Javier Ribón

Let $S$ be a closed surface and $\text{Diff}_{\text{Vol}}(S)$ be the group of volume preserving diffeomorphisms of $S$. A finitely generated group $G$ is periodic of bounded exponent if there exists $k \in \mathbb{N}$ such that every…

Dynamical Systems · Mathematics 2020-12-23 Sebastian Hurtado , Alejandro Kocsard , Federico Rodríguez-Hertz

In 2003, Cohn and Umans proposed a group-theoretic approach to bounding the exponent of matrix multiplication. Previous work within this approach ruled out certain families of groups as a route to obtaining $\omega = 2$, while other…

Group Theory · Mathematics 2022-04-11 Jonah Blasiak , Henry Cohn , Joshua A. Grochow , Kevin Pratt , Chris Umans

We first prove that the Whitehead group of a torsion-free virtually solvable linear group vanishes. Next we make a reduction of the fibered isomorphism conjecture from virtually solvable groups to a class of virtually solvable Q-linear…

K-Theory and Homology · Mathematics 2007-05-23 Tom Farrell , Peter Linnell

In this paper we study the finite groups in which every element has prime power order, briefly them EPPO-groups. The classification of EPPO-groups is given including the cases of solvable, non-solvable and simple EPPO-groups. This paper is…

Group Theory · Mathematics 2020-03-24 Wujie Shi , Wenze Yang

We extend Theorem 1 of R. Reams, A Galois approach to m-th roots of matrices with rational entries, LAA 258 (1997), 187-194. Let $p(\lambda)$ be any polynomial over $\mathbb{Q}$ and let $A\in M_n(\mathbb{Q})$ have irreducible characteristic…

Number Theory · Mathematics 2023-07-13 G. J. Groenewald , G. Goosen , D. B. Janse van Rensburg , A. C. M. Ran , M. van Straaten

We introduce two new types of Dehn functions of group presentations which seem more suitable (than the standard Dehn function) for infinite group presentations and prove the fundamental equivalence between the solvability of the word…

Group Theory · Mathematics 2009-02-10 R. I. Grigorchuk , S. V. Ivanov

We show that there is an order-preserving embedding of the additive group of rational numbers $\mathbb{Q}$ into a 2-generator group $G$. The group $G$ can be chosen to be a solvable group $G$ of length 3, which is a minimal result in the…

Group Theory · Mathematics 2012-01-27 Arman Darbinyan , Vahagn H. Mikaelian

We study solvability, nilpotency and splitting property for algebraic supergroups over an arbitrary field $K$ of characteristic $\mathrm{char}\, K \ne 2$. Our first main theorem tells us that an algebraic supergroup $\mathbb{G}$ is solvable…

Algebraic Geometry · Mathematics 2016-01-28 Akira Masuoka , Alexandr N. Zubkov

If $X$ is an orientable, strongly minimal $PD_4$-complex and $\pi_1(X)$ has one end then it has no nontrivial locally-finite normal subgroup. Hence if $\pi$ is a 2-knot group then (a) if $\pi$ is virtually solvable then either $\pi$ has two…

Geometric Topology · Mathematics 2021-02-24 J. A. Hillman

The set of linear, differential operators preserving the vector space of couples of polynomials of degrees n and n-2 in one real variable leads to an abstract associative graded algebra A(2). The irreducible, finite dimensional…

solv-int · Physics 2009-10-30 Y. Brihaye , S. Giller , P. Kosinski , J. Nuyts

We consider a finite group $G$ with a normal subgroup $N$ so that all elements of $G \setminus N$ have prime power order. We prove that if there is a prime $p$ so that all the elements in $G \setminus N$ have $p$-power order, then either…

Group Theory · Mathematics 2022-03-08 Mark L. Lewis

A subset $X$ of a finite group $G$ is said to be prime-power-independent if each element in $X$ has prime power order and there is no proper subset $Y$ of $X$ with $\langle Y, \Phi(G)\rangle = \langle X, \Phi(G)\rangle$, where $\Phi(G)$ is…

Group Theory · Mathematics 2021-01-18 Andrea Lucchini , Pablo Spiga

Let $G$ be a finite group and $p$ be a prime. We study the kernel of the map, between the Burnside ring of $G$ and the Grothendieck ring of $\mathbb{F}_p[G]$-modules, taking a $G$-set to its associated permutation module. We are able, for…

Representation Theory · Mathematics 2018-04-24 Matthew Spencer

We develop some new topological tools to study maximal subgroups of free idempotent generated semigroups. As an application, we show that the rank 1 component of the free idempotent generated semigroup of the biordered set of a full matrix…

Group Theory · Mathematics 2013-03-26 Mark Brittenham , Stuart W. Margolis , John Meakin

We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup…

Group Theory · Mathematics 2015-08-12 Alexei Myasnikov , Andrey Nikolaev , Alexander Ushakov
‹ Prev 1 4 5 6 7 8 10 Next ›