The triple rendezvous time of a synchronizing automaton can be floor(4n/3)

For every n >= 9, a strongly connected synchronizing binary n-state automaton is constructed with triple rendezvous time exactly floor(4n/3). A pair potential proves the lower bound and an explicit word proves the upper bound. Further structural theorems give linear bounds for specified involution and aligned-cross-support classes. Finite enumerations are stated separately with their precise model and parameter ranges. The general involution bound and a linear bound for arbitrary permutation-letter automata remain open. The technical supplement contains the complete position classifications and census details. Preprint. Not externally peer reviewed. The main paper must be read with the mandatory technical supplement and the accompanying evidence archives.