Grant: Discovery Grants Program - Individual
Simon Fraser University
$34,000.00
Transcendence and Combinatorics
FY 2024-25
Summary
A mathematical object is said to be algebraic if it satisfies a polynomial equation, and transcendental if it does not. Mathematicians have been trying to unlock the structure of transcendental objects for well over a century. Combinatorics provides a useful framework to study power series via generating functions: this is the series in t wherein the coefficient of tn is the number of objects of size n in the family. Twentieth century combinatorics and theoretical computer science provided characterizations of those classes with rational and algebraic generating functions. Finding natural extensions of these correspondences has been a motivating driver of enumerative combinatorics for several decades.
The primary long-term goal of my research program is to characterize those combinatorial classes with transcendental generating functions, particularly to distinguish between the cases of differentiably finite, differentially algebraic, differentially transcendental. Three study areas will be pursued over the next five years.
Enumeration, random sampling and visualization
The entry component studies classic combinatorial aspects of lattice walk models. The underlying lattices will vary from grids to fractals. Lattice walks are a means to explore longstanding conjectures about D--finite functions, such as Christol's 1990 conjecture on their form, new conjectures on differentially algebraic functions. We identify key underlying combinatorial mechanisms that drive large scale behaviour of discrete objects that appear in applications such as queues and molecular structure.
Geometric and asymptotic analysis of weighted structures
Multidimensional complex analysis has been surprisingly useful in combinatorics. Weighted walk models permit a subtle exploration of the relation of asymptotic behaviour to the singular structure of related algebraic curves. The goal of this part of the program is new formulas, and a better understanding of the properties that significantly contribute to the large scale behaviour of enumeration formulas.
Characterizing differential transcendence
Combinatorial descriptions of discrete classes can often translate directly to functional equations satisfied by the generating functions. We use classic functional equation theory to manipulate equations and to classify their solutions. A differential Galois strategy to study difference equations has already been adapted to combinatorial functional equations for lattice walk generating functions. We examine those combinatorial classes whose generating functions satisfy other kinds of difference equations with an eye toward classification, but also revealing combinatorial mechanisms that yield differentially transcendental generating functions. We gain insight into solution strategies for different kinds of functional equations.
Program
Discovery Grants Program - Individual
Recipient
Location
British Columbia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
RGPIN-2024-06022
Name nom
Mishna, Marni
Department département
mathematics
Organization id
5
Institution établissement
Simon Fraser University
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2024
Competition year année de concours
2024
Award amount
34000
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
2914
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Combinatorics
Research subject fr
Combinatoire
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
Transcendence and Combinatorics
Keywords
generating functions; differential galois theory; combinatorics; functional equations; algebraic functions; random walks; discrete structures; enumeration; asymptotic analysis
Application summary
A mathematical object is said to be algebraic if it satisfies a polynomial equation, and transcendental if it does not. Mathematicians have been trying to unlock the structure of transcendental objects for well over a century. Combinatorics provides a useful framework to study power series via generating functions: this is the series in t wherein the coefficient of tn is the number of objects of size n in the family. Twentieth century combinatorics and theoretical computer science provided characterizations of those classes with rational and algebraic generating functions. Finding natural extensions of these correspondences has been a motivating driver of enumerative combinatorics for several decades.
The primary long-term goal of my research program is to characterize those combinatorial classes with transcendental generating functions, particularly to distinguish between the cases of differentiably finite, differentially algebraic, differentially transcendental. Three study areas will be pursued over the next five years.
Enumeration, random sampling and visualization
The entry component studies classic combinatorial aspects of lattice walk models. The underlying lattices will vary from grids to fractals. Lattice walks are a means to explore longstanding conjectures about D--finite functions, such as Christol's 1990 conjecture on their form, new conjectures on differentially algebraic functions. We identify key underlying combinatorial mechanisms that drive large scale behaviour of discrete objects that appear in applications such as queues and molecular structure.
Geometric and asymptotic analysis of weighted structures
Multidimensional complex analysis has been surprisingly useful in combinatorics. Weighted walk models permit a subtle exploration of the relation of asymptotic behaviour to the singular structure of related algebraic curves. The goal of this part of the program is new formulas, and a better understanding of the properties that significantly contribute to the large scale behaviour of enumeration formulas.
Characterizing differential transcendence
Combinatorial descriptions of discrete classes can often translate directly to functional equations satisfied by the generating functions. We use classic functional equation theory to manipulate equations and to classify their solutions. A differential Galois strategy to study difference equations has already been adapted to combinatorial functional equations for lattice walk generating functions. We examine those combinatorial classes whose generating functions satisfy other kinds of difference equations with an eye toward classification, but also revealing combinatorial mechanisms that yield differentially transcendental generating functions. We gain insight into solution strategies for different kinds of functional equations.