Uniqueness sets for unbounded spectra

For every set $S?\mathbb{R}$ of finite measure, we construct a system of exponentials ${\{e^{i\lambda t}\}}_{\lambda \in \Lambda }$ which is complete in $L^2(S)$ and such that the set of frequencies Λ has the critical density $D(\Lambda )=\mathrm{mes}(S)/2\pi$.     

Uniqueness sets for multiple Haar series

Criteria are found for the membership of multidimensional sets in the class of M-sets for multiple Haar series with various conditions imposed on the coefficients. Several generalizations of the uniqueness theorem are established.Translated from Matematicheskie Zametki, Vol. 14, No. 6, pp. 789–798, December, 1973.     

A note on gevrey classes of functions connected with goursat problems

Summary The Gevrey classes G(β, δ, d) have been introduced in connection with non-linear local Goursat problems. A lemma is proved which shows that the definition of the class G(β, δ, d) can be simplified. It then follows that the results in two different papers on Goursat problems are compatible when specialized to formally identical cases. Entrata in Redazione il 17 ottobre 1968.     

Uniqueness theorem for locally antipodal Delaunay sets

We prove theorems on locally antipodal Delaunay sets. The main result is the proof of a uniqueness theorem for locally antipodal Delaunay sets with a given 2R-cluster. This theorem implies, in particular, a new proof of a theorem stating that a locally antipodal Delaunay set all of whose 2R-clusters are equivalent is a regular system, i.e., a Delaunay set on which a crystallographic group acts transitively.     

Donsker classes of sets

Summary We study the central limit theorem (CLT) and the law of large numbers (LLN) for empirical processes indexed by a (countable) class of sets C. The main result, of purely measure-theoretical nature, relates different ways to measure the size of C. It relies on a new rearrangement inequality that has been inspired by techniques used in the local theory of Banach spaces. As an application, we give sharp necessary conditions for the CLT, that are in some sense the best possible. We also obtain a way to compute the rate of convergence in the LLN.     

Labelling classes by sets

Let Q be an equivalence relation whose equivalence classes, denoted Q[x], may be proper classes. A function L defined on Field(Q) is a labelling for Q if and only if for all x,L(x) is a set andL is a labelling by subsets for Q if and only ifBG denotes Bernays-Gödel class-set theory with neither the axiom of foundation, AF, nor the class axiom of choice, E. The following are relatively consistent with BG. (1) E is true but there is an equivalence relation with no labelling.(2) E is true and every equivalence relation has a labelling, but there is an equivalence relation with no labelling by subsets.This research was partially supported by Fondecyt 1980855 and by Fondecyt 1040846     

Embedding theorems for classes of convex sets

Rådström's embedding theorem states that the nonempty compact convex subsets of a normed vector space can be identified with points of another normed vector space such that the embedding map is additive, positively homogeneous, and isometric. In the present paper, extensions of Rådström's embedding theorem are proven which provide additional information on the embedding space. These results include those of Hörmander who proved a similar embedding theorem for the nonempty closed bounded convex subsets of a Hausdorff locally convex vector space. In contrast to Hörmander's approach via support functionals, all embedding theorems of the present paper are proven by a refinement of Rådström's original method which is constructive and does not rely on Zorn's lemma. This paper also includes a brief discussion of some actual or potential applications of embedding theorems for classes of convex sets in probability theory, mathematical economics, interval mathematics, and related areas.     

Crisp sets as classes of discontinuous fuzzy sets

This paper aims to show how, by using a threshold-based approach, a path from imprecise information to a crisp ‘decision’ can be developed. It deals with the problem of the logical transformation of a fuzzy set into a crisp set. Such threshold arises from the ideas of contradiction and separation, and allows us to prove that crisp sets can be structurally considered as classes of discontinuous fuzzy sets. It is also shown that continuous fuzzy sets are computationally indistinguishable from some kind of discontinuous fuzzy sets.     

Uniqueness of maximum planar five-distance sets

A subset X in the Euclidean plane is called a k-distance set if there are exactly k distances between two distinct points in X. We denote the largest possible cardinality of k-distance sets by g(k). Erdős and Fishburn proved that g(5)=12 and also conjectured that 12-point five-distance sets are unique up to similar transformations. We classify 8-point four-distance sets and prove the uniqueness of the 12-point five-distance sets given in their paper. We also introduce diameter graphs of planar sets and characterize these graphs.     

Well-posedness of the cauchy problem in gevrey classes for some weakly hyperbolic equations of higher order

This article is devoted to the study of the Cauchy problem in Gevrey classes for some higher order weakly hyperbolic equations with time-dependent coefficients and without lower order terms.     

Regular sets in residual classes

Sets regular modulo a fixed odd prime power are explicitly constructed under the condition that their cardinalities do not exceed an arbitrarily small positive power of the modulus.Translated fromMatematicheskie Zametki, Vol. 64, No. 2, pp. 224–228, August, 1998.This research was supported by the Russian Foundation for Basic Research under grant No. 97-01-00721 and by the Professor B. Novak grant (Karlov University, Prague).     

Determinative sets of points for classes of integral functions

Mathematische Zeitschrift -