集合概念的扩张与完善

从集合概念的内涵出发,剖析了单值集——Cantor集合、Fuzzy集合、Rough集合、可拓集合概念的内涵;剖析了复值集——Grey集合、未确知集合、Vague集合、泛灰(UG)集合和广义泛灰(GUG)集合的内涵;从而得出广义泛灰集合是内涵最深的集合概念;它具有极强的描述能力,可以描述客观存在的一切现象,故又是外延最广的集合概念.     

Sparse and slender subsets of monoids

We generalize the notions of sparse and slender sets for an arbitrary monoid and characterize the unambiguous rational sets which are sparse or slender.     

On the unique representation of families of sets

Let and be uncountable Polish spaces. represents a family of sets provided each set in occurs as an -section of . We say that uniquely represents provided each set in occurs exactly once as an -section of . is universal for if every -section of is in . is uniquely universal for if it is universal and uniquely represents . We show that there is a Borel set in which uniquely represents the translates of if and only if there is a Vitali set. Assuming there is a Borel set with all sections sets and all non-empty sets are uniquely represented by . Assuming there is a Borel set with all sections which uniquely represents the countable subsets of . There is an analytic set in with all sections which represents all the subsets of , but no Borel set can uniquely represent the sets. This last theorem is generalized to higher Borel classes.

     

Random intersections of thick Cantor sets

Let , be Cantor sets embedded in the real line, and let , be their respective thicknesses. If , then it is well known that the difference set is a disjoint union of closed intervals. B. Williams showed that for some , it may be that is as small as a single point. However, the author previously showed that generically, the other extreme is true; contains a Cantor set for all in a generic subset of . This paper shows that small intersections of thick Cantor sets are also rare in the sense of Lebesgue measure; if , then contains a Cantor set for almost all in .

     

流的Ω-极限集

本文讨论流的Ω－极限集的性质,推广了ＣｏｎｌｅｙＣ。在文［１］中的一些结果。     

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.     

Exponential number of inequivalent difference sets in ℤ

Kantor [ 5 ] proved an exponential lower bound on the number of pairwise inequivalent difference sets in the elementary abelian group of order 2^2s+2. Dillon [ 3 ] generalized a technique of McFarland [ 6 ] to provide a framework for determining the number of inequivalent difference sets in 2‐groups with a large elementary abelian direct factor. In this paper, we consider the opposite end of the spectrum, the rank 2 group ? , and compute an exponential lower bound on the number of pairwise inequivalent difference sets in this group. In the process, we demonstrate that Dillon difference sets in groups ? can be constructed via the recursive construction from [ 2 ] and we show that there are exponentially many pairwise inequivalent difference sets that are inequivalent to any Dillon difference set. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 249–259, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10046     

Maximal transitive sets with singularities for genericC 1 vector fields

A transitive set of a vector fieldX ismaximal transitive if it contains every transitive set ofX intersecting it. We shall prove that ifX isC ¹ generic then every singularity ofX with either only one positive or only one negative eigenvalue belongs to a maximal transitive set ofX. In particular, we characterize maximal transitive sets with singularities for genericC ¹ vector fields on closed 3-manifolds in terms of homoclinic classes associated to a unique singularity. We apply our results to the examples introduced in [3] and [15].This work is partially supported by CNPq 001/2000, FAPERJ and PRONEX/Dynamical Systems, FINEP-CNPq.     

Location-domination in line graphs

A set $D$ of vertices of a graph $G$ is locating if every two distinct vertices outside $D$ have distinct neighbors in $D$; that is, for distinct vertices $u$ and $v$ outside $D$, $N\left(u\right)\cap D\ne N\left(v\right)\cap D$, where $N\left(u\right)$ denotes the open neighborhood of $u$. If $D$ is also a dominating set (total dominating set), it is called a locating-dominating set (respectively, locating-total dominating set) of $G$. A graph $G$ is twin-free if every two distinct vertices of $G$ have distinct open and closed neighborhoods. It is conjectured (Garijo et al., 2014 [15]) and (Foucaud and Henning, 2016 [12]) respectively, that any twin-free graph $G$ without isolated vertices has a locating-dominating set of size at most one-half its order and a locating-total dominating set of size at most two-thirds its order. In this paper, we prove these two conjectures for the class of line graphs. Both bounds are tight for this class, in the sense that there are infinitely many connected line graphs for which equality holds in the bounds.     

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.

     

截集形式的模糊粗糙集及其性质

用模糊集的截集构造了模糊集的粗糙集,给出了模糊粗糙集的更加严格的数学定义,证明了与文[1]中的等价性,并用新的定义给出模糊粗糙集的相应性质.     

The limit functions of a random iteration system

This paper discusses the limit functions of a random iteration system formed by finitely many rational functions. Applying these results we prove that a hyperbolic iteration system has no wandering domain and that its limit functions are constant. Finally the continuity on its Julia set is considered.     

Generalized subdifferential of the distance function

We derive the proximal normal formula for almost proximinal sets in a smooth and locally uniformly convex Banach space. Our technique leads us to show the generic Fréchet smoothness of the distance function in the case the norm is Fréchet smooth, and we derive a necessary and sufficient condition for the convexity of a Chebyshev set in a Banach space with norms on and locally uniformly convex.

     

Indivisible plexes in latin squares

In this paper, we present two constructions of divisible difference sets based on skew Hadamard difference sets. A special class of Hadamard difference sets, which can be derived from a skew Hadamard difference set and a Paley type regular partial difference set respectively in two groups of orders v ₁ and v ₂ with |v ₁ − v ₂| = 2, is contained in these constructions. Some result on inequivalence of skew Hadamard difference sets is also given in the paper. As a consequence of Delsarte’s theorem, the dual set of skew Hadamard difference set is also a skew Hadamard difference set in an abelian group. We show that there are seven pairwisely inequivalent skew Hadamard difference sets in the elementary abelian group of order 3⁵ or 3⁷, and also at least four pairwisely inequivalent skew Hadamard difference sets in the elementary abelian group of order 3⁹. Furthermore, the skew Hadamard difference sets deduced by Ree-Tits slice symplectic spreads are the dual sets of each other when q ≤ 3¹¹.      

The multi-fuzzy soft set and its application in decision making

Molodtsov’s soft set theory was originally proposed as a general mathematical tool for dealing with uncertainty. By combining the multi-fuzzy set and soft set models, the purpose of this paper is to introduce the concept of multi-fuzzy soft sets. Some operations on a multi-fuzzy soft set are defined, such as complement operation, “AND” and “OR” operations, Union and Intersection operations. Then, the DeMorgan’s laws are proved. Finally, by means of level soft set, an algorithm is presented, and a decision problem is analyzed using multi-fuzzy soft set.     

Adjacent and tangent regularity

In this paper we define regularity for general adjacency and tangency concepts and we study it in some particular cases. Most of the convex but sophisticated approximations used in optimization theory can be disconvexified using the regularity notion and their adjacent or tangent structure can be perceived looking at them under the regularity angle.