Recursive Rosettes

Year: 2014 Authors: Paul Gailiunas

Core claim

The recursion R(n)=R(n-1)R(n-2)R(n-2) produces palindromic geometric paths that can close into many distinct rosettes, depending on turn angles and parameter choices.

Topics

recursive geometry, rosette patterns, palindromic strings, search methods

Domains

recurrence relations, discrete geometry, combinatorics, symmetry, generative art, turtle graphics, pattern design, visual complexity

Methods

recursion analysis, induction proof, parameter search, LOGO implementation

Media

LOGO, spreadsheet, turtle geometry, geometric diagrams

Source status

This page publishes metadata and extracted analytical signals only. Raw PDF and full OCR text are kept local for now.