Upper bound for the size of monotone span programs
In this paper we consider certain prop- erties of an general access structure and its dual. In particular we prove that corer = corerL. We also es- tablish a new upper bound for the size of MSP, which computes connected access structure I?. We show that the size of a MSP is limited above by the sum of the number of minimal and the number of maximal sets minus one. This is the first upper bound on the size of MSPs to our knowledge.
We study regularity properties of a positive measure in the euclidean space in terms of two square functions which are the multiplicative analogues of the usual martingale square function and of the Lusin area function of a harmonic function. The size of ...