On certain recurrent and automatic sequences in finite fields

被引:4
|
作者
Lasjaunias, Alain [1 ]
Yao, Jia-Yan [2 ]
机构
[1] CNRS, Inst Math Bordeaux, UMR 5251, F-33405 Talence, France
[2] Tsinghua Univ, Dept Math, Beijing 100084, Peoples R China
基金
中国国家自然科学基金;
关键词
Finite fields; Power series over a finite field; Continued fractions; Finite automata; Automatic sequences; HYPERQUADRATIC CONTINUED FRACTIONS; ALGEBRAIC POWER-SERIES; PARTIAL QUOTIENTS; EXPANSION;
D O I
10.1016/j.jalgebra.2016.12.028
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this work we consider the general question: for a given algebraic formal power series with coefficients in a finite field, what kind of regularity (if any) can be expected for the partial quotients of the above power series in continued fraction expansion? Such a question is natural, since by a theorem of Christol, the coefficients of an algebraic power series over a finite field form an automatic sequence. Certain algebraic continued fractions are such that the sequence of the leading coefficients of the partial quotients is automatic. Here we give a rather general family of such sequences. Moreover, inspired by these examples, we give two criteria on automatic sequences, which allow us to obtain two new families of automatic sequences in an arbitrary finite field. (C) 2017 Elsevier Inc. All rights reserved.
引用
收藏
页码:133 / 152
页数:20
相关论文
共 50 条
  • [31] On the Nth linear complexity of automatic sequences
    Merai, Laszlo
    Winterhof, Arne
    JOURNAL OF NUMBER THEORY, 2018, 187 : 415 - 429
  • [32] On the joint subword complexity of automatic sequences
    Moshe, Yossi
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (38-40) : 3573 - 3588
  • [33] Morphic Sequences Versus Automatic Sequences
    Allouche, Jean-Paul
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2021, 2021, 12811 : 3 - 11
  • [34] A certain generalized Lucas sequence and its application to the permutation binomials over finite fields
    Zhang, Zhilin
    Li, Hongjian
    Tian, Delu
    INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 2024,
  • [35] EXPLICIT FORMULAS FOR SELF-COMPLEMENTARY NORMAL BASES IN CERTAIN FINITE-FIELDS
    LEMPEL, A
    SEROUSSI, G
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (04) : 1220 - 1222
  • [36] On sequences of Toeplitz matrices over finite fields (vol 561, pg 63, 2019)
    Price, Geoffrey
    Wortham, Myles
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2020, 590 : 330 - 332
  • [37] Design sequences with high linear complexity over finite fields using generalized cyclotomy
    Vladimir Edemskiy
    Xiaoni Du
    Cryptography and Communications, 2017, 9 : 683 - 691
  • [38] Design sequences with high linear complexity over finite fields using generalized cyclotomy
    Edemskiy, Vladimir
    Du, Xiaoni
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2017, 9 (06): : 683 - 691
  • [39] Computation of periods of product polynomials over finite fields and its application on convolution sequences
    Zhang, WG
    Xiao, H
    Xiao, GZ
    CHINESE JOURNAL OF ELECTRONICS, 2006, 15 (02): : 293 - 296
  • [40] Multiplicative automatic sequences
    Jakub Konieczny
    Mariusz Lemańczyk
    Clemens Müllner
    Mathematische Zeitschrift, 2022, 300 : 1297 - 1318