On mathematical contributions of Paul E. Schupp (Q716386)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	On mathematical contributions of Paul E. Schupp	scientific article

Statements

scholarly article

0 references

On mathematical contributions of Paul E. Schupp (English)

0 references

zbMATH Open document ID

0 references

0 references

Illinois Journal of Mathematics

0 references

publication date

28 April 2011

0 references

full work available at URL

https://projecteuclid.org/euclid.ijm/1299679735

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

The Conjugacy Problem for the Group of Any Tame Alternating Knot is Solvable

0 references

Artin groups and infinite Coxeter groups

0 references

The accessibility of finitely presented groups

0 references

Dehn's algorithm for the word problem

0 references

On Dehn's algorithms for the conjugacy and word problems, with applications

0 references

An analogue of a theorem of Magnus

0 references

0 references

Random walk in random groups.

0 references

The halting problem is decidable on a set of asymptotic probability one

0 references

On the hyperbolicity of small cancellation groups and one-relator groups

0 references

The subadditive ergodic theorem and generic stretching factors for free group automorphisms.

0 references

Generic-case complexity, decision problems in group theory, and random walks.

0 references

Average-case complexity and decision problems in group theory.

0 references

Densities in free groups and \(\mathbb{Z}^k\), visible points and test elements.

0 references

Genericity, the Arzhantseva-Ol'shanskii method and the isomorphism problem for one-relator groups.

0 references

Delzant's \(T\)-invariant, Kolmogorov complexity and one-relator groups.

0 references

On group-theoretic models of randomness and genericity.

0 references

Random quotients of the modular group are rigid and essentially incompressible

0 references

Generic properties of Whitehead's algorithm and isomorphism rigidity of random one-relator groups.

0 references

Context-free languages, groups, the theory of ends, second-order logic, tiling problems, cellular automata, and vector addition systems

0 references

Groups, the theory of ends, and context-free languages

0 references

The theory of ends, pushdown automata, and second-order logic

0 references

Alternating automata on infinite trees

0 references

Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra

0 references

0 references

Alternating automata, the weak monadic theory of trees and its complexity

0 references

Generic complexity of undecidable problems

0 references

ALMOST EVERY GROUP IS HYPERBOLIC

0 references

Peripheral fillings of relatively hyperbolic groups.

0 references

Decidability of Second-Order Theories and Automata on Infinite Trees

0 references

Generic complexity of Presburger arithmetic

0 references

On Dehn's algorithm and the conjugacy problem

0 references

On the conjugacy problem for certain quotient groups of free products

0 references

On Greendlinger's lemma

0 references

Small cancellation theory over free products with amalgamation

0 references

0 references

On the structure of Hamiltonian cycles in Cayley graphs of finite quotients of the modular group

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:716386

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q716386&oldid=35224543"