Related papers: On the Gap-sum and Gap-product Sequences of Intege…
In this paper, we find all integer sequences of the form a^n + b^n, where a and b are complex numbers and n is a nonnegative integer. We prove that if p and q are integers, then there is a correspondence between the roots of the quadratic…
Infinite sequences are of tremendous theoretical and practical importance, and in the Information Age sequences of 0s and 1s are of particular interest. Over the past century, the field of symbolic dynamics has developed to study sequences…
We summarize known results on how to generate an infinite family of integer sequences from the root lattices of rank 2 Kac--Moody algebras. We compute and tabulate the first twenty entries of a number of these sequences. This provides an…
In this article we propose a general method of obtaining infinite sums of products with functions that count patterns in numbers.
Summation of a large class of the functional series, which terms contain factorials, is considered. We first investigated finite partial sums for integer arguments. These sums have the same values in real and all p-adic cases. The…
We prove that the class of permutations generated by passing an ordered sequence $12\dots n$ through a stack of depth 2 and an infinite stack in series is in bijection with an unambiguous context-free language, where a permutation of length…
The classical rearrangement inequality provides bounds for the sum of products of two sequences under permutations of terms and show that similarly ordered sequences provide the largest value whereas opposite ordered sequences provide the…
Suppose that A is a set of n real numbers, each at least 1 apart. Define the ``perturbed sum and product sets'' S and P to be the sums a + b + f(a,b) and products (a+g(a,b))(b+h(a,b)), where f, g, and h satisfy certain upper bounds in terms…
Similarly to $\beta$-adic van der Corput sequences, abstract van der Corput sequences can be defined for abstract numeration systems. Under some assumptions, these sequences are low discrepancy sequences. The discrepancy function is…
We define discrete generating series for arbitrary functions \( f \colon \mathbb{Z}^n \rightarrow \mathbb{C} \) and derive functional relations that these series satisfy. For linear difference equations with constant coefficients, we…
Let the sequence S_m of nonnegative integers be generated by the following conditions: Set the first term a_0 = 0, and for all k \geq 0, let a_k+1 be the least integer greater than a_k such that no element of {a_0,...,a_k+1} is the average…
In 1931, Van der Corput showed that if for each positive integer $s$, the sequence $\{x_{n+s}-x_n\}$ is uniformly distributed (mod 1), then the sequence $x_n$ is uniformly distributed (mod 1). The converse of above result is surprisingly…
We obtain a bounded generation theorem over $\mathcal O/\mathfrak a$, where $\mathcal O$ is the ring of integers of a number field and $\mathfrak a$ a general ideal of $\mathcal O$. This addresses a conjecture of Salehi-Golsefidy. Along the…
In this paper we show discrepancy bounds for index-transformed uniformly distributed sequences. From a general result we deduce very tight lower and upper bounds on the discrepancy of index-transformed van der Corput-, Halton-, and…
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…
This paper establishes new restrictions for attainable enhanced principal rank characteristic sequences (epr-sequences). These results are then used to classify two related families of sequences that are attainable by a real symmetric…
In this paper we introduce the notion of the $P$-sequences and apply their properties in studying representability of real numbers. Another application of $P$-sequences we find in generating the Prouhet-Tarry-Escott pairs.
A pattern of a sequence is a sequence of integer indices with each index describing the order of first occurrence of the respective symbol in the original sequence. In a recent paper, tight general bounds on the block entropy of patterns of…
In this paper, a recent method to construct complementary sequence sets and complete complementary codes by Hadamard matrices is deeply studied. By taking the algebraic structure of Hadamard matrices into consideration, our main result…
In this note, we show the existence of integer sequences of lengths at least 3 (except 7) such that for every integer in position $i\equiv 1\pmod{4}$ (respectively position $j\equiv 3\pmod{4}$), counting from left to right, the sum of the…