Suppose I am given a presentation of a group with a finite number of generators and a finite number of relations. Is there an algorithm for determining if the group is finite? Also, if there is such algorithm, what is the time complexity of the algorithm:
2026-03-25 10:53:40.1774436020
What is an algorithm for determining if a finitely presented group is finite
304 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in GROUP-THEORY
- What is the intersection of the vertices of a face of a simplicial complex?
- Group with order $pq$ has subgroups of order $p$ and $q$
- How to construct a group whose "size" grows between polynomially and exponentially.
- Conjugacy class formula
- $G$ abelian when $Z(G)$ is a proper subset of $G$?
- A group of order 189 is not simple
- Minimal dimension needed for linearization of group action
- For a $G$ a finite subgroup of $\mathbb{GL}_2(\mathbb{R})$ of rank $3$, show that $f^2 = \textrm{Id}$ for all $f \in G$
- subgroups that contain a normal subgroup is also normal
- Could anyone give an **example** that a problem that can be solved by creating a new group?
Related Questions in COMPUTATIONAL-COMPLEXITY
- Product of sums of all subsets mod $k$?
- Proving big theta notation?
- Little oh notation
- proving sigma = BigTheta (BigΘ)
- sources about SVD complexity
- Is all Linear Programming (LP) problems solvable in Polynomial time?
- growth rate of $f(x)= x^{1/7}$
- Unclear Passage in Cook's Proof of SAT NP-Completeness: Why The Machine M Should Be Modified?
- Minimum Matching on the Minimum Triangulation
- How to find the average case complexity of Stable marriage problem(Gale Shapley)?
Related Questions in GROUP-PRESENTATION
- What is the intersection of the vertices of a face of a simplicial complex?
- Automata defined by group presentations.
- Terminology: reversing the order of the generators.
- Is there a general way to simplify such group presentations (Free Abelian Group with Relations)?
- Proof of a relation of Braid groups
- Prove G is a nonabelian group of order 20
- Is this specific group finite?
- Isomorphy of simple groups of order 360 : a proof with a presentation
- Centralizers of non-central elements of a special group
- Find the group given the presentation
Related Questions in COMBINATORIAL-GROUP-THEORY
- Putnam 2016 Question A5 Finite Group Theory
- Is there a general way to simplify such group presentations (Free Abelian Group with Relations)?
- The context & motivation for the Tits alternative in combinatorial group theory
- Prove G is a nonabelian group of order 20
- Making linear groups trivial by adding an equal number of generators and relations
- An algorithm determining whether two subgroups of a free group are automorphic
- If the deficiency of a presentation $P$ is $0$ and $P$ is aspherical, then the deficiency of the group $P$ defines is $0$.
- Solution book for "Presentations of Groups" by D. L. Johnson
- Notational confusion about HNN-extensions: $G=K \ast_{H,t}$.
- What is this group $G=\langle a,b,c\mid a^2=1, b^2=1, c^2=ab\rangle$
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
No that problem is known to be undecidable in general. Even the problem of deciding whether the group is trivial is undecidable.
It is semi-decidable in the sense that if the group defined by the presentation is finite, then it is possible to prove that it is finite and to determine its order. The Todd-Coxeter coset enumeration procedure, of which there are good implementations, is probably the best way of doing this in practice. But the fact that the general problem is undecidable implies immediately that you cannot bound the complexity of this process by any recursive function.