logo
ProjectOngoing

Stability and Testability: Groups and Codes

Ongoing · Israel

Source: EU Funding & Tenders Portal

"Stability in algebra in general and in group theory, in particular, is a general name for questions of the following type: Is every ""almost solution"" a small deformation of an ""exact solution""? E.g. (a) Are two unitary matrices which almost commute small deformations of matrices that do commute? or (b) Is every ""almost homomorphism"" from a group D to topological group G, a small deformation

Status
Under Construction
Sector
Education
Location
Israel
Updated
22 Jul 2026
Source
EU Funding & Tenders Portal

ConstructChat

Ask ConstructChat about Stability and Testability: Groups and Codes

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 “Stability and Testability: Groups and Codes” is an infrastructure initiative in the Education sector, located in Israel. Taiyo aggregates data on it from EU Funding & Tenders Portal.

Participants

Not available for this record.

Status

Original status

ongoing

Taiyo status

Under Construction

Taiyo last update

2026-07-22

Contact

Not available for this record.

Description

Description

"Stability in algebra in general and in group theory, in particular, is a general name for questions of the following type: Is every ""almost solution"" a small deformation of an ""exact solution""? E.g. (a) Are two unitary matrices which almost commute small deformations of matrices that do commute? or (b) Is every ""almost homomorphism"" from a group D to topological group G, a small deformation of a true homomorphism? So (a) is a special case of (b), with D = Z x Z and G = Un(C). In recent years, it has been discovered that ""Group Stability"" can be the path to the solution of some longstanding problems in group theory such as: Are all groups sofic? hyperlinear? (Two well known problems of Gromov and Connes, respectively). In computer science, property testing is an area which studies the possibility of having (random) algorithms that can check a property while reading only a small amount of the information. A major problem here is: Are there good locally testable codes? Namely, error correcting codes for which one can decide with a high degree of certainty that a vector is in the code, while reading only a small number of its bits. The current project will look at these group theoretic and codes problems from a unified point of view. Some partial works show that they are related to high dimensional expanders, Ramanujan complexes and to lattices in p-adic simple groups and their actions on the associated buildings. We plan to develop further methods to study stability and testability and eventually also to attack the holy grail problems of these areas."

Location

Country

Israel

Source

Source

EU Funding & Tenders Portal

URL

More Details

Record type

Project

Sector

Education

Article published date

2026-02-15

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