The main objective of the investigator is the study of algebraic structures--a ring, an ideal or even a module--as they undergo smoothing processes. These transformations enable them to support new constructions, including analytic ones. In the case of algebras, divisors acquire a group structure, cohomology tends to slim down, and it is an essential step in the desingularization of singular varieties. There is an inherent interest in those processes that add to the structure the solutions of collections of equations of integral dependence. Finding these equations, determining the properties of the assemblage of solutions and understanding the complexity costs of these tasks, is a central region of research for commutative algebra. Bringing into this mix the numerical controls provided by multiplicity theory--broadly seen as the assignment of measures of size to an structure--make for a technically challenging and potentially very rewarding activity smack right where the field interacts mostly intensively with algebraic geometry and computational algebra. The investigator introduces an approach to the study of theoretical aspects of certain classes of algebraic structures from the perspective of complexity. As applications, the investigator seeks to predict how delicate techniques associated to smoothing processes will perform when applied to the solution of several problems of interest, and thereby suggest which mix of methods offer higher performance. They will also be employed to derive ordinary complexity counts for several of these problems without previously known classical counts.

Commutative algebra is foremost the study of sytems of polynomial equations, and of its generalizations. It has elucidated several structures that occur among such systems, particularly those tagged as of Cohen-Macaulay type. These encode incredible theoretical efficiencies in the derivation/prediction of its properties and offer superb computational economies. Often the full natural set of equations is not known at the outset so that methods and processes must be developed to find and analyze it. This proposal is focused on one central process, that of smoothing transformation. It will develop methods, grounded on the Cohen-Macaulay case, to predict properties of the `closure', devise algorithms to find it and examine the limits of the behavior of arbitrary [even unknown] algorithms. The methods and results used in these developments will be used for interaction where the subject meets algebraic geometry, combinatorics, geometric modelling, number theory and robotics.

Agency
National Science Foundation (NSF)
Institute
Division of Mathematical Sciences (DMS)
Type
Standard Grant (Standard)
Application #
0500359
Program Officer
Tomek Bartoszynski
Project Start
Project End
Budget Start
2005-07-01
Budget End
2010-06-30
Support Year
Fiscal Year
2005
Total Cost
$103,001
Indirect Cost
Name
Rutgers University
Department
Type
DUNS #
City
New Brunswick
State
NJ
Country
United States
Zip Code
08901