مشخصات پژوهش

عنوان	An iterative algorithm to find maximum spanning sets and minimum linearly independent sets which partition a finite generator
نوع پژوهش	مقاله چاپ شده
کلیدواژه‌ها	Generator, Spanning set, Linearly independent set, Rado-Horn theorem.
چکیده	Motivated by existence problems of the maximum number of spanning sets (MS) and the minimum number of Linearly independent sets (ML) which partition a generator in a nite dimensional vector space, we introduce a real time iterative algorithm with polynomial complexity. The algorithm starts with an arbitrary partition and improves it to obtain the nal partition. In addition this algorithm gives the conclusion of the Rado-Horn theorem, and facilitates using of this theorem.
پژوهشگران	داود فرازمنش (نفر اول)، عباس عسگری (نفر سوم)، علی توکلی (نفر دوم)