AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
How to Enumerate All Possible Trajectories
The two spaces are homotopically inequivalent, right? So bheonly cock an that is equivalent to continuously to form one into another. And ah, there's a way to enumerate all of these essentially different trajectories. What you need are two different integers,. One integer describes the number of times you go in a clockwise or counter clock wise direction around the short loop; and another describing the number of ways to go counter clockwise or clockwise, depending on whether it's positive or negative, around the long loop. You can prove that a this pair ofintegers enumerates all possible trajectories, right? Right?