IntSeq - Integer Sequence & Transformation library for Scheme
-
Updated
Jun 20, 2018 - Scheme
IntSeq - Integer Sequence & Transformation library for Scheme
Two programs that illustrate the creation of OEIS array A089840, which lists signature permutations of non-recursive Catalan automorphisms, that is, bijections of finite plane binary trees, with no unlimited recursion down to indefinite distances from the root.
Here are some dynamic programming problem solutions.
Python script for drawing "Wolframesque" images (like in Wolfram's magnus opus New Kind of Science) of various iterated systems based on Catalan bijections applied repeatedly to a Dyck path (or equivalently, a rooted binary tree) whose size is increased at each iteration.
Dyck paths visualizer built with DOM methods
CIDER: Scheme-routines that take as their input parenthesizations (S-expressions) and output their various Catalan manifestations as Encapsulated Postscript
Diploma Thesis on Graph Drawing Algorithms with Python
Converts number to text (Catalan language)
A trial Clojure project for a blog post about the Catalan numbers.
Add a description, image, and links to the catalan-numbers topic page so that developers can more easily learn about it.
To associate your repository with the catalan-numbers topic, visit your repo's landing page and select "manage topics."