is there any simple way to describe walks, starting from the origin, in the positive quadrant between lattice points, each in a direction n, s, e or w, in terms of pattern avoidance in permutations? does there exist a pattern with the property that the number of $n$-permutations avoiding it equals the number of $n$-permutations having cycles of length at most $k$? to answer these questions and to provide other interesting facts, we introduce the concept of partially ordered patterns (pops), which generalize the generalized patterns introduced by babson and steingrimsson in 2000. we also discuss some of the results on pops in the literature and suggest few problems to solve.