zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Planar permutations defined by two intersecting Jordan curves. (English) Zbl 0551.05004
Graph theory and combinatorics, Proc. Conf. Hon. P. Erdős, Cambridge 1983, 259-271 (1984).
[For the entire collection see Zbl 0543.00003.] A planar permutation of size 2M is defined by two oriented Jordan curves intersecting in the plane in 2M points, one point being the root. When the points are labelled from 1 to 2M in the order in which they occur on one of the curves, beginning at the root, the permutation appears on the other curve. For the sake of solving different problems, each planar permutation of size 2M can be represented by two particular sets of 2M nested parentheses, by a particular kind of plane graph with 2M edges, or by a way of folding a ring of 2M stamps.
Reviewer: M.Marx

05A05Permutations, words, matrices
05C10Topological graph theory