A Generating Function Technique for Beat
โ
Kevin O'Bryant
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 178 KB
Let g(x, n), with x ยฅ R + , be a step function for each n. Assuming certain technical hypotheses, we give a constant a and function f such that ; . n=1 g(x, n) can be written in the form a+; 0 < r < x f(r), where the summation is extended over all points in (0, x) at which some g( โข , n) is not cont