Alphabetic Points and Records in Inversion Sequences

Abstract

An alphabetic point in an inversion sequence is a value j where all the values l to its left satisfy l ≤ j and all the values r to its right satisfy r ≥ j . We study alphabetic points and records in inversion sequences of permutations and obtain formulae for the total numbers of alphabetic points, weak records, and strict records.