Rigid trees vs. homogeneous trees | Department of Mathematics

Seminar

Speaker

Guy Kapon

Date

30/05/2016 - 12:00 - 10:00Add to Calendar 2016-05-30 10:00:00 2016-05-30 12:00:00 Rigid trees vs. homogeneous trees A tree is said to be rigid if it has a trivial automorphism group. It is said to be homogeneous if any two nodes of the same level can be sent one to the other via an automorphism of the tree. In this talk, we shall present Larson's proof that the existence of a strongly homogeneous Souslin tree entails the existence of a strongly rigid Souslin tree. Building 502, Room 9 אוניברסיטת בר-אילן - Department of Mathematics mathoffice@math.biu.ac.il Asia/Jerusalem public

Place

Building 502, Room 9

Abstract

A tree is said to be rigid if it has a trivial automorphism group. It is said to be homogeneous if any two nodes of the same level can be sent one to the other via an automorphism of the tree. In this talk, we shall present Larson's proof that the existence of a strongly homogeneous Souslin tree entails the existence of a strongly rigid Souslin tree.