Grant: Discovery Grants Program - Individual
York University
$31,000.00
Linearization in Bi-Free Probability
FY 2024-25
Summary
Operator Algebras is the area of mathematics where collections of continuous linear maps (known as operators) between vector spaces are studied. One important subarea of Operator Algebras is free probability which is a non-commutative probability theory with links to many other fields such as combinatorics, mathematical physics, and random matrices. Free probability is to classical probability as quantum mechanics is to classical mechanics; that is, one 'quantizes' random variables by replacing functions with operators.
Recently free probability was generalized to bi-free probability which allowed for a greater number of behaviours to be modelled and studied. Bi-free probability is a universal non-commutative probability theory in that there exist exactly 5 nice notions of non-commutative independence for algebras, all of which are specific instances of bi-free independence. Consequently, this greater generality allows for bi--free probability to investigate unsolved problems in Operator Algebras.
The main objective of this proposal is to establish the bi-free analogue of "linearization algorithms" used in free probability. These algorithms are for taking a polynomial in non-commutative random variables and reducing it to a linear expression by inflating the underlying space to be matrix-valued. The benefit of these algorithms are that there are many transformations in free probability that can be used to obtain information about linear expressions that then transfer back to the original polynomial. Linearization algorithms have been used to demonstrate collections of operators are absent from algebras with certain properties, and is one of two essential ingredients in an algorithm that computes the asymptotic behaviour of a polynomial of random matrices.
Since linearization algorithms in free probability are based in algebraic manipulations and free probability techniques, the Principal Investigator's previous work on the bi-free analogue of random matrices and operator-valued bi-free probability will enable the derivation of a bi-free linearization algorithm. Subsequently, a bi-free linearization algorithm will be used to solve a wide variety of open problems relating to free probability, combinatorics, and von Neumann algebras.
The significance and novelty of this proposal can be summarized as follows. Linearization algorithms in free probability have had substantial influence on Operator Algebras and a bi-free linearization algorithm will further enhance the utility of this technique thereby contributing to advancements in the field. This proposal also has several projects that are excellent training opportunities for diversified HQP that will enable them to learn a vast amount of free probability and be at the forefront of research. The results of this proposal will facilitate other researchers in Operator Algebras using bi-free probability as a vital component of their field and use its techniques to solve influential problems.
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
RGPIN-2024-06269
Name nom
Skoufranis, Paul
Department département
Mathematics and Statistics
Organization id
38
Institution établissement
York University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2024
Competition year année de concours
2024
Award amount
31000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR LA DÉCOUVERTE
Committee code
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
Area of application code
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
Research subject code
2900
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Pure mathematics
Research subject fr
Mathématiques pures
Field of research list names en
Not available
Field of research list names fr
Non disponible
Socioeconomic objective list names en
Not available
Socioeconomic objective list names fr
Non disponible
Application title
Linearization in Bi-Free Probability
Keywords
operator algebras; free probability; von neumann algebras; random matrices; bi-free independence; the linearization trick
Application summary
Operator Algebras is the area of mathematics where collections of continuous linear maps (known as operators) between vector spaces are studied. One important subarea of Operator Algebras is free probability which is a non-commutative probability theory with links to many other fields such as combinatorics, mathematical physics, and random matrices. Free probability is to classical probability as quantum mechanics is to classical mechanics; that is, one 'quantizes' random variables by replacing functions with operators.
Recently free probability was generalized to bi-free probability which allowed for a greater number of behaviours to be modelled and studied. Bi-free probability is a universal non-commutative probability theory in that there exist exactly 5 nice notions of non-commutative independence for algebras, all of which are specific instances of bi-free independence. Consequently, this greater generality allows for bi--free probability to investigate unsolved problems in Operator Algebras.
The main objective of this proposal is to establish the bi-free analogue of "linearization algorithms" used in free probability. These algorithms are for taking a polynomial in non-commutative random variables and reducing it to a linear expression by inflating the underlying space to be matrix-valued. The benefit of these algorithms are that there are many transformations in free probability that can be used to obtain information about linear expressions that then transfer back to the original polynomial. Linearization algorithms have been used to demonstrate collections of operators are absent from algebras with certain properties, and is one of two essential ingredients in an algorithm that computes the asymptotic behaviour of a polynomial of random matrices.
Since linearization algorithms in free probability are based in algebraic manipulations and free probability techniques, the Principal Investigator's previous work on the bi-free analogue of random matrices and operator-valued bi-free probability will enable the derivation of a bi-free linearization algorithm. Subsequently, a bi-free linearization algorithm will be used to solve a wide variety of open problems relating to free probability, combinatorics, and von Neumann algebras.
The significance and novelty of this proposal can be summarized as follows. Linearization algorithms in free probability have had substantial influence on Operator Algebras and a bi-free linearization algorithm will further enhance the utility of this technique thereby contributing to advancements in the field. This proposal also has several projects that are excellent training opportunities for diversified HQP that will enable them to learn a vast amount of free probability and be at the forefront of research. The results of this proposal will facilitate other researchers in Operator Algebras using bi-free probability as a vital component of their field and use its techniques to solve influential problems.