This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
A k-triangulation of a convex polygon is a maximal set of diagonals so that no k + 1 of them mutually cross in their interiors. We present a bijection between 2-triangulations of a...
A permutation is said to avoid the permutation if no subsequence in has the same order relations as . Two sets of permutations 1 and 2 are Wilfequivalent if, for all n, the numb...