396 resultados para Discrete Mathematics and Combinatorics
em Bulgarian Digital Mathematics Library at IMI-BAS
Resumo:
The present work is dedicated to the learning discrete mathematics at Bulgarian school. A review of syllabuses and standards has been made. A project of learning discrete mathematics elements from first to twelve class is proposed.
Resumo:
In October 1997 we celebrate the fiftieth anniversary of the founding of the Institute for Mathematics and Informatics (IMI) of the Bulgarian Academy of Sciences (BAS).
Resumo:
The Faculty of Mathematics and Informatics (FMI) of Sofia University “St. Kliment Ohridski” is briefly presented as an educational and research institution. The possible contribution of FMI to KT-DigiCULT-BG project is analyzed.
Resumo:
Report published in the Proceedings of the National Conference on "Education in the Information Society", Plovdiv, May, 2013
Resumo:
The digitization practice for retro-converting of the mathematical periodicals, published by the Institute of Mathematics and Informatics, Bulgarian Academy of Sciences (IMI-BAS) and the followed benefits for long-term preserving and assuring open access to these materials is discussed in the article.
Resumo:
Report published in the Proceedings of the National Conference on "Education and Research in the Information Society", Plovdiv, May, 2014
Resumo:
In this paper we examine discrete functions that depend on their variables in a particular way, namely the H-functions. The results obtained in this work make the “construction” of these functions possible. H-functions are generalized, as well as their matrix representation by Latin hypercubes.
Resumo:
A γ-space with a strictly positive measure is separable. An example of a non-separable γ−space with c.c.c. is given. A P−space with c.c.c. is countable and discrete.
Resumo:
This paper was extensively circulated in manuscript form beginning in the Summer of 1989. It is being published here for the first time in its original form except for minor corrections, updated references and some concluding comments.
Resumo:
We study a class of models used with success in the modelling of climatological sequences. These models are based on the notion of renewal. At first, we examine the probabilistic aspects of these models to afterwards study the estimation of their parameters and their asymptotical properties, in particular the consistence and the normality. We will discuss for applications, two particular classes of alternating renewal processes at discrete time. The first class is defined by laws of sojourn time that are translated negative binomial laws and the second class, suggested by Green is deduced from alternating renewal process in continuous time with sojourn time laws which are exponential laws with parameters α^0 and α^1 respectively.
Resumo:
* This research was supported by a grant from the Greek Ministry of Industry and Technology.
Resumo:
* The research is supported partly by INTAS: 04-77-7173 project, http://www.intas.be
Resumo:
With the rapidly growing activities in electronic publishing ideas came up to install global repositories which deal with three mainstreams in this enterprise: storing the electronic material currently available, pursuing projects to solve the archiving problem for this material with the ambition to preserve the content in readable form for future generations, and to capture the printed literature in digital versions providing good access and search facilities for the readers. Long-term availability of published research articles in mathematics and easy access to them is a strong need for researchers working with mathematics. Hence in this domain some pioneering projects have been established addressing the above mentioned problems.
Resumo:
Composition problem is considered for partition constrained vertex subsets of n dimensional unit cube E^n . Generating numerical characteristics of E^n subsets partitions is considered by means of the same characteristics in 1 − n dimensional unit cube, and construction of corresponding subsets is given for a special particular case. Using pairs of lower layer characteristic vectors for E^(1-n) more characteristic vectors for E^n are composed which are boundary from one side, and which take part in practical recognition of validness of a given candidate vector of partitions.
Resumo:
Mathematics Subject Classification: 26A33, 45K05, 60J60, 60G50, 65N06, 80-99.