29 search results - page 2 / 6 » Counting 1324-Avoiding Permutations |
DM
2007
13 years 4 months ago
2007
Several authors have examined connections between restricted permutations and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for color...
FFA
2006
13 years 4 months ago
2006
This note is a continuation of a paper by the same authors that appeared in 2002 in the same journal. First we extend the method of the previous paper proving an asymptotic formul...
DCG
2011
12 years 11 months ago
2011
COMBINATORICS
2000
13 years 4 months ago
2000
A (multi)hypergraph H with vertices in N contains a permutation p = a1a2 . . . ak of 1, 2, . . . , k if one can reduce H by omitting vertices from the edges so that the resulting ...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We show that any quantum algorithm to decide whether a function f : [n] → [n] is a permutation or far from a permutation must make Ω n1/3 /w queries to f, even if the algorith...