Related papers: Jumping sequences

Define a(k,q) to be the smallest positive multiple of k such that the sum of its digits in base q is equal to k. The asymptotic behavior, lower and upper bound estimates of a(k,q) are investigated. A characterization of the minimality…

In queuing theory, it is usual to have some models with a "reset" of the queue. In terms of lattice paths, it is like having the possibility of jumping from any altitude to zero. These objects have the interesting feature that they do not…

Golomb's sequence is the unique nondecreasing sequence of positive integers in which each $n$ appears exactly $a(n)$ times. It satisfies the global self-referential rule \[ a\bigl(a(n)+a(n-1)+\cdots+a(1)\bigr)=n, \] grows smoothly like a…

In this paper, we study a maximization problem on real sequences. More precisely, for a given sequence, we are interested in computing the supremum of the sequence and an index for which the associated term is maximal. We propose a general…

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, we characterize the average Hamming weight distribution of subsequences of maximum-length sequences ($m$-sequences). In particular, we consider all possible $m$-sequences of dimension $k$ and find the average number of…

For a given positive integer $m$, let $A=\set{0,1,...,m}$ and $q \in (m,m+1)$. A sequence $(c_i)=c_1c_2 ...$ consisting of elements in $A$ is called an expansion of $x$ if $\sum_{i=1}^{\infty} c_i q^{-i}=x$. It is known that almost every…

Let $\mathcal{F}=\{A_1,A_2,\ldots,A_k\}$ be a collection of finite arithmetic progressions, where each $A_d$ is an initial segment of the set $D_d=\{d,2d,3d,\ldots\}$ of consecutive multiples of a positive integer $d$. Let $m(\mathcal{F})$…

We study new identities related to the sums of adjacent terms in the Pell sequence, defined by $P_{n} := 2P_{n-1}+P_{n-2}$ for $ n\geq 2$ and $P_{0}=0, P_{1}=1$, and generalize these identities for many similar sequences. We prove that the…

Let $\gamma: [0,1] \to [0,1]^2$ be a continuous curve such that $\gamma(0)=(0,0)$, $\gamma(1)=(1,1)$, and $\gamma(t) \in (0,1)^2$ for all $t\in (0,1)$. We prove that, for each $n \in \mathbb{N}$, there exists a sequence of points $A_i$,…

The classical Ulam sequence is defined recursively as follows: $a_1=1$, $a_2=2$, and $a_n$, for $n > 2$, is the smallest integer not already in the sequence that can be written uniquely as the sum of two distinct earlier terms. This…

Let $P\subset \R^2$ be a set of $n$ points in general position. A peeling sequence of $P$ is a list of its points, such that if we remove the points from $P$ in that order, we always remove the next point from the convex hull of the…

A jumping process, defined in terms of jump size distribution and waiting time distribution, is presented. The jumping rate depends on the process value. The process, which is Markovian and stationary, relaxes to an equilibrium and is…

We describe the results of the computation of aliquot sequences with small starting values. In particular all sequences with starting values less than a million have been computed until either termination occurred (at 1 or a cycle), or an…

Negative avoiding sequences of span $n$ are periodic sequences of elements from $\mathbb{Z}_k$ for some $k$ with the property that no $n$-tuple occurs more than once in a period and if an $n$-tuple does occur then its negative does not.…

The pure $O$-sequences of the form $(1,a,a,\ldots)$ are classified.

Sequence-based modeling broadly refers to algorithms that act on data that is represented as an ordered set of input elements. In particular, Machine Learning algorithms with sequences as inputs have seen successfull applications to…

An $(n,R)$-covering sequence is a cyclic sequence whose consecutive $n$-tuples form a code of length $n$ and covering radius $R$. Using several construction methods improvements of the upper bounds on the length of such sequences for $n…

A sequence $\bfx=(x_1,\ldots,x_m)$ of elements of $\Z_n$ is called an \textit{$A$-weighted Davenport Z-sequence} if there exists $\bfa:=(a_1,\ldots,a_m)\in (A\cup\{0\})^m\setminus\bfzero_m$ such that $\sum_i a_ix_i=0$. Here…

A theory of quantum jumps is developed by using a new asymmetric equation, which is complementary to the Schr\"odinger equation. The new equation displays Bohr's rules for quantum jumps, and its solutions demonstrate that once a quantum…