Questions tagged [pattern-avoidance]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
6
votes
1answer
307 views

Is an $O(n^{d-1})$ bound known for the maximum number of edges in an ordered $n$-vertex hypergraph avoiding a fixed $d$-permutation hypergraph?

By a $d$-permutation hypergraph, I mean, for some fixed integer $k$, a $d$-uniform hypergraph on $[dk]$ with $k$ disjoint edges such that every edge has exactly one vertex from each of $\{1,\ldots,k\}$...
9
votes
0answers
316 views

Pattern Avoidance in Poset Permutations

I am not sure if it is appropriate to use MathOverflow to publicize a conjecture, but I think this is an interesting question and I have no real ideas of how to solve it. A permutation on a $n$-...
8
votes
5answers
795 views

Properties of permutations with unknown pattern avoidance descriptions

Background Many properties of permutations can be stated in terms of classical patterns. For example: a permutation is stack-sortable if and only if it avoids 231 (Knuth 1975) a permutation ...
3
votes
1answer
271 views

Stricter permutation patterns

(I asked this ten days ago on math.SE, but I received no reply, so I'm trying again here.) A lot of work has been done on patterns in permutations, where a permutation is said to match a given ...