Characterizations of strictly convex sets by the uniqueness of support points

Abstract

This short paper characterizes strictly convex sets by the uniqueness of support points (such points are called unique support points or exposed points) under appropriate assumptions. A class of so-called regular sets, for which every extreme point is a unique support point, is introduced. Closed strictly convex sets and their intersections with some other sets are shown to belong to this class. The obtained characterizations are then applied to set-valued maps and to the separation of a convex set and a strictly convex set. Under suitable assumptions, so-called set-valued maps with path property are characterized by strictly convex images of the considered set-valued map.     

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.     

Simploidals sets: Definitions, operations and comparison with simplicial sets

The combinatorial structure of simploidal sets generalizes both simplicial complexes and cubical complexes. More precisely, cells of simploidal sets are cartesian product of simplices. This structure can be useful for geometric modeling (e.g. for handling hybrid meshes) or image analysis (e.g. for computing topological properties of parts of n-dimensional images). In this paper, definitions and basic constructions are detailed. The homology of simploidal sets is defined and it is shown to be equivalent to the classical homology. It is also shown that products of Bézier simplicial patches are well suited for the embedding of simploidal sets.     

Coloring by two-way independent sets

The paper stems from an attempt to investigate a somewhat mysterious phenomenon: conditions which suffice for the existence of a “large” set satisfying certain conditions (e.g., a large independent set in a graph) often suffice (or at least are conjectured to suffice) for the existence of a covering of the ground set by few sets satisfying these conditions (in the example of independent sets in a graph this means that the graph has small chromatic number). We consider two conjectures of this type, on coloring by sets which are “two-way independent”, in the sense of belonging to a matroid and at the same time being independent in a graph sharing its ground set with the matroid. We prove these conjectures for matroids of rank 2. We also consider dual conjectures, on packing bases of a matroid, which are independent in a given graph.     

Total variation and Cheeger sets in Gauss space

The aim of this paper is to study the isoperimetric problem with fixed volume inside convex sets and other related geometric variational problems in the Gauss space, in both the finite and infinite dimensional case. We first study the finite dimensional case, proving the existence of a maximal Cheeger set which is convex inside any bounded convex set. We also prove the uniqueness and convexity of solutions of the isoperimetric problem with fixed volume inside any convex set. Then we extend these results in the context of the abstract Wiener space, and for that we study the total variation denoising problem in this context.     

Zero sets and interpolating sets in Fock spaces

An example is constructed to show that interpolating sets for Fock spaces are not necessarily zero sets.

     

A class of sets of uniqueness for multiple Walsh series

The uniqueness problem for multiple series over orthogonal systems of functions is considered. Classes of sets of uniqueness for multiple Walsh series and for multiple series over a mixed system of functions are obtained, which extends known classes of sets of uniqueness. A many-dimensional analogue of Privalov’s theorem is established.     

The necessary and sufficient conditions for various self-similar sets and their dimension

We have given several necessary and sufficient conditions for statistically self-similar sets and a.s. self-similar sets and have got the Hausdorff dimension and exact Hausdorff measure function of any a.s. self-similar set in this paper. It is useful in the study of probability properties and fractal properties and structure of statistically recursive sets.     

Codebooks from almost difference sets

In direct spread CDMA systems, codebooks meeting the Welch bounds are used to distinguish among the signals of different users. Recently, constructions of codebooks with difference sets meeting Welch’s bound on the maximum cross-correlation amplitude were developed. In this paper, a generic construction of codebooks using almost difference sets is considered and several classes of codebooks nearly meeting the Welch bound are obtained. The parameters of the codebooks constructed in this paper are new.      

Maps of Borel sets

Questions concerning the structure of Borel sets were raised in special cases by Luzin, Aleksandrov, and Uryson as the problems of distinguishing the sets with certain homogeneous properties in Borel classes and determining the number of such pairwise nonhomemorphic sets. The universal homogeneity, i.e., the property to contain an everywhere closed copy of any Borel set of the same or smaller class, was considered by L.V. Keldysh. She called the sets of classes Π _α ⁰ , α > 2, of first category in themselves that possess this homogeneity property canonical and proved their uniqueness. Thus she revealed the central role of the universality property when describing homeomorphic Borel sets. These investigations led her to the problem of universality of Borel sets and to the problem of finding conditions under which there exists an open map between Borel sets. In this paper, such conditions are presented and similar questions are considered for closed, compact-covering, harmonious, and other stable maps.     

A family of permitted trigonometric thin sets

We introduce the notion of perfectly measure zero sets and prove that every perfectly measure zero set is permitted for the families of all pseudo-Dirichlet sets, N-sets, A-sets and N-sets. In particular this means that these families of trigonometric thin sets are closed under adding sets of cardinality less than the additivity of Lebesgue measure.

     

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.     

On uniqueness sets for multiple Walsh series

We study uniqueness sets for multiple Walsh series under ρ-regular (or bounded) convergence in rectangles. We prove that a countable set is a uniqueness set for such a series under this convergence. We construct a class of perfect uniqueness sets for multiple Walsh series under this convergence. We show that the notion of index of a perfect set does not solve the problem of whether this set belongs to the class of uniqueness sets. We note that the results of this paper remain valid for several rearranged multiple Walsh series.     

A class of uniqueness sets for double Walsh series

A problem of uniqueness for multiple Walsh series is considered. A class of uniqueness sets for double Walsh series is obtained, this class contains known classes of uniqueness sets.     

A note on the growth of topological Sidon sets

We give an estimate for the number of elements in the intersection of topological Sidon sets inR ⁿ with compact convex subsets and deduce a necessary and sufficient conditions for an orbit of a linear transformation ofR ⁿ to be a topological Sidon set.     

预不变凸模糊集的一些性质

在下半连续的条件下,给出了一个模糊集是预不变凸模糊集的充分条件,并将模糊凸集上相关性质在模糊不变凸集上作了相应的推广.所给出的条件和证明都是新的.     

Special subsets of difference sets with particular emphasis on skew Hadamard difference sets

This article introduces a new approach to studying difference sets via their additive properties. We introduce the concept of special subsets, which are interesting combinatorial objects in their own right, but also provide a mechanism for measuring additive regularity. Skew Hadamard difference sets are given special attention, and the structure of their special subsets leads to several results on multipliers, including a categorisation of the full multiplier group of an abelian skew Hadamard difference set. We also count the number of ways to write elements as a product of any number of elements of a skew Hadamard difference set.      

Exclusive and essential sets of implicates of Boolean functions

In this paper we study relationships between CNF representations of a given Boolean function f and certain sets of implicates of f. We introduce two definitions of sets of implicates which are both based on the properties of resolution. The first type of sets, called exclusive sets of implicates, is shown to have a functional property useful for decompositions. The second type of sets, called essential sets of implicates, is proved to possess an orthogonality property, which implies that every CNF representation and every essential set must intersect. The latter property then leads to an interesting question, to which we give an affirmative answer for some special subclasses of Horn Boolean functions.     

Sub-topical functions and plus-co-radiant sets

In this paper, we study sub-topical functions in the framework of abstract convexity and examine the relevant properties such as support sets, polar sets and sub-differentials for these functions. Plus-radiant and plus-co-radiant sets, and their relations with sub-topical functions are studied. Applying sub-topical functions, we present some separation theorems for both plus-radiant and plus-co-radiant sets.     

The element sets and value sets of two-dimensional continued fractions

For two-dimensional continued fractions we prove the existence and uniqueness of an optimal sequence of value sets corresponding to an arbitrarily given sequence of element sets. We compute the element set for a given sequence of disk value sets and as a corollary, give the element sets and value sets that are used in convergence criteria for two-dimensional continued fractions. Translated fromMatematichni Metodi ta Fiziko-Mekhanichni Polya, Vol. 39, No. 2, 1996, pp. 55–61.