Picture of person typing on laptop with programming code visible on the laptop screen

World class computing and information science research at Strathclyde...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including by researchers from the Department of Computer & Information Sciences involved in mathematically structured programming, similarity and metric search, computer security, software systems, combinatronics and digital health.

The Department also includes the iSchool Research Group, which performs leading research into socio-technical phenomena and topics such as information retrieval and information seeking behaviour.

Explore

The word problem for Pride groups

Davidson, Peter (2014) The word problem for Pride groups. Communications in Algebra, 42 (4). pp. 1448-1459.

[img]
Preview
Text (Davidson-CA-2014-word-problem-for-pride-groups)
Davidson_CA_2014_word_problem_for_pride_groups.pdf - Accepted Author Manuscript

Download (238kB) | Preview

Abstract

Pride groups are defined by means of finite (simplicial) graphs and examples include Artin groups, Coxeter groups and generalized tetrahedron groups. Under suitable conditions we calculate an upper bound of the first order Dehn function for a finitely presented Pride group. We thus obtain sufficient conditions for when finitely presented Pride groups have solvable word problems. As a corollary to our main results we show that the first order Dehn function of a generalized tetrahedron groups, containing finite generalized triangle groups, is at most cubic.