On subsets contained in a family of non-commensurable subsets of a finite set
نویسندگان
چکیده
منابع مشابه
rational subsets of finite groups
we characterize the rational subsets of a finite group and discuss the relations to integral cayley graphs.
متن کاملGenerating all subsets of a finite set with disjoint unions
If X is an n-element set, we call a family G ⊂ PX a k-generator for X if every x ⊂ X can be expressed as a union of at most k disjoint sets in G. Frein, Lévêque and Sebő [10] conjectured that for n > 2k, the smallest k-generators for X are obtained by taking a partition of X into classes of sizes as equal as possible, and taking the union of the power-sets of the classes. We prove this conjectu...
متن کاملMaximal subsets of pairwise non-commuting elements of some finite p-groups
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...
متن کاملOn Filling Families of Finite Subsets of the Cantor Set
Let ε > 0 and F be a family of finite subsets of the Cantor set C. Following D. H. Fremlin, we say that F is ε-filling over C if F is hereditary and for every F ⊆ C finite there exists G ⊆ F such that G ∈ F and |G| ≥ ε|F |. We show that if F is ε-filling over C and C-measurable in [C], then for every P ⊆ C perfect there exists Q ⊆ P perfect with [Q] ⊆ F . A similar result for weaker versions of...
متن کاملWell-dispersed subsets of non-dominated solutions for MOMILP problem
This paper uses the weighted L$_1-$norm to propose an algorithm for finding a well-dispersed subset of non-dominated solutions of multiple objective mixed integer linear programming problem. When all variables are integer it finds the whole set of efficient solutions. In each iteration of the proposed method only a mixed integer linear programming problem is solved and its optimal solutions gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory
سال: 1969
ISSN: 0021-9800
DOI: 10.1016/s0021-9800(69)80053-0