16,259 research outputs found
Book review: Automatic sequences: theory, applications, generalizations
Beautifully presented in a concise and scholarly manner, this book develops the fascinating theory of sequences generated by one of the most basic models of computation; namely, finite automata
Lucas' theorem: its generalizations, extensions and applications (1878--2014)
In 1878 \'E. Lucas proved a remarkable result which provides a simple way to
compute the binomial coefficient modulo a prime in terms of
the binomial coefficients of the base- digits of and : {\it If is
a prime, and are the
-adic expansions of nonnegative integers and , then
\begin{equation*} {n\choose m}\equiv \prod_{i=0}^{s}{n_i\choose m_i}\pmod{p}.
\end{equation*}}
The above congruence, the so-called {\it Lucas' theorem} (or {\it Theorem of
Lucas}), plays an important role in Number Theory and Combinatorics. In this
article, consisting of six sections, we provide a historical survey of Lucas
type congruences, generalizations of Lucas' theorem modulo prime powers, Lucas
like theorems for some generalized binomial coefficients, and some their
applications.
In Section 1 we present the fundamental congruences modulo a prime including
the famous Lucas' theorem. In Section 2 we mention several known proofs and
some consequences of Lucas' theorem. In Section 3 we present a number of
extensions and variations of Lucas' theorem modulo prime powers. In Section 4
we consider the notions of the Lucas property and the double Lucas property,
where we also present numerous integer sequences satisfying one of these
properties or a certain Lucas type congruence. In Section 5 we collect several
known Lucas type congruences for some generalized binomial coefficients. In
particular, this concerns the Fibonomial coefficients, the Lucas -nomial
coefficients, the Gaussian -nomial coefficients and their generalizations.
Finally, some applications of Lucas' theorem in Number Theory and Combinatorics
are given in Section 6.Comment: 51 pages; survey article on Lucas type congruences closely related to
Lucas' theore
A note on multiplicative automatic sequences
We prove that any -automatic completely multiplicative function
essentially coincides with a Dirichlet character.
This answers a question of J. P. Allouche and L. Goldmakher and confirms a
conjecture of J. Bell, N. Bruin and M. Coons for completely multiplicative
functions. Further, assuming two standard conjectures in number theory, the
methods allows for removing the assumption of completeness
A note on multiplicative automatic sequences, II
We prove that any -automatic multiplicative function
either essentially coincides with a Dirichlet
character, or vanishes on all sufficiently large primes. This confirms a strong
form of a conjecture of J. Bell, N. Bruin, and M. Coons
Quasicrystals, model sets, and automatic sequences
We survey mathematical properties of quasicrystals, first from the point of
view of harmonic analysis, then from the point of view of morphic and automatic
sequences.
Nous proposons un tour d'horizon de propri\'et\'es math\'ematiques des
quasicristaux, d'abord du point de vue de l'analyse harmonique, ensuite du
point de vue des suites morphiques et automatiques
- …