Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Baxter_permutation> ?p ?o. }
Showing items 1 to 13 of
13
with 100 items per page.
- Baxter_permutation abstract "In combinatorial mathematics, a Baxter permutation is a permutation which satisfies the following generalized pattern avoidance property: There are no indices i < j < k such that σ(j + 1) < σ(i) < σ(k) < σ(j) or σ(j) < σ(k) < σ(i) < σ(j + 1).For example, the permutation σ = 2413 in S4 (written in one-line notation) is not a Baxter permutation because, taking i = 1, j = 2 and k = 4, this permutation violates the first condition.These permutations were introduced by Glen E. Baxter in the context of mathematical analysis.".
- Baxter_permutation wikiPageExternalLink A001181.
- Baxter_permutation wikiPageID "37755641".
- Baxter_permutation wikiPageRevisionID "597562924".
- Baxter_permutation hasPhotoCollection Baxter_permutation.
- Baxter_permutation subject Category:Permutation_patterns.
- Baxter_permutation comment "In combinatorial mathematics, a Baxter permutation is a permutation which satisfies the following generalized pattern avoidance property: There are no indices i < j < k such that σ(j + 1) < σ(i) < σ(k) < σ(j) or σ(j) < σ(k) < σ(i) < σ(j + 1).For example, the permutation σ = 2413 in S4 (written in one-line notation) is not a Baxter permutation because, taking i = 1, j = 2 and k = 4, this permutation violates the first condition.These permutations were introduced by Glen E.".
- Baxter_permutation label "Baxter permutation".
- Baxter_permutation sameAs m.0ngtq23.
- Baxter_permutation sameAs Q4873869.
- Baxter_permutation sameAs Q4873869.
- Baxter_permutation wasDerivedFrom Baxter_permutation?oldid=597562924.
- Baxter_permutation isPrimaryTopicOf Baxter_permutation.