Related papers: On the abelian complexity of generalized Thue-Mors…
Let $A$ be a simple abelian variety over a number field $k$ such that $\operatorname{End}(A)$ is noncommutative. We show that $A$ splits modulo all but finitely many primes of $k$. We prove this by considering the subalgebras of…
We study the notion of an asymptotically automatic sequence, which generalises the notion of an automatic sequence. While $k$-automatic sequences are characterised by finiteness of $k$-kernels, the $k$-kernels of asymptotically…
Let L be an infinite regular language on a totally ordered alphabet (A,<). Feeding a finite deterministic automaton (with output) with the words of L enumerated lexicographically with respect to < leads to an infinite sequence over the…
We present new methods of generating Prouhet-Tarry-Escott partitions of arbitrarily large regularity. One of these methods generalizes the construction of the Thue-Morse sequence to finite alphabets with more than two letters. We show how…
The Morse-Hedlund Theorem states that a bi-infinite sequence $\eta$ in a finite alphabet is periodic if and only if there exists $n\in\N$ such that the block complexity function $P_\eta(n)$ satisfies $P_\eta(n)\leq n$. In dimension two,…
The classical theory of continued fractions has been widely studied for centuries for its important properties of good approximation, and more recently it has been generalized to $p$-adic numbers where it presents many differences with…
Recall that an algebraic module is a KG-module that satisfies a polynomial with integer coefficients, with addition and multiplication given by direct sum and tensor product. In this article we prove that non-periodic algebraic modules are…
In this article, we prove that for a completely multiplicative function $f$ from $\mathbb{N}^*$ to a field $K$ such that the set $$\{p \;|\; f(p)\neq 1_K \;\mbox{and }p \mbox{ is prime}\}$$ is finite, the asymptotic subword complexity of…
E. Sk\"oldberg's Morse Theory from an Algebraic Viewpoint and M. J\"ollenbeck's Algebraic Discrete Morse Theory and Applications to Commutative Algebra, which is the algebraic generalization of R. Forman's discrete Morse Theory for Cell…
We consider a numeration system in the ring of integers ${\mathcal O}_K$ of a number field, which we assume to be principal. We prove that the property of being a prime in ${\mathcal O}_K$ is decorrelated from two fundamental examples of…
Recently, in [Bor4], Bor proved a main theorem dealing with $|\bar{N}, p_{n}|_{k}$ summability factors of infinite series. In the present paper, we have generalized that theorem for $|A, p_{n}|_{k}$ summability method by taking normal…
Generalizing a result of \cite{Z1991, CPZ} about elliptic modular forms, we give a closed formula for the sum of all Hilbert Hecke eigenforms over a totally real number field with strict class number $1$, multiplied by their period…
We first introduce a family of binary $pq^2$-periodic sequences based on the Euler quotients modulo $pq$, where $p$ and $q$ are two distinct odd primes and $p$ divides $q-1$. The minimal polynomials and linear complexities are determined…
Fully chaotic Hamiltonian systems possess an infinite number of classical solutions which are periodic, e.g. a trajectory ``p'' returns to its initial conditions after some fixed time tau_p. Our aim is to investigate the spectrum tau_1,…
We study the regularity of the roots of complex monic polynomials $P(t)$ of fixed degree depending smoothly on a real parameter $t$. We prove that each continuous parameterization of the roots of a generic $C^\infty$ curve $P(t)$ (which…
The $2$-adic complexity has been well-analyzed in the periodic case. However, we are not aware of any theoretical results on the $N$th $2$-adic complexity of any promising candidate for a pseudorandom sequence of finite length $N$ or…
The union cost is used, so that an efficient algorithm for computing the k-error linear complexity of a sequence with period 2pn over GF(q) is presented, where p and q are odd primes, and q is a primitive root of modulo p2.
We introduce generalizations of powers and factor complexity via orbits of group actions. These generalizations include concepts like abelian powers and abelian complexity. It is shown that this notion of factor complexity cannot be used to…
For every $a\geq1$ we give a recursion algorithm of building of set of solutions of equations of the form $t(x+a)=t(x)$ and $t(x+a)=1-t(x),$ where $\{t(n)\}$ is Thue-Morse sequence. We pose an open problem and two conjectures.
Binary Sidel'nikov-Lempel-Cohn-Eastman sequences (or SLCE sequences) over F 2 have even period and almost perfect autocorrelation. However, the evaluation of the linear complexity of these sequences is really difficult. In this paper, we…