<p>We introduce the notion of domain of finite type <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\mathscr {D}\subset {\mathbb {R}}^n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">D</mi> <mo>⊂</mo> <msup> <mrow> <mi mathvariant="double-struck">R</mi> </mrow> <mi>n</mi> </msup> </mrow> </math></EquationSource> </InlineEquation> generalizing an earlier work of Bodin, Popescu-Pampu and Sorea. Then, we prove that every finite graph admitting a good orientation whose vertices have degree 1 or 3 can be realized as the Poincaré-Reeb graph of a stable (globally) algebraic domain of finite type <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\mathscr {D}\subset {\mathbb {R}}^n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">D</mi> <mo>⊂</mo> <msup> <mrow> <mi mathvariant="double-struck">R</mi> </mrow> <mi>n</mi> </msup> </mrow> </math></EquationSource> </InlineEquation>, for every <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(n\ge 2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≥</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation>. If in addition <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(n\ge 3\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≥</mo> <mn>3</mn> </mrow> </math></EquationSource> </InlineEquation>, we construct a class of graphs allowing vertices of degree 2 also. Algebraic approximation techniques á la Nash-Tognoli and stable Morse functions are fundamental tools in our approach. In particular, the recent extensions over <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\({\mathbb {Q}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">Q</mi> </math></EquationSource> </InlineEquation> of such algebraic approximation techniques developed by Ghiloni and the author allow us to reduce the coefficients of the describing polynomials over <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\({\mathbb {Q}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">Q</mi> </math></EquationSource> </InlineEquation> and to extend our constructions over real closed fields.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Algebraic realization of stable Poincaré-Reeb graphs

  • Enrico Savi

摘要

We introduce the notion of domain of finite type \(\mathscr {D}\subset {\mathbb {R}}^n\) D R n generalizing an earlier work of Bodin, Popescu-Pampu and Sorea. Then, we prove that every finite graph admitting a good orientation whose vertices have degree 1 or 3 can be realized as the Poincaré-Reeb graph of a stable (globally) algebraic domain of finite type \(\mathscr {D}\subset {\mathbb {R}}^n\) D R n , for every \(n\ge 2\) n 2 . If in addition \(n\ge 3\) n 3 , we construct a class of graphs allowing vertices of degree 2 also. Algebraic approximation techniques á la Nash-Tognoli and stable Morse functions are fundamental tools in our approach. In particular, the recent extensions over \({\mathbb {Q}}\) Q of such algebraic approximation techniques developed by Ghiloni and the author allow us to reduce the coefficients of the describing polynomials over \({\mathbb {Q}}\) Q and to extend our constructions over real closed fields.