Exponents of Subvarieties of Upper Triangular Matrices over Arbitrary Fields are Integral

Partially supported by grant RFFI 98-01-01020.

Duality in Constrained DC-Optimization via Toland’s Duality Approach

2000 Mathematics Subject Classification: 90C48, 49N15, 90C25

Discover the Thracians - An Approach for Use of 2D and 3D Technologies for Digitization of Cultural Heritage in the Field of E-learning

Information and communication technologies (ICT) offer an easier access to and a multi-perspective view of cultural heritage artifacts and may also enrich and improve cultural heritage education through the adoption of innovative learning/teaching methods. This paper examines the different practices and opportunities for digitization of cultural artifacts with historical significance and describes the work on a pilot project concerning the development of e-learning materials in the Thracian cultural and historical heritage. The proposed method presents an approach based on a combination of 2D and 3D technologies to facilitate the overall process of digitization of individual objects. This approach not only provides greater opportunities for presenting the Thracian heritage but also new perspectives for studying it - students, scientists, PhD students will have the opportunity to work with the materials without having access to them.

The Maximal Number of Particles in a Branching Process with State-Dependent Immigration

AMS subject classification: 60J80, 60J15.

On the Time Complexity of the Problem Related to Reducts of Consistent Decision Tables

In recent years, rough set approach computing issues concerning reducts of decision tables have attracted the attention of many researchers. In this paper, we present the time complexity of an algorithm computing reducts of decision tables by relational database approach. Let DS = (U, C ∪ {d}) be a consistent decision table, we say that A ⊆ C is a relative reduct of DS if A contains a reduct of DS. Let s = be a relation schema on the attribute set C ∪ {d}, we say that A ⊆ C is a relative minimal set of the attribute d if A contains a minimal set of d. Let Qd be the family of all relative reducts of DS, and Pd be the family of all relative minimal sets of the attribute d on s. We prove that the problem whether Qd ⊆ Pd is co-NP-complete. However, the problem whether Pd ⊆ Qd is in P .