SearcharxivSearch

arXiv subjects

Sajed Haque

Publications and source records attributed to Sajed Haque.

3 recordsLinked to original sources

Quadratic sequences with prime power discriminators

The discriminator of an integer sequence $\textbf{s} = (s(i))_{i \geq 0}$, introduced by Arnold, Benkoski, and McCabe in 1985, is the function $D_{\textbf{s}} (n)$ that sends $n$ to the least integer $m$ such that the numbers $s(0), s(1), \ldots, s(n - 1)$ are pairwise incongruent modulo $m$. In this note, we try to determine all quadratic sequences whose discriminator is given by $p^{\lceil \log_p n \rceil}$ for prime $p$, i.e., the smallest power of $p$ which is $\geq n$. We determine all such sequences for $p = 2$, show that there are none for $p \geq 5$, and provide some partial results for $p = 3$.

math.NT

A Class of Exponential Sequences with Shift-Invariant Discriminators

The discriminator of an integer sequence s = (s(i))_{i>=0}, introduced by Arnold, Benkoski, and McCabe in 1985, is the function D_s(n) that sends n to the least integer m such that the numbers s(0), s(1), ..., s(n-1) are pairwise incongruent modulo m. In this note we present a class of exponential sequences that have the special property that their discriminators are shift-invariant, i.e., that the discriminator of the sequence is the same even if the sequence is shifted by any positive constant.

math.NT

Discriminators and k-Regular Sequences

The discriminator of an integer sequence s = (s(i))_{i >=0}, introduced by Arnold, Benkoski, and McCabe in 1985, is the map D_s(n) that sends n >= 1 to the least positive integer m such that the n numbers s(0), s(1), ..., s(n-1) are pairwise incongruent modulo m. In this note we consider the discriminators of a certain class of sequences, the k-regular sequences. We compute the discriminators of two such sequences, the so-called "evil" and "odious" numbers, and show they are 2-regular. We also give an example of a k-regular sequence whose discriminator is not k-regular. Finally, we examine sequences that are their own discriminators, and count the number of length-$n$ finite sequences with this property.

cs.DM