Efficient Smooth Stratification of an Algebraic Variety in Zero Characteristic and Its Applications

Consider a projective algebraic variety V defined as the set of common zeros of a family of homogeneous polynomials of degree less than d in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$n + 1$$ \end{document} variables with coefficients from a field k of zero characteristic. We prove that V can be represented as a union (respectively, a disjoint union) of at most \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$C(n)d^n $$ \end{document} (respectively, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$C(n)d^{n{\text{(}}n{\text{ + 1)/2}}} $$ \end{document}) smooth quasiprojective algebraic varieties such that the degrees of these varieties are bounded from above by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$C(n)d^{ n} $$ \end{document}, where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$C(n){\text{ < 2}}$$ \end{document} depends only on n. We propose algorithms for constructing regular sequences and sequences of local parameters for irreducible components of V and for computing the dimension of a real variety. The complexity of these algorithms is polynomial in the size of the input and in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$C(n)d^{ n} $$ \end{document}. Bibliography: 15 titles.