On generalized cluster sets of functions and multifunctions

This paper introduces and studies generalized cluster sets (g-cluster sets) of functions and multifunctions on GTS, which unifies the existing notions of cluster sets, θ-cluster sets, δ-cluster sets, S-cluster sets, s-cluster sets, p-cluster sets and many more. Several properties of the functions and multifunctions as well as their range and domain spaces are observed via degeneracies of their g-cluster sets. Characterizations of g-cluster sets through filterbases and grills on a typical class of GTS’s are also obtained. Moreover, μ-compactness of a GTS is characterized through g-cluster sets of multifunctions.     

Distances realized by sets covering the plane

A proof is given of the (known) result that, if real n-dimensional Euclidean space Rⁿ is covered by any n + 1 sets, then at least one of these sets is such that each distance d(0 < d < ∞) is realized as the distance between two points of the set. In particular, this result holds if the plane is covered by three sets; but it does not necessarily hold if the plane is covered by six sets. If each set in a covering of the plane fails to realize the same distance d, say d = 1, and if the sets are either closed or simultaneously divisible into region (in a sense to be made precise), then at least six sets are needed and seven suffice, and the number of closed sets needed is at least as great as the number simultaneously divisible into regions.     

Algebraic aspects of generalized approximation spaces

The concept of approximation spaces is a key notion of rough set theory, which is an important tool for approximate reasoning about data. This paper concerns algebraic aspects of generalized approximation spaces. Concepts of R-open sets, R-closed sets and regular sets of a generalized approximation space (U,R) are introduced. Algebraic structures of various families of subsets of (U,R) under the set-inclusion order are investigated. Main results are: (1) The family of all R-open sets (respectively, R-closed sets, R-clopen sets) is both a completely distributive lattice and an algebraic lattice, and in addition a complete Boolean algebra if relation R is symmetric. (2) The family of definable sets is both an algebraic completely distributive lattice and a complete Boolean algebra if relation R is serial. (3) The collection of upper (respectively, lower) approximation sets is a completely distributive lattice if and only if the involved relation is regular. (4) The family of regular sets is a complete Boolean algebra if the involved relation is serial and transitive.     

On linear sets on a projective line

Linear sets generalise the concept of subgeometries in a projective space. They have many applications in finite geometry. In this paper we address two problems for linear sets: the equivalence problem and the intersection problem. We consider linear sets as quotient geometries and determine the exact conditions for two linear sets to be equivalent. This is then used to determine in which cases all linear sets of rank 3 of the same size on a projective line are (projectively) equivalent. In (Donati and Durante, Des Codes Cryptogr, 46:261–267), the intersection problem for subgeometries of PG(n, q) is solved. The intersection of linear sets is much more difficult. We determine the intersection of a subline PG(1, q) with a linear set in PG(1, q ^h ) and investigate the existence of irregular sublines, contained in a linear set. We also derive an upper bound, which is sharp for odd q, on the size of the intersection of two different linear sets of rank 3 in PG(1, q ^h ).     

Dimensions of strong n-point sets

n-point sets (plane sets which hit each line in n points) and strong n-point sets (in addition hit each circle in n-points) exist (for n?2, n?3 respectively) by transfinite induction, but their properties otherwise are difficult to establish. Recently for n-point sets the question of their possible dimensions has been settled: 2- and 3-point sets are always zero-dimensional, while for n?4, one-dimensional n-point sets exist. We settle the same question for strong n-point sets: strong 4- and 5-point sets are always zero-dimensional, while for n?6, both zero-dimensional and one-dimensional strong n-point sets exist.     

Unconditionally τ-closed and τ-algebraic sets in groups

Families of unconditionally τ-closed and τ-algebraic sets in a group are defined, which are natural generalizations of unconditionally closed and algebraic sets defined by Markov. A sufficient condition for the coincidence of these families is found. In particular, it is proved that these families coincide in any group of cardinality at most τ. This result generalizes both Markov's theorem on the coincidence of unconditionally closed and algebraic sets in a countable group (as is known, they may be different in an uncountable group) and Podewski's theorem on the topologizability of any ungebunden group.     

Balanced sets and circuits in a transversal space

The study of fully dependent sets (unions of circuits) has played a part in characterizing transversal spaces. In fact, the fully dependent sets satisfy |Δ(F)| = ?(F) in any deltoid representation, and it is with a consideration of this property that we begin the present paper. We study “balanced” sets and from our results draw conclusions about fully dependent sets and circuits in a transversal space. These include upper bounds for the number of circuits, and the result that a non-trivial transversal space can be neither a hereditary circuit space nor the dual of a geometric hereditary circuit space. The paper is reasonably self-contained; all unusual terms are defined as they are encountered.     

A new method for solving differential equations with vague parameters

In the literature, it is pointed out that it is better to use vague sets instead of fuzzy sets. Several authors have proposed different methods for solving such differential equations in which all the parameters are represented by fuzzy numbers but to the best of our knowledge till now no one have represented the same as vague sets. In this paper, a new representation of (α, β)-cut, named as JMD (α, β)-cut, is proposed and with the help of JMD (α, β)-cut a new method is proposed to find the analytical solution of vague differential equations. To show the application of proposed method in real life problems the vague Kolmogorov’s differential equations, obtained by using vague Markov model of piston manufacturing system, are solved by proposed method. Also, to show the advantage of JMD (α, β)-cut over existing (α, β)-cut the same vague Kolmogorov’s differential equations are solved by using the proposed method with the help of existing (α, β)-cut and it is shown that the obtained results are not necessarily vague sets while the results, obtained by using JMD (α, β)-cut, are always vague sets.     

On negative limit sets for one-dimensional dynamics

In this paper we study the structure of negative limit sets of maps on the unit interval. We prove that every α-limit set is an ω-limit set, while the converse is not true in general. Surprisingly, it may happen that the space of all α-limit sets of interval maps is not closed in the Hausdorff metric (and thus some ω-limit sets are never obtained as α-limit sets). Moreover, we prove that the set of all recurrent points is closed if and only if the space of all α-limit sets is closed.     

p-Sidon sets

Let G be a compact Abelian group with character group X. Bo?ejko and Pytlik [Colloq. Math.25 (1972), 117–124] introduced and studied several special types of lacunary subsets of X. This paper is based upon a hitherto unpublished detailed study of those types that most resemble Sidon sets, which the present authors had independently introduced and studied under the name of p-Sidon sets. Some, but not all, aspects of the theory of Sidon (= 1-Sidon) sets carry over to the more general setting. In Section 1 some properties of sets equivalent to p-Sidonicity are given. Section 2 contains several useful consequences of p-Sidonicity; see Theorems 2.1 and 2.4 and Corollaries 2.6 and 2.7. In Section 3, it is shown that certain Λ_q sets also satisfy some of the consequences listed in Section 2. Nevertheless, Λ_q sets need not be p-Sidon sets; see Theorem 3.1. Examples of ($\text{4}\text{3}$)-Sidon sets that are not Sidon sets are given in Section 5. The proof that these sets are ($\text{4}\text{3}$)-Sidon sets requires a brief study of 4-norms in Varopoulos algebras; see Section 4. In Section 6, some special results for the circle group are deduced. Many of these results appear to be new even for p = 1.     

A class of threshold and domishold graphs: equistable and equidominating graphs

A threshold graph (respectively domishold graph) is a graph for which the independent sets (respectively the dominating sets) can be characterized by the 0, 1-solutions of a linear Inequality (see [1] and [3]).We define here the graphs for which the maximal independent sets (respectively the minimal dominating sets) are characterized by the 0, 1-solutions of a linear equation. Such graphs are said to be equistable (respectively equldominating).We characterize (by their architectural structure and by forbidden induced subgraphs) threshold graphs and domishold graphs which are equistable or equidominating.A larger class of equistable graphs is also presented.     

A unified theory of generalized closed sets in weak structures

A new kind of sets called generalized w-closed (briefly gw-closed) sets is introduced and studied in a topological space by using the concept of weak structures introduced by á.?Császár in?[6]. The class of all gw-closed sets is strictly larger than the class of all w-closed sets. Furthermore, g-closed sets (in the sense of N.?Levine?[17]) is a special type of gw-closed sets in a topological space. Some of their properties are investigated. Finally, some characterizations of w-regular and w-normal spaces have been given.     

Lower S-dimension of fractal sets

The interrelations between (upper and lower) Minkowski contents and (upper and lower) surface area based contents (S-contents) as well as between their associated dimensions have recently been investigated for general sets in Rd (cf. Rataj and Winter (in press) [6]). While the upper dimensions always coincide and the upper contents are bounded by each other, the bounds obtained in Rataj and Winter (in press) [6] suggest that there is much more flexibility for the lower contents and dimensions. We show that this is indeed the case. There are sets whose lower S-dimension is strictly smaller than their lower Minkowski dimension. More precisely, given two numbers s, m with 0<s<m<1, we construct sets F in Rd with lower S-dimension s+d−1 and lower Minkowski dimension m+d−1. In particular, these sets are used to demonstrate that the inequalities obtained in Rataj and Winter (in press) [6] regarding the general relation of these two dimensions are best possible.     

Inequalities for integral means over symmetric sets

We prove that the integral of n functions over a symmetric set L in Rn, with additional properties, increases when the functions are replaced by their symmetric decreasing rearrangements. The result is known when L is a centrally symmetric convex set, and our result extends it to nonconvex sets. We deduce as consequences, inequalities for the average of a function whose level sets are of the same type as L, over measurable sets in Rn. The average of such a function on E is maximized by the average over the symmetric set E^*.     

On a generalization of distance sets

A subset X in the d-dimensional Euclidean space is called a k-distance set if there are exactly k distinct distances between two distinct points in X and a subset X is called a locally k-distance set if for any point x in X, there are at most k distinct distances between x and other points in X.Delsarte, Goethals, and Seidel gave the Fisher type upper bound for the cardinalities of k-distance sets on a sphere in 1977. In the same way, we are able to give the same bound for locally k-distance sets on a sphere. In the first part of this paper, we prove that if X is a locally k-distance set attaining the Fisher type upper bound, then determining a weight function w, (X,w) is a tight weighted spherical 2k-design. This result implies that locally k-distance sets attaining the Fisher type upper bound are k-distance sets. In the second part, we give a new absolute bound for the cardinalities of k-distance sets on a sphere. This upper bound is useful for k-distance sets for which the linear programming bound is not applicable. In the third part, we discuss about locally two-distance sets in Euclidean spaces. We give an upper bound for the cardinalities of locally two-distance sets in Euclidean spaces. Moreover, we prove that the existence of a spherical two-distance set in (d−1)-space which attains the Fisher type upper bound is equivalent to the existence of a locally two-distance set but not a two-distance set in d-space with more than d(d+1)/2 points. We also classify optimal (largest possible) locally two-distance sets for dimensions less than eight. In addition, we determine the maximum cardinalities of locally two-distance sets on a sphere for dimensions less than forty.     

Almost disjoint large subsets of semigroups

There are several notions of largeness in a semigroup S that originated in topological dynamics. Among these are thick, central, syndetic and piecewise syndetic. Of these, central sets are especially interesting because they are partition regular and are guaranteed to contain substantial combinatorial structure. It is known that in (N,+) any central set may be partitioned into infinitely many pairwise disjoint central sets. We extend this result to a large class of semigroups (including (N,+)) by showing that if S is a semigroup in this class which has cardinality κ then any central set can be partitioned into κ many pairwise disjoint central sets. We also show that for this same class of semigroups, if there exists a collection of μ almost disjoint subsets of any member S, then any central subset of S contains a collection of μ almost disjoint central sets. The same statement applies if “central” is replaced by “thick”; and in the case that the semigroup is left cancellative, “central” may be replaced by “piecewise syndetic”. The situation with respect to syndetic sets is much more restrictive. For example, there does not exist an uncountable collection of almost disjoint syndetic subsets of N. We investigate the extent to which syndetic sets can be split into disjoint syndetic sets.     

On semidefinite representations of non-closed sets

Spectrahedra are sets defined by linear matrix inequalities. Projections of spectrahedra are called semidefinitely representable sets. Both kinds of sets are of practical use in polynomial optimization, since they occur as feasible sets in semidefinite programming. There are several recent results on the question which sets are semidefinitely representable. So far, all results focus on the case of closed sets.In this work we develop a new method to prove semidefinite representability of sets which are not closed. For example, the interior of a semidefinitely representable set is shown to be semidefinitely representable. More general, one can remove faces of a semidefinitely representable set and preserve semidefinite representability, as long as the faces are parametrized in a suitable way.     

Topological structure of solution sets for impulsive differential inclusions in Fréchet spaces

In this paper, we consider the existence of solutions as well as the topological and geometric structure of solution sets for first-order impulsive differential inclusions in some Fréchet spaces. Both the initial and terminal problems are considered. Using ingredients from topology and homology, the topological structures of solution sets (closedness and compactness) as well as some geometric properties (contractibility, acyclicity, AR and R_δ) are investigated. Some of our existence results are obtained via the method of taking the inverse system limit on noncompact intervals.     

Uniqueness of Polish group topology

We show the limits of Mackey's theorem applied to identity sets to prove that a given group has a unique Polish group topology.Verbal sets in Abelian Polish groups and full verbal sets in the infinite symmetric group are Borel. However this is not true in general.A Polish group with a neighborhood π-base at 1 of sets from the σ-algebra of identity and verbal sets has a unique Polish group topology. It follows that compact, connected, simple Lie groups, as well as finitely generated profinite groups, have a unique Polish group topology.     

Levels in the toposes of simplicial sets and cubical sets

The essential subtoposes of a fixed topos form a complete lattice, which gives rise to the notion of a level in a topos. In the familiar example of simplicial sets, levels coincide with dimensions and give rise to the usual notions of n-skeletal and n-coskeletal simplicial sets. In addition to the obvious ordering, the levels provide a stricter means of comparing the complexity of objects, which is determined by the answer to the following question posed by Bill Lawvere: when does n-skeletal imply k-coskeletal? This paper, which subsumes earlier unpublished work of some of the authors, answers this question for several toposes of interest to homotopy theory and higher category theory: simplicial sets, cubical sets, and reflexive globular sets. For the latter, n-skeletal implies (n+1)-coskeletal but for the other two examples the situation is considerably more complicated: n-skeletal implies (2n−1)-coskeletal for simplicial sets and 2n-coskeletal for cubical sets, but nothing stronger. In a discussion of further applications, we prove that n-skeletal cyclic sets are necessarily (2n+1)-coskeletal.