Séminaire Lotharingien de Combinatoire, B18a (1988), 1
p.
[Formerly: Publ. I.R.M.A. Strasbourg, 1988, 358/S-18, p.
139.]
Michael Drmota
Eine kombinatorische Ungleichung
Abstract.
Using the notion of s-discrepancy Ds(u) of a word
u over a
finite alphabet A={a(1),...,a(m)}
the s-discrepancy of u= (a(1)...a(m))n is explicitly
calculated.
The following versions are available: