English
Related papers

Related papers: Algorithms for linear groups of finite rank

200 papers

Let $G$ be a group that is relatively hyperbolic with respect to a collection of subgroups $\{H_{\lambda}\}_{\lambda\in \Lambda}$. Suppose that $G$ is given by a finite relative presentation $\mathcal{P}$ with respect to this collection. We…

Group Theory · Mathematics 2025-01-09 Oleg Bogopolski

Let G be a compact group acting in a real vector space V. We obtain a number of inequalities relating the L^infinity norm of a matrix element of the representation of G with its L^p norm for p<infinity. We apply our results to obtain…

Optimization and Control · Mathematics 2007-05-23 Alexander Barvinok

We introduce a new constructive recognition algorithm for finite special linear groups in their natural representation. Given a group $G$ generated by a set of $d\times d$ matrices over a finite field $\mathbb{F}_q$, known to be isomorphic…

Group Theory · Mathematics 2024-04-30 Max Horn , Alice Niemeyer , Cheryl Praeger , Daniel Rademacher

The existing randomized algorithms need an initial estimation of the tubal rank to compute a tensor singular value decomposition. This paper proposes a new randomized fixedprecision algorithm which for a given third-order tensor and a…

Numerical Analysis · Mathematics 2024-04-09 Salman Ahmadi-Asl

We show that the number of conjugacy classes of intersections $A\cap B^g$, for fixed finitely generated subgroups $A, B<F$ of a free group, is bounded above in terms of the ranks of $A$ and $B$; this confirms an intuition of Walter Neumann.…

Group Theory · Mathematics 2021-09-13 Marco Linton

This is a report on our long term project to find an algorithm to decide if a finitely presented group has a non-trivial action on a tree.

Geometric Topology · Mathematics 2022-03-07 A. N. Bartholomew , M. J. Dunwoody

William W. Boone and Graham Higman proved that a finitely generated group has soluble word problem if and only if it can be embedded in a simple group that can be embedded in a finitely presented group. We prove the exact analogue for…

Group Theory · Mathematics 2007-10-10 A. M. W. Glass

We discuss in the context of finite extensions two classical theorems of Takahasi and Howson on subgroups of free groups. We provide bounds for the rank of the intersection of subgroups within classes of groups such as virtually free…

Group Theory · Mathematics 2014-12-11 Vitor Araujo , Pedro V. Silva , Mihalis Sykiotis

The Pr\"ufer rank $\mathrm{rk}(G)$ of a profinite group $G$ is the supremum, across all open subgroups $H$ of $G$, of the minimal number of generators $\mathrm{d}(H)$. It is known that, for any given prime $p$, a profinite group $G$ admits…

Group Theory · Mathematics 2024-05-01 Martina Conte , Benjamin Klopsch

In this paper, we study lower bounds on the K-theory of the maximal $C^*$-algebra of a discrete group based on the amount of torsion it contains. We call this the finite part of the operator K-theory and give a lower bound that is valid for…

Operator Algebras · Mathematics 2013-08-23 Shmuel Weinberger , Guoliang Yu

Self-similar groups provide a rich source of groups with interesting properties; e.g., infinite torsion groups (Burnside groups) and groups with an intermediate word growth. Various self-similar groups can be described by a recursive…

Group Theory · Mathematics 2012-04-20 René Hartung

The Resolution Theorem for Compact Abelian Groups is applied to show that the profinite subgroups of a finite-dimensional compact connected abelian group (protorus) which induce tori quotients comprise a lattice under intersection (meet)…

Group Theory · Mathematics 2025-03-28 Wayne Lewis

In this article we prove that the set of torsion-free groups acting by isometries on a hyperbolic metric space whose entropy is bounded above and with a compact quotient is finite. The number of such groups can be estimated in terms of the…

Group Theory · Mathematics 2021-11-09 Gérard Besson , Gilles Courtois , Sylvestre Gallot , Andrea Sambusetti

We investigate the complexity of computing the Zariski closure of a finitely generated group of matrices. The Zariski closure was previously shown to be computable by Derksen, Jeandel, and Koiran, but the termination argument for their…

Computational Complexity · Computer Science 2025-03-05 Klara Nosan , Amaury Pouly , Sylvain Schmitz , Mahsa Shirmohammadi , James Worrell

Suppose $R$ is a profinite ring. We construct a large class of profinite groups $\widehat{{\scriptstyle\bf L}'{\scriptstyle\bf H}_R}\mathfrak{F}$, including all soluble profinite groups and profinite groups of finite cohomological dimension…

Group Theory · Mathematics 2014-12-08 Ged Corob Cook

Motivated by the need for efficient isomorphism tests for finite groups, we present a polynomial-time method for deciding isomorphism within a class of groups that is well-suited to studying local properties of general finite groups. We…

Group Theory · Mathematics 2020-11-23 Peter A. Brooksbank , Joshua Maglione , James B. Wilson

The results of Strassen and Raz show that good enough tensor rank lower bounds have implications for algebraic circuit/formula lower bounds. We explore tensor rank lower and upper bounds, focusing on explicit tensors. For odd d, we…

Computational Complexity · Computer Science 2012-03-05 Boris Alexeev , Michael Forbes , Jacob Tsimerman

We prove that the rank problem is decidable in the class of torsion-free word-hyperbolic Kleinian groups. We also show that every group in this class has only finitely many Nielsen equivalence classes of generating sets of a given…

Geometric Topology · Mathematics 2014-11-11 Ilya Kapovich , Richard Weidmann

Let $\mathcal{T}$ denote the class of finitely generated torsion-free nilpotent groups. For a group $G$ let $F(G)$ be the set of isomorphism classes of finite quotients of $G$. Pickel proved that if $G \in \mathcal{T}$, then the set…

Group Theory · Mathematics 2023-07-12 Alexander Cant , Bettina Eick

We investigate the saturation rank of a finite group scheme, defined over an algebraically closed field $\Bk$ of positive characteristic $p$. We begin by exploring the saturation rank for finite groups and infinitesimal group schemes.…

Representation Theory · Mathematics 2017-01-12 Yang Pan