Related papers: Fibonacci Plays Billiards
The paper contains enumerative combinatorics for positive braids, square free braids, and simple braids, emphasizing connections with classical Fibonacci sequence. The simple subgraph of the Cayley graph of the braid group is analyzed in…
We study two families of lattices whose number of elements are given by the numbers in even (respectively odd) positions in the Fibonacci sequence. The even Fibonacci lattice arises as the lattice of simple elements of a Garside monoid…
A linear chord diagram of size $n$ is a partition of the set $\{1,2,\cdots,2n\}$ into sets of size two, called chords. From a table showing the number of linear chord diagrams of degree $n$ such that every chord has length at least $k$, we…
Number the cells of a (possibly infinite) chessboard in some way with the numbers 0, 1, 2, ... Consider the cells in order, placing a queen in a cell if and only if it would not attack any earlier queen. The problem is to determine the…
We show that two-dimensional billiard systems are Turing complete, in the sense that the halting of any Turing machine with a given input is equivalent to a certain bounded trajectory in this system entering a specified open set. Billiards…
We look at a family of meta-Fibonacci sequences which arise in studying the number of leaves at the largest level in certain infinite sequences of binary trees, restricted compositions of an integer, and binary compact codes. For this…
An interesting open problem in number theory asks whether it is possible to walk to infinity on primes, where each term in the sequence has one more digit than the previous. In this paper, we study its variation where we walk on the…
We consider the billiard map in the hypercube of $\mathbb{R}^d$. We obtain a language by coding the billiard map by the faces of the hypercube. We investigate the complexity function of this language. We prove that $n^{3d-3}$ is the order…
Mathematics has been used in the exploration and enumeration of juggling patterns. In the case when we catch and throw one ball at a time the number of possible juggling patterns is well-known. When we are allowed to catch and throw any…
A billiard in the form of a stadium with periodically perturbed boundary is considered. Two types of such billiards are studied: stadium with strong chaotic properties and a near-rectangle billiard. Phase portraits of such billiards are…
We search for triangular numbers that are multiples of other triangular numbers. It is found that for any positive non-square integer multiplier, there is an infinity of multiples of triangular numbers that are triangular numbers and…
The geometry of a billiard boundary fundamentally governs its dynamics, ranging from integrable to mixed and fully chaotic regimes. Bean- and peanut-shaped billiards have varying curvature with both focusing and defocusing walls without a…
The pattern of a matrix M is a (0,1)-matrix which replaces all non-zero entries of M with a 1. A directed graph is said to support M if its adjacency matrix is the pattern of M. If M is an orthogonal matrix, then a digraph which supports M…
One possible data encryption scheme is related to stream ciphers, which use a sufficiently long pseudo-random sequence. To increase the cryptographic strength of the cipher, linear shift algorithms (generated by linear recurrent sequences…
Can any secrets still be shed by that much studied, uniquely integrable, Elliptic Billiard? Starting by examining the family of 3-periodic trajectories and the loci of their Triangular Centers, one obtains a beautiful and variegated gallery…
A necklace or bracelet is \textit{colorful} if no pair of adjacent beads are the same color. In addition, two necklaces are \textit{equivalent} if one results from the other by permuting its colors, and two bracelets are \textit{equivalent}…
A simple graph is called triangular if every edge of it belongs to a triangle. We conjecture that any graphical degree sequence all terms of which are greater than or equal to 4 has a triangular realisation, and establish this conjecture…
Let $(F_n)_{n\geq 0}$ and $(L_n)_{n\geq 0}$ be the Fibonacci and Lucas sequences, respectively. In this paper we determine all Fibonacci numbers which are mixed concatenations of a Fibonacci and a Lucas numbers. By mixed concatenations of $…
We analyse the classical and quantum behaviour of a particle trapped in a diamond shaped billiard. We defined this billiard as a half stadium connected with a triangular billiard. A parameter $\xi$ which gradually change the shape of the…
In two previous papers we have presented partition formulae for the Fibonacci numbers motivated by the appearance of the Fibonacci numbers in the representation theory of the 3-Kronecker quiver and its universal cover, the 3-regular tree.…