THE SUM-OF-DIGITS FUNCTION FOR COMPLEX BASES
... n!N where Fq is a continuous, 1-periodic, nowhere differentiable function with known Fourier expansion. Several more sophisticated digital functions have been studied since then and the fractal behaviour of the summatory functions appeared in many of these cases (cf. [5, 23]). Various methods were u ...
... n!N where Fq is a continuous, 1-periodic, nowhere differentiable function with known Fourier expansion. Several more sophisticated digital functions have been studied since then and the fractal behaviour of the summatory functions appeared in many of these cases (cf. [5, 23]). Various methods were u ...
![[Part 1]](http://s1.studyres.com/store/data/008795920_1-0c9d44c6bff0d29348d19d3efc363e24-300x300.png)
[Part 1]
... as a polynomial of degree i + j + 1 in n, and this mode of expression is useful, still the formula is rather clumsy and hard to recall. Below we shall show how the method of generating functions can be used to obtain elegant closed forms for (1.1) very quickly. The first of these uses the Stirling n ...
... as a polynomial of degree i + j + 1 in n, and this mode of expression is useful, still the formula is rather clumsy and hard to recall. Below we shall show how the method of generating functions can be used to obtain elegant closed forms for (1.1) very quickly. The first of these uses the Stirling n ...
Eigenface
... If the value is negative, then as one dimension increases, the other decreases. If we had ended up with a negative covariance here, then that would have said the opposite that as the number of hours of study increased the final mark decreased. In the last case, if the covariance is zero, it indicate ...
... If the value is negative, then as one dimension increases, the other decreases. If we had ended up with a negative covariance here, then that would have said the opposite that as the number of hours of study increased the final mark decreased. In the last case, if the covariance is zero, it indicate ...
![[hal-00574623, v2] Averaging along Uniform Random Integers](http://s1.studyres.com/store/data/019969824_1-25527940ea4f317ec31969269e4745aa-300x300.png)
THE NUMBER OF LATTICE POINTS IN ALCOVES AND THE
... positive roots of height i. (The height of a root is the sum of its coefficients when expressed as a linear combination of simple roots.) Then (ml , . . . , m1 ) is the dual partition to the partition (k1 , . . . , kh−1 ). 2. Another formula for the exponents Now we come to another formula for the e ...
... positive roots of height i. (The height of a root is the sum of its coefficients when expressed as a linear combination of simple roots.) Then (ml , . . . , m1 ) is the dual partition to the partition (k1 , . . . , kh−1 ). 2. Another formula for the exponents Now we come to another formula for the e ...
PDF
... To prove convergence in Lp(A),we choose r large enough to incremental (i.e., recursive) approximations is also dealt with ensure that for given 61 > 0 the following holds: by Jones [19J, as well as in the above cited papers. ...
... To prove convergence in Lp(A),we choose r large enough to incremental (i.e., recursive) approximations is also dealt with ensure that for given 61 > 0 the following holds: by Jones [19J, as well as in the above cited papers. ...