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

Using a genealogically ordered infinite regular language, we know how to represent an interval of R. Numbers having an ultimately periodic representation play a special role in classical numeration systems. The aim of this paper is to…

Studying and comparing arithmetic properties of a given automatic sequence and the sequence of coefficients of the composition inverse of the associated formal power series (the formal inverse of that sequence) is an interesting problem.…

Let $A/K$ be an abelian variety with real multiplication defined over a $p$-adic field $K$ with $p>2$. We show that $A/K$ must have either potentially good or potentially totally toric reduction. In the former case we give formulas of the…

The length $a(n)$ of the longest common subsequence of the $n$'th Thue-Morse word and its bitwise complement is studied. An open problem suggested by Jean Berstel in 2006 is to find a formula for $a(n)$. In this paper we prove new lower…

To a complex polynomial function $f$ with arbitrary singularities we associate the number of Morse points in a general linear Morsification $f_{t} := f - t\ell$. We produce computable algebraic formulas in terms of invariants of $f$ for the…

Let $(R,\mathfrak{m})$ be a Noetherian local ring and $\widehat{R}$ its $\mathfrak{m}$-adic completion. We study the problem of determining when a finitely generated $\widehat{R}$-module arises from an $R$-module, i.e., when it is…

We define the arithmetic self-similarity (AS) of a one-sided infinite sequence sigma to be the set of arithmetic progressions through sigma which are a vertical shift of sigma. We study the AS of several famlies of sequences, viz.…

We estimate Gowers uniformity norms for some classical automatic sequences, such as the Thue-Morse and Rudin-Shapiro sequences. The methods can also be extended to other automatic sequences. As an application, we asymptotically count…

We compute the Grothendieck group of the category of abelian varieties over an algebraically closed field $k$. We also compute the Grothendieck group of the category of $A$-isotypic abelian varieties, for any simple abelian variety $A$,…

We fully classify automatic sequences $a$ over a finite alphabet $\Omega$ with the property that each word over $\Omega$ appears is $a$ along an arithmetic progression. Using the terminology introduced by Avgustinovich, Fon-Der-Flaass and…

Given a countable set X (usually taken to be N or Z), an infinite permutation $\pi$ of X is a linear ordering $<_\pi$ of X. This paper investigates the combinatorial complexity of infinite permutations on N associated with the image of…

We prove that the generalized Thue-Morse word $\mathbf{t}_{b,m}$ defined for $b \geq 2$ and $m \geq 1$ as $\mathbf{t}_{b,m} = (s_b(n) \mod m)_{n=0}^{+\infty}$, where $s_b(n)$ denotes the sum of digits in the base-$b$ representation of the…

Inspired by the relations between periods of elliptic integrals of the third kind and the periods of the extensions of the corresponding elliptic curves by the multiplicative group, we introduce the notion of the third kind periods for…

Bott periodicity for the unitary, orthogonal and symplectic groups is fundamental to topological K-theory. Analogous to unitary topological K-theory, for algebraic K-groups with finite coefficients similar periodicity results are…

We investigate the computational complexity of problems on toric ideals such as normal forms, Gr\"obner bases, and Graver bases. We show that all these problems are strongly NP-hard in the general case. Nonetheless, we can derive efficient…

We study an integer sequence associated with Cantor's division polynomials of a genus 2 curve having an integral point. We show that the reduction modulo $p$ of such a sequence is periodic for all but finitely many primes $p$, and describe…

Let $b \ge 2$ be an integer. We prove that the $b$-adic expansion of every irrational algebraic number cannot have low complexity. Furthermore, we establish that irrational morphic numbers are transcendental, for a wide class of morphisms.…

In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…

We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…

We describe periods of irreducible holomorphic manifolds of $K3^{[n]}$-type with a non-symplectic automorphism of prime order $p\geq 3$. These turn out to lie on complex ball quotients and we are able to give a precise characterization of…