Clark, W.E., Blocking sets in finite projective spaces and uneven binary codes, Discrete Mathematics 94 (1991) 65-68. A l-blocking set in the projective space PG(m, 2), m >2, is a set B of points such that any (m -I)-flat meets B and no l-flat is contained in B. A binary linear code is said to be un
Lacunary Sets and Function Spaces with Finite Cotype
✍ Scribed by P. Lefèvre; D. Li; H. Queffélec; L. Rodrı́guez-Piazza
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 185 KB
- Volume
- 188
- Category
- Article
- ISSN
- 0022-1236
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A set function is a function whose domain is the power set of a set, which is assumed to be finite in this paper. We treat a possibly nonadditive set function, i.e., Ž . Ž . a set function which does not satisfy necessarily additivity, A q B s Ž . AjB for A l B s л, as an element of the linear space
It is shown that for every primitive recursive sequence [m i ] i=0 of positive integers, there is an ackermannic sequence [n i ] i=0 of positive integers such that for every partition of the product > i=0 n i into two Borel pieces, there are sets H i n i with |H i |=m i such that the subproduct > i=
This paper is a continuation of [a]. We study weighted function speces of type B;,(u) and F;,(U) on the Euclidean space Pi", where u is a weight function of at most exponential growth. In particular, u(z) = exp(i1zl) is an admissible weight. We deal with atomic decompoeitions of these spaces. Furthe