Abstract
We study, from a constructive computational point of view, the techniques used to solve the conjugacy problem in the "generic" lattice-ordered group Aut(ℝ). We use these techniques in order to show that for all f, g ∈ Aut(ℝ), the equation xfx = g is effectively solvable in Aut(ℝ).
Original language | English |
---|---|
Pages (from-to) | 395-404 |
Number of pages | 10 |
Journal | International Journal of Algebra and Computation |
Volume | 15 |
Issue number | 2 |
DOIs | |
State | Published - Apr 2005 |
Externally published | Yes |
Bibliographical note
Funding Information:The second author is partially supported by the Golda Meir Fund and the Edmund Landau Center for Research in Mathematical Analysis and Related Areas, sponsored by the Minerva Foundation (Germany).
Keywords
- Conjugacy problem
- Lattice-ordered groups
- Parametric equations