English
Related papers

Related papers: Generalizing Zeckendorf's Theorem to f-decompositi…

200 papers

We show that if $k\ge 2$ is an integer and $(F_n^{(k)})_{n\ge 0}$ is the sequence of $k$-generalized Fibonacci numbers, then there are only finitely many triples of positive integers $1<a<b<c$ such that $ab+1,~ac+1,~bc+1$ are all members of…

Number Theory · Mathematics 2018-10-30 Clemens Fuchs , Christoph Hutle , Florian Luca , Laszlo Szalay

The von Weizs\"{a}cker theorem states that every sequence of nonnegative random variables has a subsequence which is Ces\`{a}ro convergent to a nonnegative random variable which might be infinite. The goal of this note is to provide a…

Probability · Mathematics 2025-11-21 Stefan Tappe

We consist of first presenting Zeckendorf Theorem with these two versions Fibonacci and Luca. In this document we obtain results on the generalized of the Zeckendorf theorem for Fibonacci numbers (multibonacci). Such results find…

Number Theory · Mathematics 2024-03-27 Rachid Chergui

Folkman's Theorem asserts that for each $k \in \mathbb{N}$, there exists a natural number $n = F(k)$ such that whenever the elements of $[n]$ are two-coloured, there exists a set $A \subset [n]$ of size $k$ with the property that all the…

Combinatorics · Mathematics 2017-06-28 József Balogh , Sean Eberhard , Bhargav Narayanan , Andrew Treglown , Adam Zsolt Wagner

An integer composition of a nonnegative integer $n$ is a tuple $(\pi_1,\ldots,\pi_k)$ of nonnegative integers whose sum is $n$; the $\pi_i$'s are called the parts of the composition. For fixed number $k$ of parts, the number of $f$-weighted…

Combinatorics · Mathematics 2015-04-03 Steffen Eger

In a previous paper we considered a positive function f, uniquely determined for s>0 by the requirements f(1)=1, log(1/f) is convex and the functional equation f(s)=psi(f(s+1)) with psi(s)=s-1/s. We prove that the meromorphic extension of f…

Complex Variables · Mathematics 2008-02-08 Christian Berg , Antonio J. Durán

A nondecreasing sequence of positive integers is $(\alpha,\beta)$-Conolly, or Conolly-like for short, if for every positive integer $m$ the number of times that $m$ occurs in the sequence is $\alpha + \beta r_m$, where $r_m$ is $1$ plus the…

Combinatorics · Mathematics 2015-09-10 Alejandro Erickson , Abraham Isgur , Bradley W. Jackson , Frank Ruskey , Stephen M. Tanny

We give negative answers to two questions of Bergelson, Moreira, and Richter concerning recurrence along functions from a Hardy field. For the pair \(f_1(t)=t^{3/2}\) and \(f_2(t)=\lambda t^{3/2}+t\), where \(\lambda\in\mathbb…

Number Theory · Mathematics 2026-05-19 Kangbo Ouyang , Leiye Xu , Shuhao Zhang

Every sequence $f_1, f_2, \cdots \, $ of random variables with $ \, \lim_{M \to \infty} \big( M \sup_{k \in \mathbb{N}} \mathbb{P} ( |f_k| > M ) \big)=0\,$ contains a subsequence $ f_{k_1}, f_{k_2} , \cdots \,$ that satisfies, along with…

Probability · Mathematics 2022-04-25 Ioannis Karatzas , Walter Schachermayer

Obtained a new property of superposition of the generating functions ln(1/(1-F(x))), where F(x) - generating function with integer coefficients, which allows the construction a primality tests. The theorem which is based on compositions of…

Combinatorics · Mathematics 2011-12-06 Dmitry Kruchinin

The celebrated Trakhtenbrot's theorem states that the set of finitely valid sentences of first-order logic is not computably enumerable. In this note we will extend this theorem by proving that the finite satisfiability problem of any…

Logic in Computer Science · Computer Science 2022-04-12 Reijo Jaakkola

We consider the problem of characterizing all functions $f$ defined on the set of integers modulo $n$ with the property that an average of some $n$th roots of unity determined by $f$ is always an algebraic integer. Examples of such…

Number Theory · Mathematics 2016-10-25 Chatchawan Panraksa , Pornrat Ruengrot

A classical theorem of Wonenburger, Djokovic, Hoffmann and Paige states that an element of the general linear group of a finite-dimensional vector space is the product of two involutions if and only if it is similar to its inverse. We give…

Rings and Algebras · Mathematics 2023-03-03 Clément de Seguins Pazzis

In this note, we investigate some properties of the integer sequence of general term $a_n := \sum_{k = 0}^{n - 1} k! (n - k - 1)!$ ($\forall n \geq 1$) to derive a new identity of the Genocchi numbers $G_n$ ($n \in \mathbb{N}$), which…

Number Theory · Mathematics 2022-04-28 Bakir Farhi

Let $D$ be an open disk of radius $\le 1$ in $\mathbb C$, and let $(\epsilon_n)$ be a sequence of $\pm 1$. We prove that for every analytic function $f: D \to \mathbb C$ without zeros in $D$, there exists a unique sequence $(\alpha_n)$ of…

Number Theory · Mathematics 2012-04-05 Marcin Mazur , Bogdan V. Petrenko

For a variety $X$ of positive characteristic and a non-negative integer $e$, we define its $e$-th F-blowup to be the universal flattening of the $e$-iterated Frobenius of $X$. Thus we have the sequence (a set labeled by non-negative…

Algebraic Geometry · Mathematics 2024-02-27 Takehiko Yasuda

In this paper, we study the linear space of all two-sided generalized Fibonacci sequences $\{F_n\}_{n \in \mathbb{Z}}$ that satisfy the recurrence equation of order $k$: $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$. We give two types of…

Number Theory · Mathematics 2023-04-07 Martin Bunder , Joseph Tonien

In this paper, we introduce the concept of $F$-perfect number, which is a positive integer $n$ such that $\sum_{d|n,d<n}d^2=3n$. We prove that all the $F$-perfect numbers are of the form $n=F_{2k-1}F_{2k+1}$, where both $F_{2k-1}$ and…

Number Theory · Mathematics 2014-06-12 Tianxin Cai , Deyi Chen , Yong Zhang

For each odd prime power q, we construct an infinite sequence of rational functions f(X) in F_q(X), each of which is exceptional, which means that for infinitely many n the map c-->f(c) induces a bijection of P^1(F_{q^n}). Moreover, each of…

Number Theory · Mathematics 2022-06-08 Zhiguo Ding , Michael E. Zieve

A theorem of Hoischen states that given a positive continuous function $\varepsilon:\mathbb{R}\to\mathbb{R}$, an integer $n\geq 0$, and a closed discrete set $E\subseteq\mathbb{R}$, any $C^n$ function $f:\mathbb{R}\to\mathbb{R}$ can be…

Classical Analysis and ODEs · Mathematics 2026-01-01 Maxim R. Burke