Partitioning the meandering curves
DOI10.1007/S11786-015-0234-0zbMATH Open1323.05016DBLPjournals/mics/PanayotopoulosV15OpenAlexW2159272159WikidataQ60692052 ScholiaQ60692052MaRDI QIDQ748760FDOQ748760
Authors: Antonios 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
Recommendations
Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18)
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Plane and projective meanders
- Stamp foldings, semi-meanders, and open meanders: fast generation algorithms
- A branched covering of \(CP^ 2\to S^ 4\), hyperbolicity and projectivity topology
- Folding a strip of stamps
- Sorting jordan sequences in linear time using level-linked search trees
- Foldings and meanders
- Title not available (Why is that?)
- A transfer matrix approach to the enumeration of plane meanders
- Title not available (Why is that?)
- A Map-Folding Problem
Cited In (3)
Uses Software
This page was built for publication: Partitioning the meandering curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q748760)