| | |
| | |
Stat |
Members: 3643 Articles: 2'488'730 Articles rated: 2609
29 March 2024 |
|
| | | |
|
Article overview
| |
|
Equivalence classes of permutations avoiding a pattern | Henning Ulfarsson
; | Date: |
29 May 2010 | Abstract: | Given a permutation pattern p and an equivalence relation on permutations, we
study the corresponding equivalence classes all of whose members avoid p. Four
relations are studied: Conjugacy, order isomorphism, Knuth-equivalence and
toric equivalence. Each of these produces a known class of permutations or a
known counting sequence. For example, involutions correspond to conjugacy, and
permutations whose insertion tableau is hook-shaped with 2 in the first row
correspond to Knuth-equivalence. These permutations are equinumerous with
certain congruence classes of graph endomorphisms. In the case of toric
equivalence we find a class of permutations that are counted by the Euler
totient function, with a subclass counted by the number-of-divisors function.
We also provide a new symmetry for bivincular patterns that produces some new
non-trivial Wilf-equivalences | Source: | arXiv, 1005.5419 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |