Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 20 Jun 2018 in math.NT and cs.FL | (1806.08729v1)

Abstract: For any sequences u=u(n)<em>n0,v=v(n)</em>n0,\mathbf{u}={u(n)}<em>{n\geq0}, \mathbf{v}={v(n)}</em>{n\geq0}, we define uv:=u(n)v(n)<em>n0\mathbf{u}\mathbf{v}:={u(n)v(n)}<em>{n\geq0} and u+v:=u(n)+v(n)</em>n0\mathbf{u}+\mathbf{v}:={u(n)+v(n)}</em>{n\geq0}. Let $f_i(x)~(0\leq i&lt; k)$ be sequence polynomials whose coefficients are integer sequences. We say an integer sequence u=u(n)<em>n0\mathbf{u}={u(n)}<em>{n\geq0} is a polynomial generated sequence if $${u(kn+i)}</em>{n\geq0}=f_i(\mathbf{u}),~(0\leq i&lt; k).$$ %Here we define uv:=u(n)v(n)<em>n0\mathbf{u}\mathbf{v}:={u(n)v(n)}<em>{n\geq0} and u+v:=u(n)+v(n)</em>n0\mathbf{u}+\mathbf{v}:={u(n)+v(n)}</em>{n\geq0} for any two sequences u=u(n)<em>n0,v=v(n)</em>n0.\mathbf{u}={u(n)}<em>{n\geq0}, \mathbf{v}={v(n)}</em>{n\geq0}. In this paper, we study the polynomial generated sequences. Assume k2k\geq2 and $f_i(x)=\mathbf{a}<em>ix+\mathbf{b}_i~(0\leq i&lt; k)$. If ai\mathbf{a}_i are kk-automatic and bi\mathbf{b}_i are kk-regular for $0\leq i&lt; k$, then we prove that the corresponding polynomial generated sequences are kk-regular. As a application, we prove that the Hankel determinant sequence det(p</em>i+j)<em>i,j=0<sup>n1</sup></em>n0{\det(p</em>{i+j})<em>{i,j=0}<sup>{n-1}}</sup></em>{n\geq0} is $2$-regular, where p(n)n0=0110100010000{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.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.