All
All

What are you looking for?

All
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Combinatorial structures, continuous mathematics and their impact on the design of efficient algorithms

Project goals

We will investigate the influence of combinatorial structures on topological, geometric or purely combinatorial problems including algorithmic problems in these areas. An identification of a suitable combinatorial structure or a provable absence of such structure is often the key to a solution of a given problem. We intend to investigate problems in the following four areas: 1. Embeddability 2. Forbidden substructures in graphs and matroids 3. Combinatorial decompositions of topological spaces 4. Algorithmic problems in dimension 4

Keywords

Combinatorial structurestopologygeometryalgorithms

Public support

  • Provider

    Czech Science Foundation

  • Programme

    Standard projects

  • Call for proposals

    SGA0202500001

  • Main participants

    Univerzita Karlova / Matematicko-fyzikální fakulta

  • Contest type

    VS - Public tender

  • Contract ID

    25-16847S

Alternative language

  • Project name in Czech

    Kombinatorické struktury, spojitá matematika a jejich vliv na návrh efektivních algoritmů

  • Annotation in Czech

    V projektu se budeme zabývat vlivem kombinatorických struktur na topologické, geometrické či čistě kombinatorické problémy, přičemž chceme zahrnout i problémy algoritmického charakteru. Identifikace vhodné kombinatorické struktury, nebo naopak prokazatelná absence takové struktury často bývá klíčem k řešení. Konkrétní problémy, kterými se plánujeme zabývat, lze rozdělit do následujících oblastí: 1. Vnořitelnost 2. Zakázané podstruktury v grafech a matroidech 3. Kombinatorické dekompozice topologických prostorů 4. Algoritmické problémy v dimenzi 4

Scientific branches

  • R&D category

    ZV - Basic research

  • OECD FORD - main branch

    10101 - Pure mathematics

  • OECD FORD - secondary branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • OECD FORD - another secondary branch

  • AF - Documentation, librarianship, work with information
    BA - General mathematics
    BC - Theory and management systems
    BD - Information theory
    IN - Informatics

Solution timeline

  • Realization period - beginning

    Jan 1, 2025

  • Realization period - end

    Dec 31, 2027

  • Project status

    Z - Beginning multi-year project

  • Latest support payment

Data delivery to CEP

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

  • Data delivery code

    CEP25-GA0-GA-R

  • Data delivery date

    Feb 27, 2025

Finance

  • Total approved costs

    9,753 thou. CZK

  • Public financial support

    9,327 thou. CZK

  • Other public sources

    426 thou. CZK

  • Non public and foreign sources

    0 thou. CZK

Basic information

Recognised costs

9 753 CZK thou.

Public support

9 327 CZK thou.

95%


Provider

Czech Science Foundation

OECD FORD

Pure mathematics

Solution period

01. 01. 2025 - 31. 12. 2027