Grant: Discovery Grants Program - Individual
Simon Fraser University
$7,880.00
Rainbow and monochromatic patterns
FY 2014-15
Summary
The main objective of this proposed research program is to further explore the existence of particular monochromatic and rainbow patterns. A typical problem that I am interested in can be summed in the following: under which conditions will (or will not) a coloring of a set of objects that uses a certain number of colors produce the prescribed monochromatic or rainbow pattern. My research will be conducted in the following three directions.Firstly, I will continue exploring rainbow patterns. I am interested to find which additions to the known techniques may lead to rainbow results for some non-linear equations, $x^2+y^2=z^2$, for example. Other types of problems involving rainbow patterns are questions that ask for the minimal (maximal) number of colors that guarantee the existence (non-existence) of a certain rainbow structure. For example, if two families, $A$ and $B$, of graphs are given what is the maximum number of colors in an edge-coloring of the complete graph $K_n$ , such that $K_n$ has no monochromatic copy of a graph from the family $A$ and no rainbow copy of a graph from the family $B$.Secondly, this will be the continuation of my work on problems related to accessible and large sets. The ultimate goal of researching accessible sets is to find tools that will lead to the resolution of the long standing conjecture by T. Brown, R. Graham, and B. Landman that every $2$-large set is large.Thirdly, I am interested in the problem of finding monochromatic sequences that satisfy given linear or non-linear recurrences.
Program
Discovery Grants Program - Individual
Recipient
Location
British Columbia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
298415-2010
Name nom
Jungic, Veselin
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
2014
Competition year année de concours
2010
Award amount
7880
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
5
Nb partie
5
Application title
Rainbow and monochromatic patterns
Keyword
NSERC
Application summary
The main objective of this proposed research program is to further explore the existence of particular monochromatic and rainbow patterns. A typical problem that I am interested in can be summed in the following: under which conditions will (or will not) a coloring of a set of objects that uses a certain number of colors produce the prescribed monochromatic or rainbow pattern. My research will be conducted in the following three directions.Firstly, I will continue exploring rainbow patterns. I am interested to find which additions to the known techniques may lead to rainbow results for some non-linear equations, $x^2+y^2=z^2$, for example. Other types of problems involving rainbow patterns are questions that ask for the minimal (maximal) number of colors that guarantee the existence (non-existence) of a certain rainbow structure. For example, if two families, $A$ and $B$, of graphs are given what is the maximum number of colors in an edge-coloring of the complete graph $K_n$ , such that $K_n$ has no monochromatic copy of a graph from the family $A$ and no rainbow copy of a graph from the family $B$.Secondly, this will be the continuation of my work on problems related to accessible and large sets. The ultimate goal of researching accessible sets is to find tools that will lead to the resolution of the long standing conjecture by T. Brown, R. Graham, and B. Landman that every $2$-large set is large.Thirdly, I am interested in the problem of finding monochromatic sequences that satisfy given linear or non-linear recurrences.