7-th International Conference on Discrete Mathematics and Applications (ICDMA7)

June 17-20, 2004, Bansko, Bulgaria South-West University, Blagoevgrad, Bulgaria University of Potsdam, Germany

Contents
Irena Atanassova . . . . . . . . . . . . . . . . Pavel Azalov, Daniela Tuparova . . . . . . . . Dimitar Birov . . . . . . . . . . . . . . . . . . Elena Bojadshieva . . . . . . . . . . . . . . . Adrijan V. Borisov . . . . . . . . . . . . . . . Kiril Chimev . . . . . . . . . . . . . . . . . . Svetoslav Christov . . . . . . . . . . . . . . . Ivo Damyanov . . . . . . . . . . . . . . . . . Klaus Denecke, S. L. Wismath . . . . . . . . Ilinka Dimitrova . . . . . . . . . . . . . . . . Ivan Ganchev Donev . . . . . . . . . . . . . . Ivan Georgiev, Svetozar Margenov . . . . . . Kazimierz Glazek . . . . . . . . . . . . . . . . Vassil Grozdanov . . . . . . . . . . . . . . . . Elena Karastranova . . . . . . . . . . . . . . . Maryana Katsarska . . . . . . . . . . . . . . . P. S. Kenderov . . . . . . . . . . . . . . . . . Nikolay Kirov, Mikhail Krastanov . . . . . . Jrg Koppitz . . . . . . . . . . . . . . . . . . o Rumen Kostadinov, P. Milanov, N. Pencheva, Dimiter Stoichkov Kovachev . . . . . . . . . . Krassimir Manev . . . . . . . . . . . . . . . . Smile Markovski, Danilo Gligoroski . . . . . . Nikolay Kitanov, Viktor Plotnikov . . . . . . Marija Mihova, Smile Markovski . . . . . . . Ivan Mirchev, Zoran Aleksov . . . . . . . . . Violeta Nikova . . . . . . . . . . . . . . . . . i . . . . . . . . . . . . . . . . . . . I. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Trenchev . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1 2 2 3 3 4 5 5 6 7 7 8 10 10 10 11 11 11 12 14 14 15 15 16 16 17

Julia Ninova . . . . . . . . . . . . . . Ketty Peeva, Yordan Kyosev . . . . D. Schweigert . . . . . . . . . . . . . Slavcho Shtrakov . . . . . . . . . . . Grozio Stanilov . . . . . . . . . . . . Stefka Tchincheva, Kostadin Lekov . Kalcho Todorov, Iliya Gyudzenov . . Margarita Todorova, Nina Siniagina Ivan Trenchev, Peter Milanov . . . . Ivan Trenchev, Miglena Trencheva . Georgi Tuparov . . . . . . . . . . . . Krasimir Yordzhev . . . . . . . . . .

. . . . . . . . . . . .

. . . . . . . . . . . .

. . . . . . . . . . . .

. . . . . . . . . . . .

. . . . . . . . . . . .

. . . . . . . . . . . .

. . . . . . . . . . . .

. . . . . . . . . . . .

. . . . . . . . . . . .

. . . . . . . . . . . .

. . . . . . . . . . . .

. . . . . . . . . . . .

. . . . . . . . . . . .

. . . . . . . . . . . .

. . . . . . . . . . . .

17 18 18 18 19 20 20 21 21 22 22 23

ii

How to prove the completeness of a new temporal logic - eRATL Irena Atanassova South-West University irenatm@aix.swu.bg This paper is a contribution to the area of modal and temporal logics. We extend linear discrete temporal logic with several modal operators. In that way we obtain a unranked tree-like structure. In our logic the new modal operators work both along the branches of a tree and along the children of a node. To prove the completeness theorem of enriched with abstractions of time linear discrete temporal logic eRATL we are going to use a method that involves building a canonical model. In the present paper, we are going to sketch the proof of the completeness theorem.

Discrete Math Module in CS Course: Basic Accents and Implementation Pavel Azalov, Daniela Tuparova Pennsylvania State University, Hazleton, USA azalov@hotmail.com South-West University, Blagoevgrad, Bulgaria, ddureva@aix.swu.bg The standard for inclusion of Computer Science in the high school was established in 2000. One of the fundamental theoretical modules is Discrete Mathematics, which consists of the basic notions and methods used in introductory college courses. The module, however, seems to be too complex, despite the fact that it is designed for the students with Computer Science concentration. The current paper has as an objective to summarize the characteristics of the Discrete Mathematics module, including the input and the experience from other countries. An alternative method for teaching the content is presented, which will help to overcome the problems related to the complexity of the matter. In addition, a respective approach for testing the knowledge of the students is described.

Overloading of Advices Dimitar Birov Soa University, FMI birov@fmi.uni-sofia.bg Aspect Oriented Programming propose Aspect as a tool for modularize concerns. Advices are parts of aspects which specify code, which will be executed at a specic points called jointpoints in the programs. A pointcut specication describes set of joinpoints. With each pointcut more then one advice wich have a similar signature but one and the same name could be conected. This phenomena is recognized as overloading. Actually overloading is a one of the branches of ad-hoc polymorphism. This way advices became a tool for introducing ad-hoc polymorphism in programs. This paper will discuss intermixing between aspectual polymorphism dened by advices and universal F-bounded polymorphism.

Forschung und Entwicklung im Blinkwinkel der EU-Erweiterung Elena Bojadshieva Sd-West-Universitat Neot Rilski elena bojadshieva@yahoo.de Im Jahre 2000 setzte der Europische Rat ein stratgisches Ziel hinsichtlich der weiteren wissenschaich-technischen Entwicklung der EU, bis 2010 soll die EU der wettbewerbsfhigsten und dynamischsten Wirtschaftsraum der Welt werden. Durch eine Steigerung der Forschungsausgaben auf 3Japan und den USA berwunden werden. Es wird analysiert, wie sich dieser Prozess im Kontext der EU-Erweiterung vollzieht und welchen Einuss auf ihn die Beitrittslnder ausben.

Measurability of sets of pairs of nonisotropic and isotropic straight lines in the Galilean plane Adrijan V. Borisov Dept. of Math., South-West University adribor@aix.swu.bg In the ane version the Galilean plane 2 is an ane plane with a special direction [3], [5]. The ane transformations leaving invariant the special direction form the group H5 of the general similitudes in 2 . We study the measurability in the sense of M. I. Stoka [4] and G. I. Drinfeld [2] of sets of pairs nonisotropic + isotropic straight line in 2 with respect to H5 and its subgroups [1]. Expressions for the corresponding invariant densities are also given. References [1] A. V. Borisov. On the subgroups of the similarity group in the Galilean plane. C. R. Acad. Bulg. Sci. 46, (1993), no. 5, 19-21. [2] G. I. Drinfeld. On the measure of the Lie groups. Zap. Mat. Otdel. Fiz. Mat. Fak. Kharkov. Mat. Obsc., 21, 1949, 47-57, (in Russian). [3] H. Sachs. Ebene Isotrope Geometrie. Vieweg , Braunschweig/Wiesbaden,1987. [4] M. I. Stoka. Geometrie Integral. Ed. Acad. RSR, Bucuresti, 1967. a [5] I. M. Yaglom. A Simple Non-Euclidean Geometry and its Physical Basic. Springer, Berlin, 1979.

Structural Properties of the Functions Kiril Chimev South-West University chimev@aix.swu.bg We discuss some structural properties of the functions with respect to their separable sets of variables. With Ess(f ) we denote the set of all essential variables for a function f . The set of all functions which depends essentially on n variables is denoted by F (n). A set M Ess(f ) is called separable for f if there are values ci1 , ci2 . . . , cis for the variables from the set Ess(f ) \ M = {xi1 , xi2 . . . , xis } such that the subfunction f (xi1 = ci1 , xi2 = ci2 . . . , xis = cis ) of f essentially depends on all variables in M. 3

The set of all non-empty separable sets for a function f is denoted by Sep(f ). Let f F (n). Unordered hypergraph with vertices the essential variables of f , and with edges the set of separable sets for f which contain exactly m elements is called hypergraph of f with respect to the separable mtuples. The hypergraph of f with respect to the separable mtuples is denoted by H(f, m). The hypergraph of a function f with respect to the separable pairs is also called graph of this function. We will discuss the results obtained as following theorems. Theorem 1. If f F (n), n 2 then for each m, 2 m n, the hypergraph H(f, m) is connected, and the distance between any two of its vertices is not greater than 2. Theorem 2. If the function f (x1 , . . . , xm , y1 , . . . , yn , z1 , . . . , zp , t1 , . . . , tq ) F (m + n + p + q) does not form separable pairs of types (xi , zk ) and (yj , tl ) then all the pairs of types (xi , yj ), (yj , zk ), (zk , tl ) and (xi , tl ) for 1 i m, 1 j n, 1 k p, and 1 l q are separable for f. Theorem 3. If f F (n), n 4 and (x1 , x2 ) Sep(f ), (x1 , x3 ) Sep(f ), / / and (x2 , x3 ) Sep(f ), then there exists a variable xi such that the pairs (xi , xj ) / are separable for each j = 1, 2, 3. Theorem 4. There does not exist a function f F (n), n 5 for which only the pairs (x1 , xi ) and (xn , xi ) i = 2, 3, . . . , n 1 are separable for f.

IPv6 Address Space Architecture and its eect on Dynamic Routing Structure Planing Svetoslav Christov South-West University, Blagoevgrad stc@phys.bas.bg The next generation of IP - IPv6 comes with completely new recomendations about how addresses will be allocated world wide. This rises several questions about how to plan and implement networks, running dynamic routing protocols. This report presents an overview of these problems and discuses some aspects of planing the usage of dynamic routing with IPv6.

From Structure to Behavior - Dening Declarative Language Grammars with XML Ivo Damyanov Department of Computer Sciences, South-West University damianov@aix.swu.bg Most of the modern technologies are mixture of well-known patterns applied in the right place. Since its introduction, the major players of the software industry adopted XML. As a result of evolution of markup languages, based on theoretical background of tree automata and regular grammar, XML become an important building stone for next generation computer systems. In the paper some applied aspects of XML technology are concerned. Major benets in development of loosely coupled code providing better separation of concerns, easiness of implementation of declarative languages and eective data extraction with schema-driven tools are discussed.

Normalizations of Clones Klaus Denecke, S. L. Wismath Universitat Potsdam kdenecke@rz.uni-potsdam.de The clone of a variety is a multi-based algebra whose universes are the sets of n-ary terms of the variety, for each n N \ {0}, and whose operations are the superpositions of terms. The clone of a variety carries much information about the variety. We consider the restriction to a type in which all operation symbols are n-ary, for some xed n, in which case the set of n-ary terms is the universe of a homogeneous or one-based algebra, using an n + 1-ary superposition operation. This algebra is a clone-like structure, and we call it the n-clone of the corresponding type with the dierence that the projection terms are not included a nullary operations, so that the type is (n + 1) rather than (n + 1, 0, . . . , 0). Such an algebra is called a Menger algebra of rank n. A complexity measuremant or valuation function assigns to each term of a xed type a natural number called its complexity. There are several ways to dene such a complexity measure. For any xed k 1, we consider the set of all terms which have complexity k or higher, with respect to a given complexity measure. Under the right assumptions on our complexity measure, this set of terms form 5

a subclone of the clone of all terms of a given type. The k-normalization of a variety V is the model class dened by the set of identities of V for which both terms in the identity have complexity at least k. In this paper we study the clone of the k-normalization variety of a given variety V . We also show that in some special cases the identities of these clones correspond to M -hyperidentities of the variety, for certain monoids M of hypersubstitutions.

On some classication of the maximal idempotent-generated subsemigroups of the semigroup of all isotone transformations Ilinka Dimitrova Bulgaria, Blagoevgrad 2700 South-West University Neot Rilski ilinkad@abv.bg In this paper we consider the nite set X(<) = {1 < 2 < < n} ordered in the usual way. We call the full transformation of X(<) isotone (order-preserving) if i j = i j. We denoted by On the semigroup of all isotone transformations of the nite set X = {1, . . . , n} under the operation of composition of transformations, by Jk = { On : |X| = k}, (1 k n 1) the Jk -class, and by Ik =
k i=1

Ji the ideal of the semigroup On .

We describe the maximal idempotent-generated subsemigroups of the Jn2 class and of the In2 ideal of the semigroup of all isotone transformations of the nite set X(<). In Jn2 each idempotent has a form: = j, j + 1 u m 1, m v or = m 2, m 1, m w ,

for u {j, j + 1}, v {m 1, m}, w {m 2, m 1, m}. In the connection of the main results we prove that each idempotent in Jn2 can be represented as a product of idempotents. The rst element in this product is an arbitrary idempotent of R -class, and the last element is a xed idempotent of L -class. We prove also that if E(Jk ), (1 k n 1) is the idempotent set of Jk -class, then

 Ik =

E(Jk )

Jk .

On the role and the place of discrete mathematics in school Mathematics course Ivan Ganchev Donev South-West Uniwersity ganchev@aix.swu.bg In the paper is drawn the attention on the fact, that during the last decades more and more convincingly domineers the idea, that with developing the problems of mathematics didactic is necessary to take into account perspicuously the structure of mathematical knowledge. It occurs that at forming this structure some elements of discrete mathematics play an important role. It is shown in the paper, that the main role has the concept set and related to it operations and relations, especially the concepts relation of equivalence and binary relation.

MIC(0) Preconditioning of Rotated Bilinear FEM Elliptic Systems Ivan Georgiev, Svetozar Margenov IPP-BAS,Acad. G. Bonchev Str., bl.25A john@parallel.bas.bg New results about preconditioning of non-conforming FEM systems in the case of mesh anisotropy are presented. This study is focused on the implementations of rotated bilinear elements, where algorithms [M P ] and [M V ] stand for the variants of the nodal basi functions corresponding to midpoint and integral mid-value interpolation operators.The model elliptic problem under consideration is associated with the bilinear form
2

ah (u, v) =
eh e

a(e)
i=1

uxi vxi de

where h is a decomposition of the computational domain into rectangles denoted by e. To get a stable M IC(0) factorization, in the general case, we rst substitute the stiness matrix by an auxiliary M -matrix.Then M IC(0) preconditioner is applied to this matrix.Two such approaches are presented where a local analysis is used to get estimates of the related condition numbers. Construction of the optimal M-matrix is very natural step of this study. For given SPD matrix K we want to nd SPD M-matrix B such that the condition nomber of the generalized eigenvalue problem, Ku = Bu is as smal as posible. The presented numerical tests well illustrate the behaviour of the theoretically studied algorithms.

General independence notions and some open problems Kazimierz Glazek University of Zielona Gra, Poland o K.Glazek@im.uz.zgora.pl In 1958 E. Marczewski introduced a general notion of independence, which contained as special cases majority of independence notions used in various branches of mathematics. A non-empty set I of the carrier A of an algebra A = (A; F) is called M-independent if equality of two term operations f and g of the considered algebra on any nite system of dierent elements of I implies f = g in A. There are several interesting results on this notion of independence. However the important scheme of M-independence is not enough wide to cover the stochastic independence, the independence in projective spaces and some others. This is why some notions weaker than the M-independence were developed. The notion of independence with respect to family Q of mappings (dened on subsets of A) into A, Q-independence for short, is a common way of dening almost all known notions of independences. There exists an interesting Galois correspondence between families Q of mappings and families of Q-independent sets. In our talk after a brief survey of these topics we will mainly concentrate on a few easily formulated and interesting results. There are several interesting open problems, for example: Let A = (A; F) be an algebra and C(X) denote a subalgebra of A generated by X A. 8

1) For which families Q the following property (JIS)Q of Q-independence holds? (JIS)Q for arbitrary Q-independent sets I and J (I, J A) , the set I J is also Q-independent, whenever C (I) C (J) = C (I J)? 2) For which algebras this property (IJS)Q holds for a well-dened family Q? 3) For algebras with (JIS)Q property for Q-independent sets, characterize the families Ind (A; Q) of all Q-independent sets in the algebra A. 4) Investigate algebras A with (JIS)M property for M -independent sets (that is, independent sets in the sense of Marczewski). References: [1] K. Glazek, Independence with respect to a family of mappings in abstract algebras, Dissertationes Math. 81 (1971), 1-55. [2] K. Glazek, Some old and new problems in the independence theory, Colloq. Math. 42 (1979), 127-189. [3] K. Glazek and S. Niwczyk, A new perspective on Q-independence, p. 61-69 in the book: General Algebra and Applications (K. Denecke and H.-J. Vogel, eds.), Shaker-Verlag, Aachen 2000. [4] K. Glazek and S. Niwczyk, Q-independence and weak automorphisms as Galois connections, in the book: Galois Connections (K. Denecke, M. Ern e and S. Wismath, eds.), to appear (2002). [5] E. Marczewski, Independence and homomorhisms in abstract algebras, Fund. Math. 50 (1961), 45-61. [6] E. Marczewski, Independence in abstract algebras. Results and problems, Colloq. Math. 14 (1966), 169-188. [7] K. Urbanik, Linear independence in abstract algebras, Colloq. Math. 14 (1966), 233-255.

The generalized badic diaphony of the Zaremba-Halton net over nite abelian groups Vassil Grozdanov South West University N. Rilski, Blagoevgrad, Bulgaria vassgrozdanov@yahoo.com A class of two-dimensional nets, constructed over nite abelian groups with respect to an arbitrary bijection is proposed. Some well-known two-dimensional nets are obtained as a special case of the so-called net of Zaremba-Halton over nite abelian groups. The generalized badic diaphony as a quantitative measure of the irregularity of the distribution of nets in [0, 1)s is considered. The exact order and the exact constant in this order of the generalized badic diaphony of the nets of this class are found.

Interactive instruction in combinatorics through VBA and MS Excell Elena Karastranova South West University N. Rilski, Blagoevgrad, Bulgaria helen k@abv.bg In the paper several ideas for introducing of basic concept of combinatorics in the math secondary school course through the interactive features of VBA and MS Excell are presented. Also the system of problem solving is proposed.

Solving practical problems connected with graphs in extracurricular education in 3rd - 5th classes Maryana Katsarska Neot Rilski South-West University mariana@aix.swu.bg In this research, methodological ideas are presented concerning introduction of the concept of graph (object of discrete mathematics) in extracurricular mathematics education in 3rd - 5th classes. Some problems are considered whose solution is connected with elementary level study of concepts connected with the graph: complete graph, incomplete graph, oriented graph, graph-tree, etc.

10

Dynamical Systems Generated by Plane Convex Compacta P. S. Kenderov Bulgarian Academy of Science vorednek@yahoo.com Dynamical systems generated by convex subsets of the Euclidean plane will be considered. As an application a numerical method for the identication of the best approximation by n-gons to a given convex compact subset in the plane will be described. Another interpretation of the method suggests a new approach to the approximation of function by special splines (with variable nodes).

Skiba points of optimal investment strategies Nikolay Kirov, Mikhail Krastanov IMI-BAS nkirov@math.bas.bg We consider a simple model in a linear-quadratic control problem for optimal investment strategies. The revenue is a maximum of two concave quadratic functions and the cost is a convex quadratic function. We determine the existing of a Skiba point and in this case we can calculate numerically this point.

Bijections and hypersubstitutions Jrg Koppitz o University of Potsdam koppitz@rz.uni-potsdam.de Let be any type. A mapping which assigns to each operation symbol a term of the same arity is called hypersubstitution of type . Since each of the operation symbols f is related to its fundamental terms f (x1 , . . . , x (f ) ) ( (f ) means the arity of f ) we can think any hypersubstitution as mapping the term f (x1 , . . . , x (f ) ) to the term (f ). It follows that every hypersubstitution of type then induces a mapping from the set W (X) of all terms of type

11

into W (X). The set of all hypersubstitutions of type together with an associative operation forms a monoid which was investigated by various authors. For example, in the computer science or by the consideration of clone automorphisms we are interested in such hypersubstitutions for which the extension is a bijection. We characterize for each type the set Bij( ) of all hypersubstitutions such that : W (X) W (X) is a bijection. It turns out that Bij( ) forms a submonoid of the monoid of all hypersubstitutions of type .

Further estimation of the anity and ecacy of partial agonists Rumen Kostadinov, Peter Milanov, Nevena Pencheva, Ivan Trenchev Department of Informatics, Faculty of Natural and Mathematical Sciences, South-West University, 66 Ivan Mihailov Str., Blagoevgrad 2700, Bulgaria milanov@aix.swu.bg The approximation of the so-called concentration-response curves in the quantitative pharmacology is important, because allows characterizing the properties of drugs and newly synthesized compounds with respective quantitative indexes. In our previous investigation we established proper algorithm and T explicit formulas for calculation of following parameters: Em - a maximal reA A sponse of the tissue, Em -a maximum response of the drugs, EC50 - an agonist e A concentration which produces 0.5Em , KA - dissociation constant, CA - relative 2 ecacy, basing on the following well known hyperbolic function: EA =
A Em [A]P , P + [A ]P [A] 50

where P is the slope of the respective curves and C2 - the measure unit of the stimulus. The formulas for KA and relative ecacy are: KA = [A50 ] ; 1 A eA A = C2 1 A where A =
A Em . T Em

In this study we explore the role of the slope for data approximation using concentration-response curves of the enkephalin (pentapeptide with endogenous 12

nature) analogue Dalargin. These curves were obtained by in vitro biological experiments with isolated tissue (gunea-pig ileum-longitudinal muscles). The preparations were electrically stimulated and the responses in the presence of increasing concentrations of the drugs were calculated as fraction inhibition EA T ( E T where Em = 1; the values are presented as X+S.E.M ). After approxm A imation of the concentration-response curves, the value of Em , KA , A50 and eA relative ecacy C2 calculating with dierent slopes (range 0.6 - 2 with a step 0.2) are presented in Table 1. Table 1. Parameters1 of concentration-response curves calculated with different slopes Pi .

Pi A Em A50 KA
eA C2

0.6 0.9023 0.4511 4.6162 9.2325

0.8 0.86 0.43 3.0726 6.1452

1 0.8364 0.4182 2.5562 5.1123

1.2 0.8211 0.4106 2.2950 4.59

1.4 0.8104 0.4051 2.1366 4.2732

1.6 0.8027 0.4013 2.0337 4.0674

1.8 0.7988 0.3993 1.9848 3.9696

2 0.8806 0.4403 3.6878 7.3756

The analysis of the data obtained show that optimal approximation of the concentration-response curves is with slopes between 0.8 - 1.2 as far as best tting is concerned. We need further calculations to precise the criteria for the optimal slope for approximation of pharmacological experimental data in in vitro investigations.

1 A A Em - maximum response of the drugs, A50 - agonist concentration which produces 0.5Em , KA - dissociation constant, eA - relative ecacy, C2 - unit to measure stimulus. C
2

13

On a Class of Discrete Functions Dimiter Stoichkov Kovachev South-West University dkovach@aix.swu.bg Let m, n, q, k be natural numbers with 1 m n, 1 q k, k 2. We consider the nvariable functions of kvalued logic. The number of dierent values of a function is called range of this function. We prove some results concerning the class of functions which have subfunctions of range q obtained when replacing arbitrary n m variables with arbitrary n m constants. In the particular case q = k, m = 1 we obtain the class of all H functions, considered in [1]. The number of the functions in this class is obtained. References [1]K. Chimev, Sur une sorte de dependance de certaines fonctions de Pk de leurs arguments, annuaire des ecoles techniques superieures, mathematique, vol. IV, Livre .1, 1967, p.p. 5-12 (in Bulgarian).

Mathematics and discrete mathematics Krassimir Manev Soa University St. Kliment Ohridski, American University in Bulgaria manev@fmi.uni-sofia.bg There is a trend to consider the discrete mathematics as a very specic part of the mathematics, dedicated mostly to serve the computer science. In this work we try to demonstrate the wrongness of such trend and the negative consequences that follow from it. Some elements of the discrete mathematics are considered that are of signicant importance for the general mathematical culture (inductively dened set, Boolean algebra, relation over Cartesian square, graph and trees, formal language, formula/expression etc.) and examples of their role in the process of education are given. The necessity of including these elements in traditional school mathematics curriculum as soon as possible is also discussed.

14

Construction of quasigroups of huge order Smile Markovski, Danilo Gligoroski Ss Ciryl and Methodius University, Skopje, Macedonia smile@ii.edu.mk There are some applications of quasigroups in cryptography that need quasigroups of huge order (for example of order 21024 ). Clearly, the applications are possible only if the quasigroups are eectively dened. We propose several ways of eective denitions of quasigroups of huge order, and possibilities of their applications.

Method of Averaging for Impulsive Dierential Inclusions and Impulsive Optimal Control Problems Nikolay Kitanov, Viktor Plotnikov Bulgarian Academy of Science, Blagoevgrad, Bulgaria nkitanov@abv.bg Odessa State University, Odessa, Ukraina In this paper are presented some results conected with applications of the averaging method for solving of optimal control problems, where the models are system dierential equations with impulsive eects. We suppose additional control in the impulses. Key words: method of averaging, dierential inclusion, impulsive dierential inclusion, optimal control, small parameter.

15

Algorithms for computing n-th derivative of composite function Marija Mihova, Smile Markovski Ss Ciryl and Methodius University, Skopje, Macedonia marija@ii.edu.mk We give an iterative formula for computing n-th derivative of a composite function, dierent than the formula of Faa de Bruno. Both formulas take summation on the set K(n) = {(k1 , k2 , . . . , kn )|ki are non-negative, k1 + 2k2 + . . . nkn = n}. There is not known a formula for computing the sequence of numbers |K(n)|. We give an iterative procedure for computing these numbers, as well as some approximation results.

Computer - based model for Teaching and Learning Discrete Mathematics Ivan Mirchev, Zoran Aleksov SWU N. Rilski mirchev@aix.swu.bg An instructional model used by the authors to investigate the benets from the integration of the computers and information technologies in the processes of teaching and learning computer sciences, due to its exibility, could be easily adapted to the needs of the processes of teaching an learning Discrete Mathematics.

16

Logical and mathematical relations equivalence and implication in the school course in mathematics Violeta Nikova Neot Rilski South-West University vnikova@aix.swu.bg This communication can be considered as a parallel paper to the paper entitled On the Place and Role of Elements of Discrete Mathematics in the School Course in Mathematics by Prof. Ivan Ganchev, DSc. It is pointed out in it that it is reasonable to distinguish two types of equivalence relations in mathematics. Equivalence relations of the rst type do not depend on the particular inferences and inference functions contained in them, whereas equivalence relations of the second type depend on these inferences and inference functions. On the basis of the realized dierentiation between these two types of equivalence relations and on Descartess principle of separated overcoming of diculties, some important conclusions are derived for methodology of teaching mathematics.

Modeling of Didactical Tasks Julia Ninova Soa University julianinova@hotmail.com Using the set-theory means and the apparatus of propositional calculus for modelling replaces descriptive prescription for solving didactical tasks with models. Operating with formal objects is made this way, because the reasoning are moved from the concrete to abstract level. The reasoning are concentrated over the structure, not over the specic content. The prot of this modeling is in revelation the common of actions, the ability of forecasting, the ability for determining the actions of the teacher and for organize purposefully the actions of the students. The researches in the methodology of the education in mathematics are moved to a higher level. The liberating of the empiricism and prescription is possible only in the frames of some theory.

17

Fuzzy relational calculus toolbox in MATLAB Ketty Peeva, Yordan Kyosev Technical University of Soa. Faculty of Applied Mathematics and Informatics, P.O.Box 384, Soa 1000 kgp@tu-sofia.bg We develop software for fuzzy relational calculus (max min, min max and intuitionistic cases) over the fuzzy algebra ([0, 1], max, min) in MATLAB workspace. Solving direct and inverse problems in fuzzy relational calculus are among the main advantages of this software. Applications in nite fuzzy machines and textile engineering are included.

Ordered knapsack problems D. Schweigert FB Mathematik TU Kaiserslautern Germany dietmarschweigert@web.de Given a graph there are several ways to dene an order relation on the set of edges. All of the classical optimization problems such as shortest path, minimal spanning trees, are dened for a linear order.But we will generalize to a poset and present a multiple knapsack problem.

Coloring of Terms by Tree Automata Slavcho Shtrakov South-West University shtrakov@aix.swu.bg Let be a type with set of operation symbols = (0 , ..., n ). The set of all terms (trees) of type is denoted by W (X). Hypersubstitutions are mappings : W (X) and they form a monoid Hyp( ). Any mapping : N Hyp( ) is called multi-hypersubstitution of type . The set of all multi-hypersubstitutions is denoted by M Hyp( ). Let N be the set N := {arity(f ) | f }. Let Q, Q N be a non-empty set of natural numbers called colors. A coloration of type is a sequence C := (ci1 , . . . , cin ) where 18

cm : m Qm Q for m N , m 1 and c0 : X 0 Q. A term t is colored if all its subterms are supplied with colors from Q. Let q Q be a color. Let Col( ) be the set of all colorations of type . Each coloration C can be used for coloring of terms as follows: (i) if t 0 X then C(t) := c0 (t); (ii) if t = f (t1 , . . . , tn ) then C(t) := cn (f, C(t1 ), . . . , C(tn )). This coloring can be realized by the following tree automaton A := (Q, , Qf , C) with Qf = Q and the assignment := c0 . A pair := (, C) M Hyp( ) Col( ) is called hypercoloration of type . The set of all hypercolorations is denoted by CM Hyp( ). The elements = (, C) of CM Hyp( ) can be viewed as mappings : W (X) W (X) as follows: (i) if t X then [t] := t; (ii) if t = f (t1 , . . . , tn ) then [t] := (cn (f, C(t1 ), . . . , C(tn )))(f )( [t1 ], . . . , [tn ]). The hypercolorations allows us to generalize the concept of hypersubstitutions working over colored terms. This concept is important in dierent elds of Computer Science - Graphical User Interface (GUI), XML - technology, Object Oriented Programming etc. In this paper we obtain some internal results concerning the monoid CM Hyp( ) of all hypercolorations, hypercolored derived algebras, hypercolored varieties and hypercolored identities, generated by hypercolorations.

A triangle transformation and applications in the art Grozio Stanilov Soa University St. Kliment Ohridski stanilov@fmi.uni-sofia.bg If ABC is a triangle and M0 (x0 , y0 ) is an arbitrary point,we introduce the functions: L1- the length of the section of ABC with the line AM0 , L2 - with BM0 , L3 - with CM0 . The points P, Q, R dened by the conditions determine the triangle P QR. We investigate the triangle transformation ABC P QR. For example:1. P BC, Q CA, R AB 2.P, Q, R are collinear i ABC is rectangular triangle; 3. The transformation A P is a product of an orthogonal projection, a symmetry and a translation. Using this transformation 19

we give a set of interesting curves and surfaces and by their visualizations beautiful bodies, some of them can be used in the applied art. All calculations are done by Computer Algebra and Computer Graphic.

Statistics methods application in the medico-social work with longtime unemployed persons Stefka Tchincheva, Kostadin Lekov SSouth-West University Neot Rilski chincheva@aix.swu.bg The main topics of the present research study is statistics methods application in medico-social work with long-time unemployed persons with psychic disabilities, stress, anxiety and life-crisis. The appropriate dynamic series and their characteristics were analyzed. We pay special attention to some features determining this negative symptoms. We used data concerning unemployed persons from the state social work cervices.

On the maximal subsemigroups of the nite transformation semigroup Kalcho Todorov, Iliya Gyudzenov Bulgaria, Blagoevgrad 2700 South-West University Neot Rilski kjt@bas.bg The full transformation of X(<) is isotone if i j = i j; the full transformation of the set X(<) is increasing isotone if for every i j = i j & i i. In this paper we give a description of the maximal subsemigroups of all Jk . 1 k n 1-classes and of all ideals Ik of the semigroup of all increasing isotone transformations of a nite linearly ordered set X. The obtained results are based on previously proved propositions stating that elements of every Jk -class, and therefore of every ideal Ik , can be represented as products of idempotents of the same Jk -class, whereas the idempotents themselves are non-factorable as products of elements of the same Jk -class. Maximal semigroups up to uniqueness for the ideal In1 of the semigroup of 20

all isotone transformations of a nite linearly ordered set are given in the work of Yang Xiuliang, Communications in Algebra, 28(3), (2000), 1503-15132.

Interrelation of Teaching of the Pattern Recognition and Discrete Mathematics Margarita Todorova, Nina Siniagina South-West University todorova@aix.swu.bg Bulgarian Academy of Sciences The paper surveys the application of discrete mathematics methods looked out in the elective discipline Pattern Recognition in Information Technology. The interdependence of disciplines and practical application of the methods of discrete mathematics is demonstrated important for solving problems from dierent elds.

New property of the genetic polytope Ivan Trenchev, Peter Milanov Department of Informatics, Faculty of Natural and Mathematical Sciences, South-West University wonther2000@yahoo.com The contemporary genetic code is produced from evolutionary forces. One hypothesis is that the arrangement of amino acid/codon assignments results from eects of the minimization of the errors of single point mutations from which follows some changes in genetic code information. Which concern the properties of the peptides sanitizes in the cell. Recently we described explicitly the set of all theoretical genetic codes as a convex polytope. We call this polytope a genetic polytope. In this presentation, we show new property of this polytope namely, that any two vertices are neighbors. We investigate also the errors of point mutations, which are estimated by dierent criteria.

21

Financial Toolbox in MATLAB Ivan Trenchev, Miglena Trencheva Department of Informatics, Faculty of Natural and Mathematical Sciences, South-West University wonther2000@yahoo.com Matlab and the Financial Toolbox provide a complete integrated computing environment for nancial analysis and engineering. The toolbox has everything you need to perform mathematical and statistical analysis of the nancial data and displays the results with state of the arts presentation-quality graphics. In this presentation we show how to nd a solution of some nancial problems as a control risk, analyze or manage a portfolio and others.

Simulation of failure and repair in discrete manufacturing systems by Colored Petri Nets Georgi Tuparov South West University, Blagoevgrad georgett@avala.bg In the paper the Colored Petri Net models of discrete manufacturing systems are presented. A module for simulation of failure and repair based on dierent probability distributions is performed. The simulation is realized with CPNtools package.

22

On a equivalence relation in the set of the permutation matrices Krasimir Yordzhev South-West University, Blagoevgrad, Bulgaria iordjev@yahoo.com A square matrix having an element equal to 1 in each row and each column, and the other elements being zero, is called permutation matrix. Let Sn be the set of all n n permutation matrices and let A, B Sn . An equivalence relation is dened as follows: A B if and only if A can be obtained from B by a sequential moving of the rst row or column to the last place. The cardinal number of the factor-set Sn / is found.

23