Skip to main contentPsst! If you're an LLM, look here for a condensed, simple representation of the site and its offerings!

LiveFree Webinar — Wednesday, October 28 at 2:00 PM ET

Register Free →

Equivalence relations in group theory

Awarded
2640837Grant

Contract Overview

Solicitation details, issuing organization, response deadlines, documents, and interested companies for this government contract opportunity.

AI Contract Overview

Show more

This National Science Foundation award supports a research project focused on studying equivalence relations within group theory through the lens of computable reduction. By applying this modern tool, the project seeks to conduct a finer analysis of the complexity of equivalence relations, moving beyond classical Turing reduction to better understand the interaction between group theory and computability theory. The research is divided into two primary phases: the first addresses the word and conjugacy problems to uncover new mathematical landscapes, while the second experimentally investigates various other algebraic equivalence relations and their interconnections. Beyond its theoretical goals, the project emphasizes educational outreach and professional development. It provides students with opportunities to engage in hands-on mathematical research and problem solving under the mentorship of the Principal Investigator. The initiative aims to develop new tools in logic and algebra that may have broad applications beyond the immediate scope of the project, fulfilling the NSF's criteria for intellectual merit and broader impacts.

General Info

NSF award for research on group theory equivalence relations and computable reduction.

Documents

0

No documents available

Documents will appear here when they are available.

AI Contract Breakdown

Uniform Contract Format

No documents to break down

The breakdown needs solicitation documents. None were found from this contract's source.

Timeline

PhaseAwarded
Posted

Award Notice

Awarded

Contract was awarded

Ready to pursue this opportunity?

Get full access to track this contract, build proposals with AI assistance, and manage your pipeline.

Organization & Contact Information

Show more
AgencyNational Science Foundation → Mathematical Science Section
Contacts1 person available
OfficeN/A
Office AddressN/A
Contacts
Tomek BartoszynskiProgram Officer

Full Description

Show more
This project aims to study equivalence relations in groups. Groups are a class of fundamental objects in Algebra, and more generally, Mathematics. Originally, they were used to define symmetries of patterns --- from how crystals form to the rotations of Rubik’s cube --- but it turns out that many important mathematical structures can be thought of as a group with some extra structure. On the other hand, equivalence relations are relations that describe “sameness”, which is one of most natural questions to ask when given two objects, and whose meaning depend on the exact context. In group theory, there are many natural relations that are equivalence relations. Equivalence relations in group theory have a long history of being one of the most important testing grounds for ideas in computability theory, which has stimulated progress in both areas. This project aims to investigate this interaction, but under the light of a tool, computable reduction, that has seen rapid development in the last two decades. Compared to classical literature, this new perspective allows a finer analysis of the equivalence relations, which allows us to investigate deeper the complexity of these equivalence relations. Furthermore, this new perspective is expected to motivate the development of new tools in both group theory and computability theory, which have the potential to be useful to other problems beyond this project. This project also provides opportunities and support for students to engage in problem solving and research in logic and group theory. The first part of the project focuses on the word and conjugacy problems, the two most famous algorithmic problems in group theory. Classically, they are viewed as sets and studied using Turing reduction, even though they are naturally equivalence relations. This part utilizes the newly developed theory of computable reduction, which recognizes the equivalence relation structure of these algorithmic problems. Many preliminary results of the PI show that this new point of view paints a very different landscape, which leads to new questions in both group theory and computability theory. The project also aims to develop new tools to answer these questions. The second part of the project investigates more broadly other equivalence relations in algebra, under a variety of reducibilities, all of which respect the equivalence relation structure. While this part is more experimental in nature, it is observed that many of the problems are closely tied with each other as well as the problems in the first part. This project also contains various problems that are more concrete and thus suitable for students, which allows the students to contribute to the project while getting hands-on experience with mathematical research. The PI will mentor these students not only in research but also their mathematical career development. This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

Similar Contracts

Same NAICS industry code

Ready to Pursue This Opportunity?

Get AI-powered intelligence on this solicitation and the ones like it

Every page of the solicitation package shredded into a compliance breakdown

AI-powered matching based on your capabilities and past performance

Competitor and incumbent history on the requirement

Automated alerts on amendments, Q&A deadlines, and award

Miguel
Hillary
Keith Deutsch
Christine

Join 750+ contractors already using CLEATUS