If you are interested in the real-world applications of numbers, discrete mathematics may be the concentration for you. Because discrete mathematics is the language of computing, it complements the ...
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