Domino tilings and products of Fibonacci and Pell numbers.
Double recurrence and almost sure convergence.
Drawing a graph in a hypercube.
Drunken man infinite words complexity
In this article, we study the complexity of drunken man infinite words. We show that these infinite words, generated by a deterministic and complete countable automaton, or equivalently generated by a substitution over a countable alphabet of constant length, have complexity functions equivalent to n(log2n)2 when n goes to infinity.
Duality triads of higher rank: Further properties and some examples
It is shown that duality triads of higher rank are closely related to orthogonal matrix polynomials on the real line. Furthermore, some examples of duality triads of higher rank are discussed. In particular, it is shown that the generalized Stirling numbers of rank r give rise to a duality triad of rank r.
Ducci sequences in higher dimensions.
Důkaz jedné věty o binomických součinitelích pomocí počtu pravděpodobnosti
Důkaz věty, že existuje nekonečně mnoho kmenných čísel , je-li kmenné
Dynamic one-pile blocking Nim.
Dynamical zeta functions and Kummer congruences