Indiscernible Set

A subset or sequence of a structure whose finite tuples have the same type over a fixed parameter set whenever the tuples have the same order-type inside the subset; equivalently, no formula with parameters from the base distinguishes between tuples that are order‑equivalent. Indiscernibles serve as highly symmetric configurations used in combinatorial and classification arguments.