Related papers: Integers represented by binary recursive sequences

Let A be a set of integers dense in a finite interval. We establish upper and lower bounds for the longest regularly-spaced and convex subsets of A and of A-A.

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…

We prove some general recursions for the numbers of representations of positive integers as a sum x+y, x in X, y in Y, where X,Y are increasing sequences. In particular, we obtain recursions for the number of the Goldbach, Lemoine-Levy,…

We study pattern densities in binary sequences, finding optimal limit sequences with fixed pattern densities.

This paper presents a reinterpretation of a second-order linear recurrence sequence as a sequence of continuants derived from the convergents to a continued fraction. As a result, we are able to derive the generating function and Binet…

By the theory of elliptic curves, we study the integers representable as the product of the sum of four integers with the sum of their reciprocals and give a sufficient condition for the integers with a positive representation.

In this paper we consider the problem of locating a nonzero entry in a high-dimensional vector from possibly adaptive linear measurements. We consider a recursive bisection method which we dub the compressive binary search and show that it…

In this short note, we show a simple characterization of integers that reach records for a sequence described by adding binary strings to runs of 1's and 0's in a binary representation. In particular, we show that this set does not depend…

The Lucas sequences are integers defined by a homogeneous recurrence relation. They include the well-known Fibonacci numbers, which appear abundantly in nature. The complementary Lucas numbers, defined by the same recurrence relation, are…

Let $ \prod_{i=1}^d (X-\alpha_i Y) \in{\mathbb C}[X,Y]$ be a binary form and let $\epsilon_1,\dots,\epsilon_d$ be nonzero complex numbers. We consider the family of binary forms $ \prod_{i=1}^d (X-\alpha_i \epsilon_i^aY)$, $a\in {\mathbb…

Let $S= \{ p_1, \ldots, p_s\}$ be a finite, non-empty set of distinct prime numbers and $(U_{n})_{n \geq 0}$ be a linear recurrence sequence of integers of order $r$. For any positive integer $k,$ we define $(U_j^{(k)})_{j\geq 1}$ an…

The vertices of the integer hull are the integral equivalent to the well-studied basic feasible solutions of linear programs. In this paper we give new bounds on the number of non-zero components -- their support -- of these vertices…

We analyze different ways of constructing binary extended formulations of mixed-integer problems with bounded integer variables and compare their relative strength with respect to split cuts. We show that among all binary extended…

We consider the language of $\Delta_0$-formulas with list terms interpreted over hereditarily finite list superstructures. We study the complexity of reasoning in extensions of the language of $\Delta_0$-formulas with non-standard list…

The aim of the present article is to explore the possibilities of representing positive integers as sums of other positive integers and highlight certain fundamental connections between their multiplicative and additive properties. In…

We propose a binary representation of categorical values using a linear map. This linear representation preserves the neighborhood structure of categorical values. In the context of evolutionary algorithms, it means that every categorical…

Let $\{U_n\}_{n \geq 0}$ and $\{V_m\}_{m \geq 0}$ be two linear recurrence sequences. We establish an asymptotic formula for the number of integers $c$ in the range $[-x, x]$ which can be represented as differences $ U_n - V_m$. In…

For Lucas sequences of the first kind (u_n) and second kind (v_n) defined as usual for positive n by u_n=(a^n-b^n)/(a-b), v_n=a^n+b^n, where a and b are either integers or conjugate quadratic integers, we describe the set of indices n for…

We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…

In this paper, we consider arithmetic progressions contained in Lucas sequences of first and second kind. We prove that for almost all sequences, there are only finitely many and their number can be effectively bounded. We also show that…