Effective Rank-Rigidity in CAT(0) Cube Complexes
Centre de recherches mathématiques - CRM via YouTube
MIT Sloan AI Adoption: Build a Playbook That Drives Real Business ROI
Learn AI, Data Science & Business — Earn Certificates That Get You Hired
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore a lecture on effective rank-rigidity in CAT(0) cube complexes presented by Abdul Zalloum at the Workshop on Cube Complexes and Combinatorial Geometry. Delve into recent research that builds upon Caprace and Sageev's rank-rigidity theorem, examining how CAT(0) cube complexes with factor systems determine an integer m(X) that influences the structure of groups acting freely and cocompactly on the complex. Investigate the uniform application of flipping and skewering tools, and understand how these techniques can be accomplished quickly based on the geometry of the underlying cube complex. Gain insights into the conditions under which groups are either quasi-isometric to a product or contain rank-one elements of bounded length.
Syllabus
Abdul Zalloum : Effective rank-rigidity.
Taught by
Centre de recherches mathématiques - CRM