Computer assisted proof for Apwenian sequences

DOI10.1145/2930889.2930891MaRDI QIDQ2985832zbMATH OpenOpenAlexFDO

Authors Hao Fu, Guo-Niu Han

Publication date 10 May 2017

Published in Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2930889.2930891

zbMATH Keywords

Apwenian sequencecomputer assisted proofHankel determinantpermutationThue-Morse sequence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Automata sequences (11B85) Combinatorics on words (68R15)

Recommendations

• Criteria for apwenian sequences
• Perfect linear complexity profile and apwenian sequences
• Irrationality measures for some automatic real numbers
• On the automaticity of the Hankel determinants of a family of automatic sequences
• Hankel determinant calculus for the Thue-Morse and related sequences

Cited in

(10)

• Perfect linear complexity profile and apwenian sequences
• Criteria for apwenian sequences
• On the automaticity of the Hankel determinants of a family of automatic sequences
• Hankel determinants, Padé approximations, and irrationality exponents for p-adic numbers
• Hankel continued fraction and its applications
• Hankel matrices for the period-doubling sequence
• On the algebraicity of Thue-Morse and period-doubling continued fractions
• On the automaticity of sequences defined by the Thue-Morse and period-doubling Stieltjes continued fractions
• On rational approximations of certain Mahler functions with a connection to the Thue–Morse sequence
• On a family of automatic apwenian sequences

This page was built for publication: Computer assisted proof for Apwenian sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2985832)