Sketching is a prominent algorithmic tool for processinglarge data. In this paper, we study the problem of sketchingmatrix norms. We consider two sketching models. The firstis bilinear sketching, in which there is a distribution overpairs of r×n matrices S and n× s matrices T such that forany fixed n×n matrix A, from S ·A ·T one can approximate‖A‖p up to an approxima...

We define ε-factors in the de Rham setting and calculate the determinant of the Gauß-Manin connection for a family of (affine) curves and a vector bundle equipped with a flat connection. “Ordentliche Leute pflegten ihren Schatten mit sich zu nehmen, wenn sie in die Sonne gingen.” A. v. Chamisso, from ”Peter Schlemihls wundersame Geschichte”