Functions on groups and computational complexity
Jean-Camille Birget
Abstract
We give some connections between various functions defined on finitely presented groups (isoperimetric, isodiametric, Todd-Coxeter radius, filling length functions, etc.), and we study the relation between those functions and the computational complexity of the word problem (deterministic time, nondeterministic time, symmetric space). We show that the isoperimetric function can always be linearly decreased (unless it is the identity map). We present a new proof of the Double Exponential Inequality, based on context-free languages.
Create a lesson
Related papers
Property R∞ for Artin and Coxeter groups whose outer automorphisms are length-preserving
Ignat Soroko
DL, DQ Spectrum and Eigenvalue-free Interval of Cayley Graphs over Finite Nilpotent Groups
Pallabi Manna, Santanu Mandal
On p-groups with one nonlinear codegree
Jiwei Zheng, Heng Lv
Classes of Subgroups of a finite group with isomorphic quotient groups
Tushar Halder, Sachin Ballal
Cohomology and multiplicative gaps for quasi-isometries of nilpotent groups
Mayukh Mukherjee, Soumyadeb Samanta, Soumyadip Thandar
On the number of conjugacy classes of finite solvable groups of order divisible by p2
Thomas Michael Keller