Related papers: Integers represented by binary recursive sequences
We consider a variant of Dickson lemma, where each entry of a vector can be reseted or incremented by 1 in respect to the previous one. We give an example of non dominating sequence of length $2^{2^{\theta (n)}}$. It perfectly match the…
Algebraic statistics for binary random variables is concerned with highly structured algebraic varieties in the space of 2x2x...x2-tensors. We demonstrate the advantages of representing such varieties in the coordinate system of binary…
Let $f$ be a primitive positive definite integral binary quadratic form of discriminant $-D$ and let $\pi_f(x)$ be the number of primes up to $x$ which are represented by $f$. We prove several types of upper bounds for $\pi_f(x)$ within a…
We study a certain family of infinite series with reciprocal Catalan numbers. We first evaluate two special candidates of the family in closed form, where we also present some Catalan-Fibonacci relations. Then we focus on the general…
We introduce the associated Lah numbers. Some recurrence relations and convolution identities are established. An extension of the associated Stirling and Lah numbers to the r-Stirling and r-Lah numbers are also given. For all these…
Using an approach of Bergh, we give an alternate proof of Bennett's result on lower bounds for non-negative matrices acting on non-increasing non-negative sequences in $l^p$ when $p \geq 1$ and its dual version, the upper bounds when $0<p…
Two infinite sequences A and B of non-negative integers are called additive complements, if their sum contains all sufficiently large integers. Let $A(x)$ and $B(x)$ be the counting functions of A and B. In this paper, we extend the results…
In this article we discuss the presentation of a random binary matrix using sequence of whole nonnegative numbers. We examine some advantages and disadvantages of this presentation as an alternative of the standard presentation using…
This thesis is about the study of Diophantine equations involving binary recurrent sequences with arithmetic functions. Various Diophantine problems are investigated and new results are found out of this study. Firstly, we study several…
Linear codes with complementary-duals (LCD) are linear codes that intersect with their dual trivially. Multinegacirculant codes of index $2$ that are LCD are characterized algebraically and some good codes are found in this family. Exact…
Place value numbers, such as the binary or decimal numbers can be represented by the end vertices (leaf or pendant vertices) of rooted symmetrical trees. Numbers that consist of at most a fixed number of digits are represented by vertices…
The well known binary and decimal representations of the integers, and other similar number systems, admit many generalisations. Here, we investigate whether still every integer could have a finite expansion on a given integer base b, when…
This paper introduces the continuous tensor abstraction, allowing indices to take real-number values (for example, A[3.14]). It also presents continuous tensor algebra expressions, such as C(x,y) = A(x,y) * B(x,y), where indices are defined…
Rooted binary perfect phylogenies provide a generalization of rooted binary unlabeled trees in which each leaf is assigned a positive integer value that corresponds in a biological setting to the count of the number of indistinguishable…
The set of indices that correspond to the positive entries of a sequence of numbers is called its positivity set. In this paper, we study the density of the positivity set of a given linear recurrence sequence, that is the question of how…
We recast homogeneous linear recurrence sequences with fixed coefficients in terms of partial Bell polynomials, and use their properties to obtain various combinatorial identities and multifold convolution formulas. Our approach relies on a…
The main aim of this paper is to study $LCD$ codes. Linear code with complementary dual($LCD$) are those codes which have their intersection with their dual code as $\{0\}$. In this paper we will give rather alternative proof of Massey's…
We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs,…
We propose a new interpretation of the classical index of appearance for second order linear recursive sequences. It stems from the formula \[ C_{n}(t)-2 =\frac{\Delta}{Q^{n}}\ L_n^2,\ \ \ \text{where} \ \ t= (T^2-2Q)/Q, \ \Delta = T^2-4Q,…
We use the concept of the half of a lower-triangular matrix to define a transformation on integer sequences. We explore the properties of this transformation, including in some cases a study of the Hankel transform of the transformed…