The ACO Seminar (2023–2024)

Looking for twin objects in mathematical structures has long and rich tradition, going back to some geometric dissection problems that culminated in the famous Banach-Tarski Paradox. A general problem is to split a given structure into few pairwise isomorphic substructures. A related question is: How large disjoint isomorphic substructures can be found in a given structure? In this talk, we study this question for combinatorial objects such as permutations, ordered matchings, and words over a finite alphabet.