Échantillonnage basé sur les Tuiles de Penrose et applications en infographie

Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.

Échantillonnage basé sur les Tuiles de Penrose et applications en infographie

Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.

Aggregate distance based clustering using Fibonacci Series -FIBCLUS

This paper proposes an innovative instance similarity based evaluation metric that reduces the search map for clustering to be performed. An aggregate global score is calculated for each instance using the novel idea of Fibonacci series. The use of Fibonacci numbers is able to separate the instances effectively and, in hence, the intra-cluster similarity is increased and the inter-cluster similarity is decreased during clustering. The proposed FIBCLUS algorithm is able to handle datasets with numerical, categorical and a mix of both types of attributes. Results obtained with FIBCLUS are compared with the results of existing algorithms such as k-means, x-means expected maximization and hierarchical algorithms that are widely used to cluster numeric, categorical and mix data types. Empirical analysis shows that FIBCLUS is able to produce better clustering solutions in terms of entropy, purity and F-score in comparison to the above described existing algorithms.

The role of spreadsheets in an investigation of Fibonacci numbers

We introduce a function Z(k) which measures the number of distinct ways in which a number can be expressed as the sum of Fibonacci numbers. Using a binary table and other devices, we explore the values that Z(k) can take and reveal a surprising relationship between the values of Z(k) and the Fibonacci numbers from which they were derived. The article shows the way in which standard spreadsheet functionalities makes it possible to reveal quite striking patterns in data.

Fun with Fibonacci

We introduce a function which measures the number of distinct ways in which a number can be expressed as the sum of Fibonacci numbers. Using a binary table and other devices, we explore the values that can take and reveal some interesting patterns. The article shows how standard spreadsheet functionalities make it possible to reveal quite striking patterns in data, and is intended to be used in the classroom.

Isoperimetric Problem and Meta-fibonacci Sequences

Let G = (V,E) be a simple, finite, undirected graph. For S ⊆ V, let $\delta(S,G) = \{ (u,v) \in E : u \in S \mbox { and } v \in V-S \}$ and $\phi(S,G) = \{ v \in V -S: \exists u \in S$ , such that (u,v) ∈ E} be the edge and vertex boundary of S, respectively. Given an integer i, 1 ≤ i ≤ ∣ V ∣, the edge and vertex isoperimetric value at i is defined as b e (i,G) =  min S ⊆ V; |S| = i |δ(S,G)| and b v (i,G) =  min S ⊆ V; |S| = i |φ(S,G)|, respectively. The edge (vertex) isoperimetric problem is to determine the value of b e (i, G) (b v (i, G)) for each i, 1 ≤ i ≤ |V|. If we have the further restriction that the set S should induce a connected subgraph of G, then the corresponding variation of the isoperimetric problem is known as the connected isoperimetric problem. The connected edge (vertex) isoperimetric values are defined in a corresponding way. It turns out that the connected edge isoperimetric and the connected vertex isoperimetric values are equal at each i, 1 ≤ i ≤ |V|, if G is a tree. Therefore we use the notation b c (i, T) to denote the connected edge (vertex) isoperimetric value of T at i. Hofstadter had introduced the interesting concept of meta-fibonacci sequences in his famous book “Gödel, Escher, Bach. An Eternal Golden Braid”. The sequence he introduced is known as the Hofstadter sequences and most of the problems he raised regarding this sequence is still open. Since then mathematicians studied many other closely related meta-fibonacci sequences such as Tanny sequences, Conway sequences, Conolly sequences etc. Let T 2 be an infinite complete binary tree. In this paper we related the connected isoperimetric problem on T 2 with the Tanny sequences which is defined by the recurrence relation a(i) = a(i − 1 − a(i − 1)) + a(i − 2 − a(i − 2)), a(0) = a(1) = a(2) = 1. In particular, we show that b c (i, T 2) = i + 2 − 2a(i), for each i ≥ 1. We also propose efficient polynomial time algorithms to find vertex isoperimetric values at i of bounded pathwidth and bounded treewidth graphs.

Los números de Fibonacci

Los números de Fibonacci han cautivado por muchos años al ser humano por sus aplicaciones en la vida cotidiana y en otras disciplinas. En este documento se presenta el origen de los números de Fibonacci, sus propiedades y su contribución a las matemáticas.

Las flores de Fibonacci

Casi todo el mundo ha oído hablar de Leonardo de Pisa, más conocido como Fibonacci. Sí, claro, el de la famosa sucesión 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765,...; la de los girasoles, las piñas, las espirales, la del número de oro. Incluso hay un vídeo dedicado a él.

Pulse mixing by Fibonacci and Thue-Morse ordered semiconductor layers

The properties of combinatorial frequency generation by two-tone Gaussian pulses incident at oblique angles on quasiperiodic (Fibonacci and Thue-Morse) stacks of binary semiconductor layers are discussed. The analysis has been performed using the self-consistent model taking into account the nonlinear dynamics of mobile charges in the layers. The effects of the stack arrangements and constituent layer parameters on the combinatorial frequency waveforms are presented for the specific structures of both types