English
Related papers

Related papers: On Fibonacci partitions

200 papers

In this paper, we give explicit error bounds for the asymptotic expansion of the shifted distinct partition function $q(n +s)$ for any nonnegative integer $s$. Then based on this refined asymptotic formula, we give the exact thresholds of…

Combinatorics · Mathematics 2025-12-25 Gargi Mukherjee , Helen W. J. Zhang , Ying Zhong

The Fibonacci numbers satisfy the famous recurrence $F_n = F_{n - 1} + F_{n - 2}$. The theory of C-finite sequences ensures that the Fibonacci numbers whose indices are divisible by $m$, namely $F_{mn}$, satisfy a similar recurrence for…

Combinatorics · Mathematics 2022-07-01 Robert Dougherty-Bliss

We show that, for any fixed genus $g$, the ordinary generating function for the genus $g$ partitions of an $n$-element set into $k$ blocks is algebraic. The proof involves showing that each such partition may be reduced in a unique way to a…

Combinatorics · Mathematics 2017-10-30 Robert Cori , Gábor Hetyei

In this paper, we discuss P(n), the number of ways in which a given integer n may be written as a sum of primes. In particular, an asymptotic form P_as(n) valid for n towards infinity is obtained analytically using standard techniques of…

Mathematical Physics · Physics 2017-05-10 Johann Bartel , R. K. Bhaduri , Matthias Brack , M. V. N. Murthy

Set partitions are arrangements of distinct objects into groups. The problem of listing all set partitions arises in a variety of settings, in particular in combinatorial optimization tasks. After a brief review, we give practical…

Data Structures and Algorithms · Computer Science 2026-02-03 Arnav Khinvasara , Alexander Pikovski

In this paper, we investigate $\pi(m,n)$, the number of partitions of the \emph{bipartite number} $(m,n)$ into \emph{steadily decreasing} parts, introduced by L.Carlitz ['A problem in partitions', Duke Math Journal 30 (1963), 203--213]. We…

Number Theory · Mathematics 2020-02-11 Nian Hong Zhou

The study of pattern avoidance in permutations, and specifically in flattened partitions is an active area of current research. In this paper, we count the number of distinct flattened partitions over [n] avoiding a single pattern, as well…

Combinatorics · Mathematics 2020-11-17 Olivia Nabawanda , Fanja Rakotondrajao

For $n \in \mathbb{N}$ let $\Pi[n]$ denote the set of partitions of $n$, i.e., the set of positive integer tuples $(x_1,x_2,\ldots,x_k)$ such that $x_1 \geq x_2 \geq \cdots \geq x_k$ and $x_1 + x_2 + \cdots + x_k = n$. Fixing…

Number Theory · Mathematics 2023-10-17 Taylor Daniels

We explore partitions that lie in the intersection of several sets of classical interest: partitions with parts indivisible by $m$, appearing fewer than $m$ times, or differing by less than $m$. We find results on their behavior and…

Combinatorics · Mathematics 2019-11-13 William J. Keith

We study compositions whose parts are colored by subsequences of the Fibonacci numbers. We give explicit bijections between Fibonacci colored compositions and several combinatorial objects, including certain restricted ternary and…

Combinatorics · Mathematics 2022-03-15 Juan B. Gil , Jessica A. Tomasko

We study the partition function from random matrix theory using a well known connection to orthogonal polynomials, and a recently developed Riemann-Hilbert approach to the computation of detailed asymptotics for these orthogonal…

Mathematical Physics · Physics 2007-05-23 N. M. Ercolani , K. D. T-R McLaughlin

In this paper we determine some properties of Fibonacci octonions. Also, we introduce the generalized Fibonacci-Lucas octonions and we investigate some properties of these elements.

Rings and Algebras · Mathematics 2015-06-15 Diana Savin

We find exact and asymptotic formulas for the average values of several statistics on set partitions: of Carlitz's $q$-Stirling distributions, of the numbers of crossings in linear and circular representations of set partitions, of the…

Combinatorics · Mathematics 2013-04-18 Anisse Kasraoui

We show that the set of the numbers that are the sum of a prime and a Fibonacci number has positive lower asymptotic density.

Number Theory · Mathematics 2011-05-09 K. S. Enoch Lee

A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…

Combinatorics · Mathematics 2021-11-25 Robert P. Boyer , Daniel Parry

In this paper, we consider nine OEIS sequences, the analysis of which allows us to find a connection between Motzkin numbers and Fibonacci numbers. In each Motzkin number, we distinguish an even component and an odd component, the…

Combinatorics · Mathematics 2021-08-25 Gennady Eremin

We compute the Frobenius number for numerical semigroups generated by the squares of three consecutive Fibonacci numbers. We achieve this by using and comparing three distinct algorithmic approaches: those developed by Ram\'irez Alfons\'in…

Number Theory · Mathematics 2025-07-03 Aureliano M. Robles-Pérez , José Carlos Rosales

We outline a method of calculation of partition functions of orientable manifolds with fluctuating metric and perform the calculation for the specific case of the unit interval.

High Energy Physics - Theory · Physics 2007-05-23 Ramon Mendoza , Fernando Moraes

We fully determine a uniformly valid asymptotic behaviour for large $a \omega$ and fixed $m$ of the angular solutions and eigenvalues of the spin-weighted spheroidal differential equation. We fully complement the analytic work with a…

General Relativity and Quantum Cosmology · Physics 2010-12-23 Marc Casals , Adrian C. Ottewill

Consider a non-standard numeration system like the one built over the Fibonacci sequence where nonnegative integers are represented by words over $\{0,1\}$ without two consecutive 1. Given a set $X$ of integers such that the language of…

Formal Languages and Automata Theory · Computer Science 2009-07-06 J. Bell , E. Charlier , A. S. Fraenkel , M. Rigo