SearcharxivSearch

arXiv subjects

Ying-Jun Guo

Publications and source records attributed to Ying-Jun Guo.

2 recordsLinked to original sources

Criteria for apwenian sequences

In 1998, Allouche, Peyrière, Wen and Wen showed that the Hankel determinant $H_n$ of the Thue-Morse sequence over $\{-1,1\}$ satisfies $H_n/2^{n-1}\equiv 1~(\mathrm{mod}~2)$ for all $n\geq 1$. Inspired by this result, Fu and Han introduced \emph{apwenian} sequences over $\{-1,1\}$, namely, $\pm 1$ sequences whose Hankel determinants satisfy $H_n/2^{n-1}\equiv 1~(\mathrm{mod}~2)$ for all $n\geq 1$, and proved with computer assistance that a few sequences are apwenian. In this paper, we obtain an easy to check criterion for apwenian sequences, which allows us to determine all apwenian sequences that are fixed points of substitutions of constant length. Let $f(z)$ be the generating functions of such apwenian sequences. We show that for all integer $b\ge 2$ with $f(1/b)\neq 0$, the real number $f(1/b)$ is transcendental and its irrationality exponent is equal to $2$. Besides, we also derive a criterion for zero-one apwenian sequences whose Hankel determinants satisfy $H_n\equiv 1~(\mathrm{mod}~2)$ for all $n\geq 1$. We find that the only zero-one apwenian sequence, among all fixed points of substitutions of constant length, is the period-doubling sequence. Various examples of apwenian sequences given by substitutions with projection are also given. Furthermore, we prove that all Sturmian sequences over $\{-1,1\}$ or $\{0,1\}$ are not apwenian. And we conjecture that fixed points of substitution of non-constant length over $\{-1,1\}$ or $\{0,1\}$ can not be apwenian.

math.NT

On the regularity of the Hankel determinant sequence of the characteristic sequence of powers

For any sequences $\mathbf{u}=\{u(n)\}_{n\geq0}, \mathbf{v}=\{v(n)\}_{n\geq0},$ we define $\mathbf{u}\mathbf{v}:=\{u(n)v(n)\}_{n\geq0}$ and $\mathbf{u}+\mathbf{v}:=\{u(n)+v(n)\}_{n\geq0}$. Let $f_i(x)~(0\leq i< k)$ be sequence polynomials whose coefficients are integer sequences. We say an integer sequence $\mathbf{u}=\{u(n)\}_{n\geq0}$ is a polynomial generated sequence if $$\{u(kn+i)\}_{n\geq0}=f_i(\mathbf{u}),~(0\leq i< k).$$ %Here we define $\mathbf{u}\mathbf{v}:=\{u(n)v(n)\}_{n\geq0}$ and $\mathbf{u}+\mathbf{v}:=\{u(n)+v(n)\}_{n\geq0}$ for any two sequences $\mathbf{u}=\{u(n)\}_{n\geq0}, \mathbf{v}=\{v(n)\}_{n\geq0}.$ In this paper, we study the polynomial generated sequences. Assume $k\geq2$ and $f_i(x)=\mathbf{a}_ix+\mathbf{b}_i~(0\leq i< k)$. If $\mathbf{a}_i$ are $k$-automatic and $\mathbf{b}_i$ are $k$-regular for $0\leq i< k$, then we prove that the corresponding polynomial generated sequences are $k$-regular. As a application, we prove that the Hankel determinant sequence $\{\det(p_{i+j})_{i,j=0}^{n-1}\}_{n\geq0}$ is $2$-regular, where $\{p(n)\}_{n\geq0}=0110100010000\cdots$ is the characteristic sequence of powers 2. Moreover, we give a answer of Cigler's conjecture about the Hankel determinants.

math.NT