Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Accelerator Supplements

University of British Columbia

$52,000.00

Linear algebraic groups and invariant theory

FY 2008-09

Summary
Solving polynomial equations is one of the oldest problems in mathematics. The natural approach to this problem is to look for a sequence of substitutions (otherwise known as Tschirnhaus transformations) that simplifies this equation to a form that can be easily solved. The antient Babylonians knew how to do this for quadratic equations as early as 1600 BC. A similar approach led to the solution of cubic and quartic equations during the Renaissance. In the early 19th century Abel and Galois showed that a general polynomial equation of degree higher than four cannot be solved in radicals. One can nevertheless ask how far one can simplify this equation by Tschirnhaus transformations. Ten years ago, thinking about this question has led me and my collaborators to the notion of essential dimension, a concept that proved to be fruitful both within and far beyond the theory of polynomials. One of the goals of this proposal is to continue this research in two exciting new directions, one in the traditional setting of algebraic groups, theother in the new setting of algebraic stacks. Another part of this proposal was inspired by a question of Herbert Hauptman, a 1985 Nobel laureate in chemistry. To determine the structure of a physical crystal, one needs to know certain quantities, called ``phases". In practice, these cannot be measured directly; however, one can measure another set of quantities called ``observables". The question then becomes: if the ``observables" are known, can one recover the ``phases", and if so, what is the most efficient way to carry out the computations? Joe Buhler and I showed that the ``phases" can always be recovered from the ``observables". The problem of finding efficient algorithms to carry out the computations naturally leads to interesting theoretical questions in computational algebra, having to do with SAGBI bases. The goal of this part of the proposal is to investigate the existence problem for SAGBI bases as well as alternative algorithms in those cases where a SAGBI bases does not exist.
Program
Discovery Grants Program - Accelerator Supplements
Location
British Columbia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
349897-2007
Name nom
Reichstein, Zinovy
Department département
Mathematics
Organization id
2
Institution établissement
University of British Columbia
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2007
Award amount
52000
Program id
RGPAS
Program nane en
Discovery Grants Program - Accelerator Supplements
Program name fr
Programme de subventions à la découverte - supplément d'accélération
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1058
Committee name en
Discovery Accelerator Supplements - Natural Sciences
Committee name fr
Suppléments d'accélération à la découverte - Sciences naturelles
Area of application code
9999
Area of application group en
Not available
Area of application group fr
Non disponible
Area of application en
Not available
Area of application fr
Non disponible
Research subject code
2907
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Lie theory
Research subject fr
Théorie de lie
Partie
2
Nb partie
3
Application title
Linear algebraic groups and invariant theory
Keyword
NA
Application summary
Solving polynomial equations is one of the oldest problems in mathematics. The natural approach to this problem is to look for a sequence of substitutions (otherwise known as Tschirnhaus transformations) that simplifies this equation to a form that can be easily solved. The antient Babylonians knew how to do this for quadratic equations as early as 1600 BC. A similar approach led to the solution of cubic and quartic equations during the Renaissance. In the early 19th century Abel and Galois showed that a general polynomial equation of degree higher than four cannot be solved in radicals. One can nevertheless ask how far one can simplify this equation by Tschirnhaus transformations. Ten years ago, thinking about this question has led me and my collaborators to the notion of essential dimension, a concept that proved to be fruitful both within and far beyond the theory of polynomials. One of the goals of this proposal is to continue this research in two exciting new directions, one in the traditional setting of algebraic groups, theother in the new setting of algebraic stacks. Another part of this proposal was inspired by a question of Herbert Hauptman, a 1985 Nobel laureate in chemistry. To determine the structure of a physical crystal, one needs to know certain quantities, called ``phases". In practice, these cannot be measured directly; however, one can measure another set of quantities called ``observables". The question then becomes: if the ``observables" are known, can one recover the ``phases", and if so, what is the most efficient way to carry out the computations? Joe Buhler and I showed that the ``phases" can always be recovered from the ``observables". The problem of finding efficient algorithms to carry out the computations naturally leads to interesting theoretical questions in computational algebra, having to do with SAGBI bases. The goal of this part of the proposal is to investigate the existence problem for SAGBI bases as well as alternative algorithms in those cases where a SAGBI bases does not exist.
University of British Columbia - $52,000 Grant (2008-… | Canada Spends