BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Nikolay N. Osipov (Krasnoyarsk Mathematical Center)
DTSTART:20211014T110000Z
DTEND:20211014T120000Z
DTSTAMP:20260423T005820Z
UID:mmandim/26
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/mmandim/26/"
 >Simplification of Nested Real Radicals Revisited</a>\nby Nikolay N. Osipo
 v (Krasnoyarsk Mathematical Center) as part of Mathematical models and int
 egration methods\n\n\nAbstract\nThe problem of simplification of nested ra
 dicals over arbitrary number fields was studied by many authors. The case 
 of real radicals over real number fields is somewhat easier to study (at l
 east\, from theoretical point of view). In particular\, an efficient (i.e.
 \, a polynomial-time) algorithm of simplification of at most doubly nested
  real radicals is known. However\, this algorithm does not guarantee compl
 ete simplification for the case of radicals with nesting depth more than t
 wo. In the talk\, we give a detailed presentation of the theory that provi
 des an algorithm which simplifies triply nested reals radicals over the fi
 eld of rationals. Some new examples of triply (or more) nested real radica
 ls that cannot be simplified are also given.\n
LOCATION:https://researchseminars.org/talk/mmandim/26/
END:VEVENT
END:VCALENDAR