English
Related papers

Related papers: Fibonacci numbers and the probability of polygon f…

200 papers

We study two kinds of random Fibonacci sequences defined by $F_1=F_2=1$ and for $n\ge 1$, $F_{n+2} = F_{n+1} \pm F_{n}$ (linear case) or $F_{n+2} = |F_{n+1} \pm F_{n}|$ (non-linear case), where each sign is independent and either + with…

Probability · Mathematics 2008-09-29 Elise Janvresse , Benoît Rittaud , Thierry De La Rue

We consider two families of Pascal-like triangles that have all ones on the left side and ones separated by $m-1$ zeros on the right side. The $m=1$ cases are Pascal's triangle and the two families also coincide when $m=2$. Members of the…

Combinatorics · Mathematics 2022-12-21 Michael A. Allen , Kenneth Edwards

The $p$-widths are a nonlinear analogue of the spectrum of the Laplacian. We prove that each $p$-width of a polygon in $\mathbb{R}^2$ is achieved by a union of billiard trajectories. We also compute the $p$-widths of the equilateral…

Differential Geometry · Mathematics 2025-05-07 Otis Chodosh , Sithipont Cholsaipant

A natural generalization of base B expansions is Zeckendorf's Theorem: every integer can be uniquely written as a sum of non-consecutive Fibonacci numbers $\{F_n\}$, with $F_{n+1} = F_n + F_{n-1}$ and $F_1=1, F_2=2$. If instead we allow the…

Number Theory · Mathematics 2014-05-13 Philippe Demontigny , Thao Do , Archit Kulkarni , Steven J. Miller , Umang Varma

In this article, we present a trick around Fibonacci numbers which can be found in several magic books. It consists in computing quickly the sum of the successive terms of a Fibonacci-like sequence. We give explanations and extensions of…

History and Overview · Mathematics 2015-01-27 Aimé Lachal

I present a variant of the Buffon Needle method for determination of the value of the mathematical constant, pi. The original method is based on the random casting of a needle of length l onto a planked floor of plank width L. The described…

History and Overview · Mathematics 2024-12-31 Devlin Gualtieri

We use the idea of the broken stick problem (which goes back to Poincare) and calculate the corresponding probabilities for the cases in which the three broken part are: the medians in a triangle, the altitudes, radii of excircles, angle…

History and Overview · Mathematics 2013-04-23 Eugen J. Ionascu , Gabriel Prajitura

We study the generalized random Fibonacci sequences defined by their first nonnegative terms and for $n\ge 1$, $F_{n+2} = \lambda F_{n+1} \pm F_{n}$ (linear case) and $\widetilde F_{n+2} = |\lambda \widetilde F_{n+1} \pm \widetilde F_{n}|$…

Probability · Mathematics 2010-03-05 Elise Janvresse , Benoît Rittaud , Thierry De La Rue

Polygonal slap maps are piecewise affine expanding maps of the interval obtained by projecting the sides of a polygon along their normals onto the perimeter of the polygon. These maps arise in the study of polygonal billiards with…

Dynamical Systems · Mathematics 2015-06-18 Gianluigi Del Magno , João Lopes Dias , Pedro Duarte , José Pedro Gaivão

The random Fibonacci chain is a generalisation of the classical Fibonacci substitution and is defined as the rule mapping $0\mapsto 1$ and $1 \mapsto 01$ with probability $p$ and $1 \mapsto 10$ with probability $1-p$ for $0<p<1$ and where…

Combinatorics · Mathematics 2010-01-21 Johan Nilsson

The Fibonacci cube $\Gamma_n$ is the subgraph of the hypercube $Q_n$ induced by vertices with no consecutive 1s. We study a one parameter generalization, p-th order Fibonacci cubes $\Gamma^{(p)}_n$, which are subgraphs of $Q_n$ induced by…

Combinatorics · Mathematics 2025-07-23 Michel Mollard

In this paper, we suggest a lower and an upper bound for the Generalized Fibonacci-p-Sequence, for different values of p. The Fibonacci-p-Sequence is a generalization of the Classical Fibonacci Sequence. We first show that the ratio of two…

Cryptography and Security · Computer Science 2016-11-25 Sandipan Dey , Hameed Al-Qaheri , Suneeta Sane , Sugata Sanyal

We prove that the sequence $(1/F_{n+2})_{n\ge 0}$ of reciprocals of the Fibonacci numbers is a moment sequence of a certain discrete probability, and we identify the orthogonal polynomials as little $q$-Jacobi polynomials with…

Number Theory · Mathematics 2010-08-06 Christian Berg

Permutations in the image of the pop-stack operator are said to be pop-stacked. We give a polynomial-time algorithm to count pop-stacked permutations up to a fixed length and we use it to compute the first 1000 terms of the corresponding…

Combinatorics · Mathematics 2019-08-26 Anders Claesson , Bjarki Ágúst Guðmundsson , Jay Pantone

Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…

Number Theory · Mathematics 2023-07-18 Yuji Tsuno

We use Stein's method to obtain bounds on the rate of convergence for a class of statistics in geometric probability obtained as a sum of contributions from Poisson points which are exponentially stabilizing, i.e. locally determined in a…

Probability · Mathematics 2007-05-23 Mathew D. Penrose , J. E. Yukich

The fibonomial triangle has been shown by Chen and Sagan to have a fractal nature mod 2 and 3. Both these primes have the property that the Fibonacci entry point of $p$ is $p+1$. We study the fibonomial triangle mod 5, showing with a…

Number Theory · Mathematics 2016-04-19 Jeremiah Southwick

We consider various properties and manifestations of some sign-alternating univariate polynomials borne of right-triangular integer arrays related to certain generalizations of the Fibonacci sequence. Using a theory of the root geometry of…

Combinatorics · Mathematics 2021-01-01 Robert G. Donnelly , Molly W. Dunkum , Murray L. Huber , Lee Knupp

This paper describes a class of sequences that are in many ways similar to Fibonacci sequences: given n, sum the previous two terms and divide them by the largest possible power of n. The behavior of such sequences depends on n. We analyze…

Number Theory · Mathematics 2014-03-20 Brandon Avila , Tanya Khovanova

We study a new class of polyominoes, called $p$-Fibonacci polyominoes, defined using $p$-Fibonacci words. We enumerate these polyominoes by applying generating functions to capture geometric parameters such as area, semi-perimeter, and the…

Combinatorics · Mathematics 2024-11-28 Juan F. Pulido , José L. Ramírez , Andrés R. Vindas-Meléndez