中文
相关论文

相关论文: On the abelian complexity of generalized Thue-Mors…

200 篇论文

We consider the complexities of substitutive sequences over a binary alphabet. By studying various types of special words, we show that, knowing some initial values, its complexity can be completely formulated via a recurrence formula…

组合数学 · 数学 2015-07-16 Bo Tan , Zhi-Xiong Wen , Yiping Zhang

We give a systematic study of q-algebraic equations. The questions of existence, uniqueness and regularity of the solutions are solved in the space of grid-based Hahn series. The regularity is understood in terms of asymptotic behavior of…

经典分析与常微分方程 · 数学 2020-06-18 Ph. Barbe , J. Cano , P. Fortuny Ayuso , W. P. McCormick

We specify a Turing machine $T_{\text{Mordell}}$ with the following properties. 1. On input $(K,C/K)$, with $K/\mathbb{Q}$ a number field and $C/K$ a smooth projective hyperbolic curve, if $T_{\text{Mordell}}$ terminates, then it outputs…

数论 · 数学 2024-08-22 Levent Alpöge , Brian Lawrence

If $p$ is a prime number, consider a $p$-automatic sequence $(u_n)_{n\ge 0}$, and let $U(X) = \sum_{n\ge 0} u_n X^n \in \mathbb{F}_p[[X]]$ be its generating function. Assume that there exists a formal power series $V(X) = \sum_{n\ge 0} v_n…

组合数学 · 数学 2018-08-01 Narad Rampersad , Manon Stipulanti

We investigate the linear complexities of the periodic 0-1 infinite sequences in which the periods are the sequence of the parities of the spacings between quadratic residues modulo a prime p, and the sequence of the parities of the…

信息论 · 计算机科学 2019-05-07 Mihai Caragiu , Shannon Tefft , Aaron Kemats , Travis Maenle

In this paper, we will provide a mathematically rigorous computer aided estimation for the exact values and robustness for Gelfond exponent of weighted Thue-Morse sequences. This result improves previous discussions on Gelfond exponent by…

动力系统 · 数学 2018-06-26 Yiwei Zhang , Ke Yin , Wanquan Wu

We propose a technique for exploring the abelian complexity of recurrent infinite words, focusing particularly on infinite words associated with Parry numbers. Using that technique, we give the affirmative answer to the open question posed…

组合数学 · 数学 2013-01-16 Ondřej Turek

We prove that for $1<c<4/3$ the subsequence of the Thue--Morse sequence $\mathbf t$ indexed by $\lfloor n^c\rfloor$ defines a normal sequence, that is, each finite sequence $(\varepsilon_0,\ldots,\varepsilon_{T-1})\in \{0,1\}^T$ occurs as a…

数论 · 数学 2017-07-18 Lukas Spiegelhofer

For $\mathcal{A}_t$, the Auslander algebra of $K[x]/(x^t)$, it is shown that every complete exceptional sequence of $\mathcal{A}_t$-modules is a complete $\tau$-exceptional sequence. Moreover, it is established that the mutation of complete…

表示论 · 数学 2026-02-16 Maximilian Kaipel

Let $k$ be a totally real number field and $p$ a prime. We show that the ``complexity'' of Greenberg's conjecture ($\lambda = \mu = 0$) is of $p$-adic nature governed (under Leopoldt's conjecture) by the finite torsion group ${\mathcal…

数论 · 数学 2021-08-17 Georges Gras

Linear recursions of degree $k$ are determined by evaluating the sequence of Generalized Fibonacci Polynomials, $\{F_{k,n}(t_1,...,t_k)\}$ (isobaric reflects of the complete symmetric polynomials) at the integer vectors $(t_1,...,t_k)$. If…

数论 · 数学 2007-05-23 Trueman MacHenry , Kieh Wong

We obtain a complete classification of complex-valued sequences which are both multiplicative and automatic.

数论 · 数学 2021-01-19 Jakub Konieczny , Mariusz Lemańczyk , Clemens Müllner

We investigate arithmetic properties of the sequence b(n) = B_MN(n) mod M obtained from the base-M to base-N shift map B_MN.We prove that b(n) is ultimately periodic exactly when every prime divisor of M also divides N; in that case we…

数论 · 数学 2025-09-16 Wanli Ma

In this article we introduce a new approach to compute infinite products defined by automatic sequences involving the Thue-Morse sequence. As examples, for any positive integers $q$ and $r$ such that $0 \leq r \leq q-1$, we find infinitely…

组合数学 · 数学 2020-06-11 Shuo Li

Let $k\ge 2$. We prove that the characteristic sequence of a regular language over a $k$-letter alphabet is $k$-automatic. More generally, if $t\ge 2$ and $t,k$ are multiplicatively dependent, we show that the characteristic sequence of a…

形式语言与自动机理论 · 计算机科学 2018-07-24 Michel Rigo , Robert Underwood

We define the Thue-Morse transform T on a class of infinite binary words. It sends the alternating word a_0 = 010101... to the Thue-Morse sequence. We then study its orbit a_m = T^m(a_0) as well as the sequences u_m and v_m giving…

数论 · 数学 2026-05-29 Benoit Cloitre

In this paper we study the properties of an algorithm for generating continued fractions in the field of p-adic numbers $\mathbb{Q}_p$. First of all, we obtain an analogue of the Galois' Theorem for classical continued fractions. Then, we…

数论 · 数学 2022-01-31 Nadir Murru , Giuliano Romeo , Giordano Santilli

We consider Tate cycles on an Abelian variety $A$ defined over a sufficiently large number field $K$ and having complex multiplication. We show that there is an effective bound $C = C(A,K)$ so that to check whether a given cohomology class…

数论 · 数学 2019-08-15 V. Kumar Murty , Vijay M. Patankar

The Thue-Morse sequence is an aperiodically ordered infinite binary sequence. It is used as a one-dimensional way to model the structure of a quasicrystal. For example, taking autocorrelations of these sequences (roughly, measuring how…

统计力学 · 物理学 2022-09-23 Darren C. Ong

The Thue-Morse sequence is generalized to the $TM_m$ sequences and two equivalent definitions are given. This generalization leads to transcendental numbers and has Queff\'elec's theorem on Thue-Morse continued fractions as a special case.…

数论 · 数学 2013-02-11 Gerardo González Robert