Partitioning the meandering curves

DOI10.1007/s11786-015-0234-0zbMath1323.05016OpenAlexW2159272159WikidataQ60692052 ScholiaQ60692052MaRDI QIDQ748760

A. Panayotopoulos, Panayiotis Vlamos

Publication date: 30 October 2015

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-015-0234-0

zbMATH Keywords

partitionpermutationmeanderstamp foldingmeandering curve

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Permutations, words, matrices (05A05)

Related Items (1)

On meandric colliers

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stamp foldings, semi-meanders, and open meanders: fast generation algorithms
• Plane and projective meanders
• A branched covering of \(CP^ 2\to S^ 4\), hyperbolicity and projectivity topology
• Foldings and Meanders
• A transfer matrix approach to the enumeration of plane meanders
• Sorting jordan sequences in linear time using level-linked search trees
• Folding a strip of stamps
• A Map-Folding Problem

This page was built for publication: Partitioning the meandering curves