In this paper, we obtain an explicit formula for the number of zero-sum k-element subsets in any finite abelian group.

The various forms of psoriasis demonstrate multidirectional changes of the expression of markers of lymphocyte positive and negative activation. Study of activation markers allow identifying different lymphocyte subpopulations, establishing their role in development and progressing of psoriasis as they characterize connected with cellular cycle processes of activation (CD25) and apoptosis (CD95...

In this paper, the new concept of near PS-compactness in L-topological spaces is introduced. It is defined for any L-subset. Its characterizations and topological properties are systematically studied. And the relationship is exposed between near PScompactness and PS-compactness, and also fuzzy compactness. 2003 Elsevier Inc. All rights reserved.

Let A be a nite set of integers. For h 1, let S h (A) denote the set of all sums of h distinct elements of A. Let S(A) denote the set of all nonempty sums of distinct elements of A. The direct problem for subset sums is to nd lower bounds for jS h (A)j and jS(A)j in terms of jAj. The inverse problem for subset sums is to determine the structure of the extremal sets A of integers for which jS h ...

This paper focuses on the relationship between an $L$-subset and the system of level-elements induced by it, where the underlying lattice $L$ is a complete residuated lattice and the domain set of $L$-subset is an $L$-partially ordered set $(X,P)$. Firstly, we obtain the sufficient and necessary condition that an $L$-subset is represented by its system of level-elements. Then, a new representat...

let g be a group. a subset x of g is a set of pairwise noncommuting elements if xy ̸= yx for any two distinct elements x and y in x. if |x| ≥ |y | for any other set of pairwise non-commuting elements y in g, then x is said to be a maximal subset of pairwise non-commuting elements. in this paper we determine the cardinality of a maximal subset of pairwise non-commuting elements in any non-abelian...

In this article, by Partitioning of designing space, optimization speed is tried to be increased by GA. To this end, designing space search is done in two steps which are global search and local search. To achieve this goal, according to meshing in FEM, firstly, the list of sections is divided to specific subsets. Then, intermediate member of each subset, as representative of subset, is defined...