Related papers: Combinatorics on words and generating Dirichlet se…
We study the Dirichlet series associated with the integers whose radix-$b$ representation misses certain (fixed) digits. The existence of a meromorphic continuation to the entire complex plane, which was already well-known as a general fact…
We study the problem of generating interesting integer sequences with a combinatorial interpretation. For this we introduce a two-step approach. In the first step, we generate first-order logic sentences which define some combinatorial…
For certain sequences $A$ of positive integers with missing $g$-adic digits, the Dirichlet series $F_A(s) = \sum_{a\in A} a^{-s}$ has abscissa of convergence $\sigma_c < 1$. The number $\sigma_c$ is computed. This generalizes and…
We connect a primitive operation from arithmetic -- summing the digits of a base-$B$ integer -- to $q$-series and product generating functions analogous to those in partition theory. We find digit sum generating functions to be intertwined…
We continue to consider the ordered lexicographic sequence, which is constructed according to the formal characteristics of a series of natural numbers. For analysis, we selected balanced parentheses with zeros, Motzkin words. As you know,…
We study word series and extended word series, classes of formal series for the analysis of some dynamical systems and their discretizations. These series are similar to but more compact than B-series. They may be composed among themselves…
The Dirichlet series $L_m(s)$ are of fundamental importance in number theory. Shanks defined the generalized Euler and class numbers in connection with these Dirichlet series, denoted by $\{s_{m,n}\}_{n\geq 0}$. We obtain a formula for the…
Opened up by early contributions due to, among others, H. Bohr, Hardy-Riesz, Bohnenblust-Hille, Neder and Landau the last 20 years show a substantial revival of systematic research on ordinary Dirichlet series $\sum a_n n^{-s}$, and more…
The manuscript reviews Dirichlet Series of important multiplicative arithmetic functions. The aim is to represent these as products and ratios of Riemann zeta-functions, or, if that concise format is not found, to provide the leading…
The purpose of this paper is to show that some combinatorial sequences, such as second-order Eulerian numbers and Eulerian numbers of type $B$, can be generated by context-free grammars.
We introduce a class of group endomorphisms -- those of finite combinatorial rank -- exhibiting slow orbit growth. An associated Dirichlet series is used to obtain an exact orbit counting formula, and in the connected case this series is…
We introduce bud generating systems, which are used for combinatorial generation. They specify sets of various kinds of combinatorial objects, called languages. They can emulate context-free grammars, regular tree grammars, and synchronous…
A Lambert series generating function is a special series summed over an arithmetic function $f$ defined by \[ L_f(q) := \sum_{n \geq 1} \frac{f(n) q^n}{1-q^n} = \sum_{m \geq 1} (f \ast 1)(m) q^m. \] Because of the way the left-hand-side…
Gessel's famous Bessel determinant formula gives the generating function of the number of permutations without increasing subsequences of a given length. Ekhad and Zeilberger proposed the challenge of finding a suitable generalization for…
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…
A classical theorem of Kempner states that the sum of the reciprocals of positive integers with missing decimal digits converges. This result is extended to much larger families of "missing digits" sets of positive integers with both…
The paper explores combinatorial properties of Fibonacci words and their generalizations within the framework of combinatorics on words. These infinite sequences, measures the diversity of subwords in Fibonacci words, showing non-decreasing…
A classical theorem of Kempner states that the sum of the reciprocals of positive integers with missing decimal digits converges. This result is extended to much larger families of "missing digits" sets of positive integers with convergent…
Let $\beta=\frac{1+\sqrt{5}}{2}$, $(a_n)_{n \in \mathbb{N}^+}$ be a non-uniform morphic sequence involving the infinite Fibonacci word and $(\delta(n))_{n \in \mathbb{N}^+}$ be a positive sequence such that for all positive integers $n$,…
We introduce a hybridization of digital sequences with uniformly distributed sequences in the domain of $b$-adic integers, $\mathbb Z_{b}, b\in\mathbb N\setminus\{1\}$, by using such sequences as input for generating matrices. The…