Restricted single or double signed patterns
| dc.creator | Mansour, T. | |
| dc.date | 2000-11-12 | |
| dc.date.accessioned | 2026-07-07T04:38:33Z | |
| dc.date.available | 2026-07-07T04:38:33Z | |
| dc.description | Let $E_n^r=\{[τ]_a=(τ_1^{(a_1)},...,τ_n^{(a_n)})| τ\in S_n,\ 1\leq a_i\leq r\}$ be the set of all signed permutations on the symbols 1,2,...,n with signs 1,2,...,r. We prove, for every 2-letter signed pattern $[τ]_a$, that the number of $[τ]_a$-avoiding signed permutations in $E_n^r$ is given by the formula $\sum\limits_{j=0}^n j!(r-1)^j{n\choose j}^2$. Also we prove that there are only one Wilf class for r=1, four Wilf classes for r=2, and six Wilf classes for $r\geq 3$. | |
| dc.description | 13 pages, 1 table, 1 figure | |
| dc.identifier | https://arxiv.org/abs/math/0011072 | |
| dc.identifier | http://arxiv.org/abs/math/0011072 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/60319 | |
| dc.subject | Combinatorics | |
| dc.title | Restricted single or double signed patterns | |
| dc.type | text |