Long relators in groups generated by two parabolic elements

We find a family of groups generated by a pair of parabolic elements in which every relator must admit a long subword of a specific form. In particular, this collection contains groups in which the number of syllables of any relator is arbitrarily large. This suggests that the existing methods for finding non-free groups with rational parabolic generators may be inadequate in this case, as they depend on the presence of relators with few syllables. Our results rely on two variants of the ping-pong lemma that we develop, applicable to groups that are possibly non-free. These variants aim to isolate the group elements responsible for the failure of the classical ping-pong lemma.