Some studies on the \((p,q)\)-type sequences (Q1190483): Difference between revisions

Let \(p\geq 2\), \(q\geq 2\) be two positive integers and let \(\Theta=\exp(2i\pi/q)\) be a primitive \(q\)th root of unity. Let \({\mathcal G}=\{1,\Theta,\dots,\Theta^{q-1}\}\) be the cyclic group generated by \(\Theta\). A sequence \((f_ n)_{n\geq 1}\), \(f_ n\in{\mathcal G}\), is called a \((p,q)\)-type sequence if it satisfies the following equations: \[ f_{p^ k(pm+2)}=\Theta^{m\alpha(\ell)} f_{p^ k \ell},\quad\text{for } k\geq0,\;m\geq 0,\;1\leq\ell\leq p-1, \] where \(\alpha\) is a map from the set \(\{1,2,\dots,p-1\}\) to the set of integers \(\mathbb{Z}\). The authors establish some basic properties of \((p,q)\)-type sequences: they study the exponential sum defined by these sequences under the hypotheses that \(\alpha\) is a constant and show that the \((p,q)\)-type numbers defined by these sequences are all transcendental and give conditions implying that the corresponding \((p,q)\)-type sequences can be generated by a finite automaton.