 Consider the family of algebraic functions: $$f_N(z,w)=z\prod_{j=1}^{N}(wj)^j=0,\quad N\geq 2$$ and their associated set of power expansions $\left\{w_d(z)\right\}_{d=1}^{N}$ with $w_d(z)=\displaystyle\sum_{n=0}^{\infty} c_n \left(z^{1/d}\right)^n.$ The $w_1(z)$ branches for members up to $N=10$ have radii of convergences extending out to the most distant singular point of $f_N$. Is this the case for all $f_N$?
 Can an algorithm similar to Newton Polygon be devised to compute annular Puiseux series?

Can a folded version of Buchberger's algorithm be derived? See Folded polynomial systems. for background on folded systems.
Consider the quadratic polynomial system $f(x,y)\in\mathbb{Q}[x,y]$: $$ f(x,y)=\left\{\begin{array}{c} a_0+a_1x+a_2y+a_3x^2+a_4y^2+a_5xy\\ b_0+b_1x+b_2y+b_3x^2+b_4y^2+b_5xy \end{array}\right\} $$ with $a_i,b_i\neq 0$ and absolute value less than one . A fixedpoint $(x_f,y_f)$ is a point such that $f(x_f,y_f)=(x_f,y_f)$. Next consider a fixed point of the $n$folded system: $$ f^{((n))}(x_f,y_f)=\underbrace{f(f(f(\cdots f))\cdots)}_{\text{ntimes}}=(x_f,y_f) $$ This is equivalent to solving for the roots of $F^{((n))}\{x,y\}$. Computing a Groebner basis for $f^{((n))}\{x,y\}$ directly using Buchberger's algorithm for anything but small systems is practically inaccessible computationally. Is is possible to derive a more efficient version of Buchberger's algorithm that takes advantage of the folded properties of $f^{((n))}$? That is, can a folded version of Buchberger's algorithm be devised to improve the computation speed of computing a Groebner basis for $f^{((n))}\{x,y\}$?

If a system $f(z,w)=\{g(z,w),h(z,w)\}\{z,w\}$ has finite dimension, that is to say it has a finite number of zeros, under what conditions is the folded system $f^{((n))}\{z,w\}$ also finite dimensional?
Menu
 Home
 Introduction
 Section 0: Preliminaries
 Section 1: Plotting Algebraic Functions
 Section 2: An Improved Plotting Method
 Section 3: Applying Laurent's Theorem to Algebraic Functions
 Section 4: Applying the Residue Theorem to Algebraic Functions
 Section 11: Riemann Surfaces
 Section 12: Evaluating the Indeterminant Form
 Puiseux Series
 Section 6: Puiseux Series (Background)
 Section 7: Puiseux Series (Examples)
 Section 8: Designing doPuiseux
 Section 9: Finite power series
 Section 10: Region of convergence of algebraic power series
 Section 13: Analyzing the Annular Laurent Integrals
 Section 14: Analyzing the Annular Laurent Puiseux Series
 Mathematica Code
 Useful links
 Unsolved problems
 Iterations
Unsolved problems
$$
\newcommand{\bint}{\displaystyle{\int\hspace{10.4pt}\Large\mathit{8}}}
\newcommand{\res}{\displaystyle{\text{Res}}}
\newcommand{Log}{\text{Log}}
\newcommand{Arg}{\text{Arg}}
\newcommand{pLog}{\text{pLog}}
$$
Subscribe to:
Posts (Atom)
No comments:
Post a Comment