ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Part 1 (real algebraic curves and surfaces).

For a homogeneous polynomial F∈R[x0,x1,x2]F\in\mathbb{R}[x_0,x_1,x_2] of degree nn whose complex zero set in CP2\mathbb{CP}^2 is nonsingular, let

RCF={[x0:x1:x2]∈RP2: F(x0,x1,x2)=0},\mathbb{R}C_F=\{[x_0:x_1:x_2]\in\mathbb{RP}^2:\ F(x_0,x_1,x_2)=0\},

a (possibly empty) disjoint union of finitely many smoothly embedded circles, called the branches of the curve. A branch is called an oval if it bounds a disc in RP2\mathbb{RP}^2; the complement of an oval in RP2\mathbb{RP}^2 has one component homeomorphic to a disc (its interior) and one homeomorphic to a Möbius band (its exterior), and two disjoint ovals are nested when one lies in the interior of the other. The number of branches satisfies

#{branches of RCF} ≤ (n−1)(n−2)2+1,\#\{\text{branches of }\mathbb{R}C_F\}\ \le\ \frac{(n-1)(n-2)}{2}+1,

and FF is called an M-curve of degree nn when equality holds.

By the arrangement of RCF\mathbb{R}C_F is meant the isotopy class of the pair (RP2,RCF)(\mathbb{RP}^2,\mathbb{R}C_F), i.e. the position of the branches in the plane, including the nesting relation among the ovals.

Determine, for each integer n≥1n\ge 1, the set of arrangements realized by RCF\mathbb{R}C_F as FF ranges over all degree-nn homogeneous real polynomials with nonsingular complex zero set, and in particular the set of arrangements realized by M-curves of degree nn.

Correspondingly, for a homogeneous G∈R[x0,x1,x2,x3]G\in\mathbb{R}[x_0,x_1,x_2,x_3] of degree nn with nonsingular complex zero set, let

RSG={[x0:x1:x2:x3]∈RP3: G(x0,x1,x2,x3)=0},\mathbb{R}S_G=\{[x_0:x_1:x_2:x_3]\in\mathbb{RP}^3:\ G(x_0,x_1,x_2,x_3)=0\},

a disjoint union of finitely many closed surfaces (the sheets of the surface). Determine, for each n≥1n\ge 1, the maximal possible number of sheets of RSG\mathbb{R}S_G, together with their possible topological types and their possible mutual positions in RP3\mathbb{RP}^3 (i.e. the isotopy class of the pair (RP3,RSG)(\mathbb{RP}^3,\mathbb{R}S_G)); in particular, decide the maximal number of sheets for n=4n=4.

Part 2 (limit cycles of polynomial vector fields).

For real polynomials P,Q∈R[x,y]P,Q\in\mathbb{R}[x,y], not both identically zero, consider the planar system

dxdt=P(x,y),dydt=Q(x,y).\frac{dx}{dt}=P(x,y),\qquad \frac{dy}{dt}=Q(x,y).

A limit cycle of this system is a periodic orbit Γ⊂R2\Gamma\subset\mathbb{R}^2 that is isolated among periodic orbits, i.e. some annular neighbourhood of Γ\Gamma contains no periodic orbit other than Γ\Gamma. For an integer n≥1n\ge 1 put

H(n)=sup⁡{ #{limit cycles of (P,Q)} : P,Q∈R[x,y], deg⁡P≤n, deg⁡Q≤n, (P,Q)≢(0,0)}.H(n)=\sup\Big\{\,\#\{\text{limit cycles of }(P,Q)\}\ :\ P,Q\in\mathbb{R}[x,y],\ \deg P\le n,\ \deg Q\le n,\ (P,Q)\not\equiv(0,0)\Big\}.

For every integer n≥2n\ge 2, H(n)<∞H(n)<\infty.

Moreover, determine the value of H(n)H(n) for each nn, and determine the possible mutual positions of the limit cycles of such a system, i.e. which configurations of nested and non-nested closed curves in R2\mathbb{R}^2 arise as the family of limit cycles of a polynomial vector field of degree at most nn.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.