Succinct Data Structures for Efficiently Representing and Querying Baxter Permutations and Related Families

This paper introduces a novel succinct representation for Baxter permutations of size n that supports efficient queries on the permutation, including accessing the value at a given index (π(i)) and finding the index of a given value (π−1(j)), in sub-linear time.