On t-extensions of the Hankel determinants of certain automatic sequences

نویسندگان

  • Hao Fu
  • Guo-Niu Han
چکیده

Abstract. In 1998, Allouche, Peyrière, Wen and Wen considered the Thue–Morse sequence, and proved that all the Hankel determinants of the period-doubling sequence are odd integers. We speak of t-extension when the entries along the diagonal in the Hankel determinant are all multiplied by t. We prove that the t-extension of each Hankel determinant of the period-doubling sequence is a polynomial in t, whose leading coefficient is the only one to be an odd integer. Our proof makes use of the combinatorial set-up developed by Bugeaud and Han, which appears to be very suitable for this study, as the parameter t counts the number of fixed points of a permutation. Finally, we prove that all the t-extensions of the Hankel determinants of the regular paperfolding sequence are polynomials in t of degree less than or equal to 3.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

From a Polynomial Riemann Hypothesis to Alternating Sign Matrices

This paper begins with a brief discussion of a class of polynomial Riemann hypotheses, which leads to the consideration of sequences of orthogonal polynomials and 3-term recursions. The discussion further leads to higher order polynomial recursions, including 4-term recursions where orthogonality is lost. Nevertheless, we show that classical results on the nature of zeros of real orthogonal pol...

متن کامل

A Combinatorial Proof of the Non-Vanishing of Hankel Determinants of the Thue-Morse Sequence

In 1998, Allouche, Peyrière, Wen and Wen established that the Hankel determinants associated with the Thue–Morse sequence on {−1, 1} are always nonzero. Their proof depends on a set of sixteen recurrence relations. We present an alternative, purely combinatorial proof of the same result. We also re-prove a recent result of Coons on the non-vanishing of the Hankel determinants associated to two ...

متن کامل

A Petri-net based modeling tool, for analysis and evaluation of computer systems

Petri net is one of the most popular methods in modeling and evaluation of concurrent and event-based systems. Different tools have been created to support modeling and simulation of different extensions of Petri net in different applications. Each tool supports some extensions and some features. In this work a Petri net based modeling and evaluation tool is presented that not only supports dif...

متن کامل

Pfaffian decomposition and a Pfaffian analogue of q-Catalan Hankel determinants

Motivated by the Hankel determinant evaluation of moment sequences, we study a kind of Pfaffian analogue evaluation. We prove an LU -decomposition analogue for skew-symmetric matrices, called Pfaffian decomposition. We then apply this formula to evaluate Pfaffians related to some moment sequences of classical orthogonal polynomials. In particular we obtain a product formula for a kind of q-Cata...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 562  شماره 

صفحات  -

تاریخ انتشار 2015