• Skip to primary navigation
  • Skip to main content
  • Skip to primary sidebar
UT Shield
Texas Experimental Geometry Lab
  • Home
  • Projects
  • People
  • Resources
  • Contact

Automatic Ping-Pong

Automatic Ping-Pong
General Background
Search Algorithm
Bound on Kernel
Future Work
Gallery

Fall 2021
Undergraduate researchers: Jordan Grant, Jeremy Krill, Samuel Perales
Mentor: Teddy Weisman
Faculty advisor: Jeff Danciger

In this project, we focus on extending the work done last semester by designing an algorithm around a generalized version of the Ping Pong Lemma to work for a larger set of groups. The previous project allowed us to find intervals of RP1RP1 which met certain containment conditions, guaranteeing the faithfulness of particular representations of free groups in SL(2,R)SL(2,R). Here, we attempt to generalize these conditions to work for any group with an automatic structure. This will allow us to find valid intervals under a different set of conditions to work for non-free groups such as cyclic free products and triangle groups.

Primary Sidebar

Upcoming Projects

  • Ψ S 3 : Pseudo self-similar structures
  • Visualizing Markov codings for geodesic flow
  • Surfaces in Triangulated 4-Manifolds

Past Project

  • Ping Pong Patches
  • Billiards in the Projective Plane
  • Stable Commutator Length
  • Automatic Ping-Pong
  • Convex domains in projective geometry
  • Ping pong and beyond

UT Home | Emergency Information | Site Policies | Web Accessibility | Web Privacy | Adobe Reader

© The University of Texas at Austin 2025