Cerami (C) Condition and Mountain Pass Theorem for Multivalued Mappings

Partially supported by Sapientia Foundation.

Analytic Renormings of C(K) Spaces

The aim of our present note is to show the strength of the existence of an equivalent analytic renorming of a Banach space, even compared to C∞-Fréchet smooth renormings. It was Haydon who first showed in [8] that C(K) spaces for K countable admit an equivalent C∞-Fréchet smooth norm. Later, in [7] and [9] he introduced a large clams of tree-like (uncountable) compacts K for which C(K) admits an equivalent C∞-Fréchet smooth norm. Recently, it was shown in [3] that C(K) spaces for K countable admit an equivalent analytic norm. Our Theorem 1 shows that in the class of C(K) spaces this result is the best possible.

Quadratic Mean Radius of a Polynomial in C(Z)

* Dedicated to the memory of Prof. N. Obreshkoff

Development of Educational Ontology for C-Programming

Development of educational ontologies is a step towards creation of sharable and reusable adaptive educational systems. Ontology as a conceptual courseware structure may work as a mind tool for effective teaching and as a visual navigation interface to the learning objects. The paper discusses an approach to the practical ontology development and presents the designed ontology for teaching/learning C programming.

Commutants of the Dunkl Operators in C(R)

2000 Mathematics Subject Classification: 44A35; 42A75; 47A16, 47L10, 47L80

Система от базови задачи за изучаване на събитийно програмиране чрез средата Visual C# в средното училище

Доклад, поместен в сборника на Националната конференция "Образованието в информационното общество", Пловдив, май, 2010 г.

Реализиране на стандартни Windows приложения, съдържащи менюта чрез средата Visual C# при изучаване на събитийно програмиране в средното училище

Доклад, поместен в сборника на Националната конференция "Образованието в информационното общество", Пловдив, май, 2011 г.

Extension of the C-XSC Library with Scalar Products with Selectable Accuracy

The C++ class library C-XSC for scientific computing has been extended with the possibility to compute scalar products with selectable accuracy in version 2.3.0. In previous versions, scalar products have always been computed exactly with the help of the so-called long accumulator. Additionally, optimized floating point computation of matrix and vector operations using BLAS-routines are added in C-XSC version 2.4.0. In this article the algorithms used and their implementations, as well as some potential pitfalls in the compilation, are described in more detail. Additionally, the theoretical background of the employed DotK algorithm and the necessary modifications of the concrete implementation in C-XSC are briefly explained. Run-time tests and numerical examples are presented as well.

Sufficient Second Order Optimality Conditions for C^1 Multiobjective Optimization Problems

2000 Mathematics Subject Classification: Primary 90C29; Secondary 90C30.

Optimality Conditions for D.C. Vector Optimization Problems under D.C. Constraints

2000 Mathematics Subject Classification: Primary 90C29; Secondary 49K30.