We consider limit theorems for counting processes generated by Minkowski sums of random fuzzy sets. Using support functions, we prove almost-sure convergence for a renewal process indexed by fuzzy sets in an inner-product vector space. We also get convergence for the associated containment renewal f
An Inverse Theorem for Sums of Sets of Lattice Points
โ Scribed by M.B. Nathanson
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 554 KB
- Volume
- 46
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Erdos and Rado defined a A-system, as a family in which every two members have the same intersection. Here we obtain a new upper bound on the maximum cardinality q ( n , q ) of an n-uniform family not containing any A-system of cardinality q. Namely, we prove that, for any a > 1 and q , there exists
Subroutines are supplied which allow for the computation of lattice sums and their Fourier transforms including first and second derivatives for potentials of the form 1/r" for arbitrary integer n and arbitrary lattices. All summation limits and parameters are automatically determined according to t
Various random fixed point theorems for different classes of 1-set-contractive random operator are proved. The class of 1-set-contractive random operators includes condensing and nonexpansive random operators. It also includes semicontractive type random operators and locally almost nonexpansive ran