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.
| Original language | English |
|---|---|
| Pages (from-to) | 85-90 |
| Number of pages | 6 |
| Journal | Discrete Mathematics Letters |
| Volume | 10 |
| DOIs | |
| State | Published - 2022 |
Bibliographical note
Publisher Copyright:© 2022 the authors.
Keywords
- alphabetic points
- inversion sequences
- records
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics