Abstract. We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on...
Ilya Kapovich, Alexei G. Myasnikov, Paul Schupp, V...
We announce the development and implementation of a new GAP package PCQL. This facilitates the computation of consistent polycyclic presentations for polycyclic quotients of groups...
Title of dissertation: MODEL THEORY AND COMPLEXITY THEORY Walid Gomaa Doctor of Philosophy, 2007 Dissertation directed by: Professor William Gasarch Department of Computer Science...
We show that if G is a strongly minimal finitely axiomatizable group, the division ring of quasi-endomorphisms of G must be an infinite finitely presented ring.
We count lattice points in certain rational simplices associated with an irreducible finite Weyl group W and observe that these numbers are linked to the exponents of W .