Boolean Functions
Lead Research Organisation:
University of Cambridge
Department Name: Pure Maths and Mathematical Statistics
Abstract
The project will be to consider some problems about Boolean functions. It will focus especially on the distances, in various metrics, between different functions. One aim will be bounds between the majority function and the parity function: in a sense, this is `most interesting case' for two functions. Any progress will have applications in several related areas.
Organisations
People |
ORCID iD |
| I Leader (Primary Supervisor) | |
| Maria Romina Ivan (Student) |
Studentship Projects
| Project Reference | Relationship | Related To | Start | End | Student Name |
|---|---|---|---|---|---|
| EP/N509620/1 | 01/10/2016 | 30/09/2022 | |||
| 2261049 | Studentship | EP/N509620/1 | 01/10/2019 | 30/06/2023 | Maria Romina Ivan |
| EP/R513180/1 | 01/10/2018 | 30/09/2023 | |||
| 2261049 | Studentship | EP/R513180/1 | 01/10/2019 | 30/06/2023 | Maria Romina Ivan |
| Description | My main focus was poset saturation in which we want to find how large a collection of sets has to be in order to contain a certain pre-nominated structure. I have solved this question for the structure called "the butterfly", and made advances for the structures called "the diamond" and "the antichain". |
| Exploitation Route | My research findings have developed the field of Poset Sturation and attracted a lot of attention from researchers across the globe. |
| Sectors | Digital/Communication/Information Technologies (including Software),Other |