116 search results - page 3 / 24 » Suballowable sequences of permutations |
CPM
2009
Springer
14 years 25 days ago
2009
Springer
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
SSC
2007
Springer
14 years 10 days ago
2007
Springer
Any span n sequences can be regarded as filtering sequences. From this observation, new randomness criteria for span n sequences are proposed. It is proved that the feedback funct...
JCT
2000
13 years 6 months ago
2000
Generalizing the notion of placing rooks on a Ferrers board leads to a new class of combinatorial models and a new class of rook polynomials. Connections are establishedwith absolu...
ISSAC
2004
Springer
13 years 11 months ago
2004
Springer
We describe an algorithm for finding a canonical image of a set of points under the action of a permutation group. Specifically if we order images by sorting them and ordering t...
SIGECOM
2009
ACM
14 years 23 days ago
2009
ACM
We consider the problem of a search engine trying to assign a sequence of search keywords to a set of competing bidders, each with a daily spending limit. The goal is to maximize ...