Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

Carleton University

$15,000.00

Combinatorial enumerations and random structures

FY 2010-11

Summary
This proposal comprises four specific research topics within the general area of discrete mathematics. A surface map consists of some points and lines in the surface such that each line joins two points, no two lines intersect each other except possibly at their endpoints, and these lines divide the surface into regions which look like polygons. Surface maps are natural objects of study in mathematics, and they are also useful models in the studies of quantum gravity. I will continue my research in counting surface maps and applying the results to quantum physics. A boolean function is called correlation-immune of order k if the function value is uncorrelated with the values of any k of the arguments. Such functions are of considerable interest due to their cryptographic properties. I would like to derive sharp bounds for the number of such functions. A composition of a positive integer n is a sequence of positive integers whose sum is n. Simple formulas exist for the number of all compositions of n; however no simple expression is known for various types of compositions when some local restrictions are imposed on the summands. I would like to find out more properties about these locally restricted compositions. Many combinatorial structures decompose into simpler indecomposable components in a way similar to decomposing integers into prime factors. I would like to find out more properties about decomposable structures when partial information about the components are known.
Program
Discovery Grants Program - Individual
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
138336-2010
Name nom
Gao, Zhicheng(Jason)
Department département
Mathematics and Statistics, School of
Organization id
23
Institution établissement
Carleton University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2010
Competition year année de concours
2010
Award amount
15000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à 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
Partie
1
Nb partie
5
Application title
Combinatorial enumerations and random structures
Keyword
NSERC
Application summary
This proposal comprises four specific research topics within the general area of discrete mathematics. A surface map consists of some points and lines in the surface such that each line joins two points, no two lines intersect each other except possibly at their endpoints, and these lines divide the surface into regions which look like polygons. Surface maps are natural objects of study in mathematics, and they are also useful models in the studies of quantum gravity. I will continue my research in counting surface maps and applying the results to quantum physics. A boolean function is called correlation-immune of order k if the function value is uncorrelated with the values of any k of the arguments. Such functions are of considerable interest due to their cryptographic properties. I would like to derive sharp bounds for the number of such functions. A composition of a positive integer n is a sequence of positive integers whose sum is n. Simple formulas exist for the number of all compositions of n; however no simple expression is known for various types of compositions when some local restrictions are imposed on the summands. I would like to find out more properties about these locally restricted compositions. Many combinatorial structures decompose into simpler indecomposable components in a way similar to decomposing integers into prime factors. I would like to find out more properties about decomposable structures when partial information about the components are known.
Carleton University - $15,000 Grant (2010-11) | Canada Spends