logo
ProjectEnded

Algorithms in algebra and topology

The status, timeline and source of this project. A free account opens every field.

Source: EU Funding & Tenders Portal

Group theory is the study of symmetry in mathematical objects, such as rotations of geometric shapes. Groups help us understand the underlying structure of mathematical objects by revealing their symmetries. To understand groups we need an efficient way to describe them. Some groups admit a finite presentation; a finite set of building blocks, along with a finite collection of rules on when we can

Status
Closed
Sector
Education, Commercial
Location
United Kingdom
Updated
22 Jul 2026
Source
EU Funding & Tenders Portal

ConstructChat

Ask ConstructChat about Algorithms in algebra and topology

Pick a question to edit it, or write your own.

First answer free · no account

I am a

Project Information FAQ

Project Information

3 Q
The project “Algorithms in algebra and topology” is an infrastructure initiative in the Education sector, located in United Kingdom. Taiyo aggregates data on it from EU Funding & Tenders Portal.

Participants

Not available for this record.

Status

Original status

ended

Taiyo status

Closed

Taiyo last update

2026-07-22

Contact

Not available for this record.

Description

Description

Group theory is the study of symmetry in mathematical objects, such as rotations of geometric shapes. Groups help us understand the underlying structure of mathematical objects by revealing their symmetries. To understand groups we need an efficient way to describe them. Some groups admit a finite presentation; a finite set of building blocks, along with a finite collection of rules on when we can substitute one set of blocks for another. These descriptions are convenient. However, results in algebra and logic show that such descriptions are not always suitable to work with, as certain problems (e.g., the word problem, of deciding if two distinct collections of blocks represent the same group element) are incomputable; no computer can be built to always answer this. We can embed incomputable problems from groups into geometry, to show that the homeomorphism problem, of recognising if two geometric shapes are equivalent under smooth deformation, is incomputable in all dimensions above three. Thus we can't computationally classify geometric shapes in higher dimensions; we can't identify the unique distinguishing features of each shape. The study of generic computability (problems which can be computed most of the time) is a useful area in mathematics. Conversely, showing a problem can't be computed most of the time gives rise to applications in cryptography: generically incomputable problems are an excellent tool in the theory behind cryptosystems. This proposal will deal with incomputable and generically incomputable problems. We will investigate certain problems in group theory to determine if they are computable, or generically computable, or neither. We will apply these results to particular classess of higher-dimensional geometric objects, identifying whether certain problems relating to them are computable or not. The project will be carried out at the University of Cambridge, under the supervision of Dr. Henry Wilton.

Location

Country

United Kingdom (UK)

Source

Source

EU Funding & Tenders Portal

URL

More Details

Record type

Project

Sector

Education, Commercial

Article published date

2026-01-01

More on this project

Research

Free account

View all details

You are reading the public part. A free account opens the rest:

  • Every detail on this project
  • News and media coverage
  • Technical research
View all details

Free account · no card · lands you back on this project