Projects / Programmes
Data structures and algorithms for discrete and continuous mathematics
Code |
Science |
Field |
Subfield |
1.07.00 |
Natural sciences and mathematics |
Computer intensive methods and applications |
|
Code |
Science |
Field |
P170 |
Natural sciences and mathematics |
Computer science, numerical analysis, systems, control |
algorithms and data structures, realizability theory, numerical methods, discrete mathematics, computable analysis and topology, graph drawing, symbolic computations, hypergeometric series, network decompositions
Researchers (9)
Organisations (2)
Abstract
The project focuses on research and development of algorithms and data structures for computationally intensive methods in natural, humanistic, and technical sciences. The first part of the project involves a development of mathematical theory, based on realizability theory and constructive mathematics, which makes it possible to systematically translate mathematical structures that occur in discrete and continuous mathematics into corresponding data structures and algorithms that can be used to represent mathematical objects in computers. In the second part of the project we study concrete examples of data structures and algorithms. The goal is to confirm in practice the usefulness of the theory developed in the first part of the project. We will study examples from both discrete mathematics (graph theory, combinatorial ang geometric configurations, networks) and continuous mathematics (numerical methods and numerical analysis, and data structures for computable analysis and topology). An important aspect of the project is the creation of a programming library consisting of data types and methods for discrete and continuous mathematical objects. The purpose of such a library is transfer of knowledge from theory to programming practice.