Description: The course covers mathematics useful in analyzing computer algorithms. Topics include recurrence relations, evaluation of sums, integer functions, elementary number theory, binomial ...
In this paper we prove the following theorem: let G be a discrete amenable group with nontrivial almost-periodic compactification, and let F be a complex-valued function defined in [-1, 1]; then F ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback