Thierry De Pauw

Rectifiable and flat G chains in a metric space

Chains, in a complete metric space, which have coefficients in a normed abelian group

Tight Bounds on the Size of Neural Networks for Classification Problems

G

Application of Scans and Fractional Power Integrands

are studied. An

A Constructive Approach to Calculating Lower Entropy Bounds

m

Linearly approximatable functions

dimensional rectifiable chain is the Lipschitz push-forward of a region in

Nearly flat almost monotone measures are big pieces of lipschitz graphs

{\Bbb R}^m

On the exceptional sets of the flux of a bounded vectorfield

equipped with a measurable

The divergence theorem for unbounded vector fields

G

Size minimization and approximating problems

-valued density. Flat chains are obtained by completion using a certain flat norm on polyhedral or Lipschitz chain approximations. Numerous basic results of geometric measure theory for these chains are derived including the rectifiability of finite mass flat chains provided that

A Generalization of Reifenberg's Theorem in R-3

G