Patterns in inversion sequences II: Inversion sequences avoiding triples of relations

Inversion sequences of length n, In, are integer sequences (e , . . ., e ) with 0 ≤ e \u3c i for each i. The study of patterns in inversion sequences was initiated recently by Mansour-Shattuck and Corteel-Martinez-Savage-Weselcouch through a systematic study of inversion sequences avoiding words of length 3. We continue this investigation by reframing the notion of a length-3 pattern from a “word of length 3,” w w w , to a “triple of binary relations,” (ρ , ρ , ρ ), and consider the set In (ρ , ρ , ρ ) consisting of those e ε I with no i \u3c j \u3c k such that e ρ e , e ρ e , and e ρ e . We show that “avoiding a triple of relations” can characterize inversion sequences with a variety of monotonicity or unimodality conditions, or with multiplicity constraints on the elements. We uncover several interesting enumeration results and relate pattern avoiding inversion sequences to familiar combinatorial families. We highlight open questions about the relationship between pattern avoiding inversion sequences and a variety of lasses of pattern avoiding permutations. For several combinatorial sequences, pattern avoiding inversion sequences provide a simpler interpretation than otherwise known. 1 n i 1 2 3 1 2 3 1 2 3 n i 1 j j 2 k i 3