Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of Calgary

$12,000.00

Convex Polytopes

FY 2014-15

Summary
A set S is convex if for any two points in S, the straight line segment determined by the two points is also contained is S. A convex polytope P is the smallest convex set determined by a finite set of points.Thus, a triangle is a convex polytope determined by three points in a plane ( 2-dimensional) and a cube is a convex polytope determined by eight points in space( 3-dimensional) An investigation of the geometric and combinatorial properties of convex polytopes with the following long tern objectives: verification of the Gohberg-Markus-Hadwiger Conjecture for dual neighbourly polytopes, development of a combinatorial theory of polytopes and understanding the geometrical structure of polytopes. The short term objectives are the investigation of certain classes of polytopes ( periodically-cyclic), the verification of the G-M-H Conjecture for dual neighbourly 4-polytopes and dual totally-sewn d-polytopes and determining the maximum number of vertices of edge-antipodal 4-polytopes.Anticipated collaborators for these projects are M. Bayer( Kansas), K. Boroczky ( Budapest),F. Fodor ( Szeged), A. Heppes ( Budapest), D. Oliveros ( Mexico), as well as graduate students and post-docs.
Program
Discovery Grants Program - Individual
Location
Alberta, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
8385-2012
Name nom
Bisztriczky, Tibor
Department département
Mathematics and Statistics
Organization id
11
Institution établissement
University of Calgary
Province en
Alberta
Province fr
Alberta
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2014
Competition year année de concours
2012
Award amount
12000
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
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
Partie
3
Nb partie
5
Application title
Convex Polytopes
Keyword
NSERC
Application summary
A set S is convex if for any two points in S, the straight line segment determined by the two points is also contained is S. A convex polytope P is the smallest convex set determined by a finite set of points.Thus, a triangle is a convex polytope determined by three points in a plane ( 2-dimensional) and a cube is a convex polytope determined by eight points in space( 3-dimensional) An investigation of the geometric and combinatorial properties of convex polytopes with the following long tern objectives: verification of the Gohberg-Markus-Hadwiger Conjecture for dual neighbourly polytopes, development of a combinatorial theory of polytopes and understanding the geometrical structure of polytopes. The short term objectives are the investigation of certain classes of polytopes ( periodically-cyclic), the verification of the G-M-H Conjecture for dual neighbourly 4-polytopes and dual totally-sewn d-polytopes and determining the maximum number of vertices of edge-antipodal 4-polytopes.Anticipated collaborators for these projects are M. Bayer( Kansas), K. Boroczky ( Budapest),F. Fodor ( Szeged), A. Heppes ( Budapest), D. Oliveros ( Mexico), as well as graduate students and post-docs.