On sets of differences
✍ Scribed by F.Alberto Grünbaum
- Publisher
- Elsevier Science
- Year
- 1977
- Tongue
- English
- Weight
- 250 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0001-8708
No coin nor oath required. For personal study only.
✦ Synopsis
Consider the problem of recovering a set of real numbers X from the knowledge of its unlabeled set of differences xi --q > xi , xj E x, 1 <z.,j<N.
(1)
This problem comes up in different setups, among them in the so-called "phase problem in crystallography"; see [3] and the references given there. In that case one attempts to determine X, up to a congruency, from the modulus of the "amplitude function" h real.
The square of this modulus is the "intensity" and it is plain that the knowledge of I(h), f or enough values of A, is equivalent to that of the unlabeled differences (1).
One knows that the problem does not have a unique solution. There is a systematic way of producing lots of sets which are not congruent but have the same set of differences; see [2]. Quite recently, Bloom [I] found a new pair of such sets which adds new interest to the field. Indeed Piccard [4, p. 311 presents a result to the effect that if the nonzero elements in (1) are all different then one can reconstruct X from (1). The pair found by Bloom shows that Piccard's result does not hold.
It is not hard to find conditions, like demanding that the Xj , 1 < j < N, be linearly independent over the integers, that guaranteed that X can be found from (1). But all of these conditions are too strong, and a "good" sufficient condition is still lacking, This is particularly true when the xj's are taken to be integers, an assumption we make from now on.
📜 SIMILAR VOLUMES
This paper deals with the problem of finding the maximal density, +(M), of sets of integers in which differences given by a set M do not occur. The problem is solved for the case where the elements of M are in arithmetic progression. Besides finding lower bounds for most members of the general three
We formulate and solve a collection of functional equations arising in the framework of fuzzy logic when modeling the concept of a difference operation between couples of fuzzy sets.
Let D be a (v, k, \*)-difference set in a group G. Assume that G has a normal subgroup N such that GÂN is cyclic or nearly cyclic. Under the self-conjugacy assumption on exp(GÂN), we shall give bounds on |N| and \*. The theorem is applicable to a wider variety of parameters for groups, not necessari
The supremum of the symmetric difference x y := (x \ y) ∪ (y \ x) of subsets x, y of R satisfies the so-called four-point condition; that is, for all x, x , y, y ⊆ R, one has It follows that the set E of all subsets of R which are bounded from above forms a valuated matroid relative to the map v: