A new indexed approach to render the attractors of Kleinian groups

09/23/2017
by   Alessandro Rosa, et al.
0

One widespread procedure to render the attractor of Kleinian groups, published in the renown book "Indra's Pearls" and based upon a combinatorial tree model, wants huge memory resources to compute and store all the words required. We will present here a new faster and lighter version which drops the original words array and pulls out words from integer numbers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/03/2022

ℚ-bonacci words and numbers

We present a quite curious generalization of multi-step Fibonacci number...
research
07/28/2019

Minimal Absent Words in Rooted and Unrooted Trees

We extend the theory of minimal absent words to (rooted and unrooted) tr...
research
01/27/2016

Co-Occurrence Patterns in the Voynich Manuscript

The Voynich Manuscript is a medieval book written in an unknown script. ...
research
05/03/2020

Efficiently Testing Simon's Congruence

Simon's congruence ∼_k is defined as follows: two words are ∼_k-equivale...
research
06/12/2018

A Timed Version of the Plactic Monoid

Timed words are words where letters of the alphabet come with time stamp...
research
03/16/2023

Uniform random generations and rejection method(I) with binomial majorant

We present three simple algorithms to uniformly generate `Fibonacci word...
research
09/06/2020

An Improved Algorithm for Fast K-Word Proximity Search Based on Multi-Component Key Indexes

A search query consists of several words. In a proximity full-text searc...

Please sign up or login with your details

Forgot password? Click here to reset