In combinatorial mathematics, a Baxter permutation is a permutation \sigma \in S_n which satisfies the following generalized pattern avoidance property:

  • There are no indices i<j<k such that \sigma(j+1)<\sigma(i)<\sigma(k)<\sigma(j) or \sigma(j)<\sigma(k)<\sigma(i)<\sigma(j+1).

Equivalently, using the notation for vincular patterns, a Baxter permutation is one that avoids the two dashed patterns 2-41-3 and 3-14-2.

For example, the permutation \sigma=2413 in S_4 (written in one-line notation) is not a Baxter permutation because, taking i= 1, j=2 and k = 4, this permutation violates the first condition.

These permutations were introduced by Glen E. Baxter in the context of mathematical analysis.[1]

Enumeration

For n = 1, 2, 3, \ldots, the number a_n of Baxter permutations of length n is

1, 2, 6, 22, 92, 422, 2074, 10754, 58202, 326240, 1882960, 11140560, 67329992, 414499438, 2593341586, 16458756586,...

This is sequence in the OEIS. In general, a_n has the following formula:

a_n \, = \,\sum_{k=1}^n \frac{\binom{n+1}{k-1}\binom{n+1}{k}\binom{n+1}{k+1}}{\binom{n+1}{1}\binom{n+1}{2}} .[2]

In fact, this formula is graded by the number of descents in the permutations, i.e., there are \frac{\binom{n+1}{k-1}\binom{n+1}{k}\binom{n+1}{k+1}}{\binom{n+1}{1}\binom{n+1}{2}} Baxter permutations in S_n with k-1 descents. [3]

Other properties

C_n C_{n+1}.

  • The number of doubly alternating Baxter permutations of length 2n and 2n+1 (i.e., those for which both \sigma and its inverse \sigma^{-1} are alternating) is the Catalan number C_n.[4]
  • Baxter permutations are related to Hopf algebras,[5] planar graphs,[6] and tilings.[7][8]

Motivation: commuting functions

Baxter introduced Baxter permutations while studying the fixed points of commuting continuous functions. In particular, if f and g are continuous functions from the interval [0, 1] to itself such that f(g(x)) = g(f(x)) for all x, and f(g(x)) = x for finitely many x in [0, 1], then:

  • the number of these fixed points is odd;
  • if the fixed points are x_1 < x_2< \ldots < x_{2k + 1} then f and g act as mutually-inverse permutations on

\{x_1,x_3, \ldots, x_{2k + 1} \} and \{x_2, x_4,\ldots, x_{2k} \};

  • the permutation induced by f on \{x_1, x_3, \ldots, x_{2k+1}\} uniquely determines the permutation induced by

f on \{ x_2, x_4, \ldots, x_{2k}\};

  • under the natural relabeling x_1\to 1, x_3\to 2, etc., the permutation induced on \{1, 2, \ldots, k + 1\} is a Baxter permutation.

See also

References

  1. ^ Baxter, Glen (1964), "On fixed points of the composite of commuting functions", Proceedings of the American Mathematical Society. 15 (6): 851–855, doi:10.2307/2034894. JSTOR 2034894.
  2. ^ Chung, F. R. K.; Graham, R. L.; Hoggatt, V. E. Jr.; Kleiman, M. (1978), "The number of Baxter permutations", Journal of Combinatorial Theory. 24 (3): 382–394, Series A, doi:10.1016/0097-3165(78)90068-7. MR 491652.
  3. ^ Dulucq, S. & Guibert, O. (1998), "Baxter permutations", Discrete Mathematics. 180 (1–3): 143–156, doi:10.1016/S0012-365X(97)00112-X. MR 1603713.
  4. ^ Guibert, Olivier & Linusson, Svante (2000), "Doubly alternating Baxter permutations are Catalan", Discrete Mathematics. 217 (1–3): 157–166, doi:10.1016/S0012-365X(99)00261-7. MR 1766265.
  5. ^ Giraudo, Samuele (2011), "Algebraic and combinatorial structures on Baxter permutations", "23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)", Vol. AO, Discrete Math. Theor. Comput. Sci. Proc., Assoc. Discrete Math. Theor. Comput. Sci., Nancy, pp. 387–398, arXiv:1011.4288. Bibcode:2010arXiv1011.4288G. MR 2820726.
  6. ^ Bonichon, Nicolas; Bousquet-Mélou, Mireille; Fusy, Éric (October 2009), "Baxter permutations and plane bipolar orientations", Séminaire Lotharingien de Combinatoire. 61A: Art. B61Ah, 29pp, arXiv:0805.4180. Bibcode:2008arXiv0805.4180B. MR 2734180.
  7. ^ Korn, M. (2004), "Geometric and algebraic properties of polyomino tilings", Ph.D. thesis, Massachusetts Institute of Technology.
  8. ^ Ackerman, Eyal; Barequet, Gill; Pinter, Ron Y. (2006), "A bijection between permutations and floorplans, and its applications", Discrete Applied Mathematics. 154 (12): 1674–1684, doi:10.1016/j.dam.2006.03.018. MR 2233287.