Period-set characterization conjecture for degree-one circle maps

Let S1{\mathbb S}^1 be the unit circle, let L1(S){\mathcal L}_1(S) denote the class of maps under consideration, and let FL1(S)F\in {\mathcal L}_1(S) have rotation interval

RotR(F)=[c,d].{\operatorname{Rot}}_{\mathbb R}(F)=[c,d].

For cdc\leq d, define

M(c,d)={nN:c<k/n<d for some integer k},M(c,d)=\{n\in\mathbb N: c<k/n<d\text{ for some integer }k\},

and, for ρR\rho\in\mathbb R and SNS\subset\mathbb N, define Λ(ρ,S)=\Lambda(\rho,S)=\varnothing when ρQ\rho\notin\mathbb Q, while Λ(ρ,S)={nq:qS}\Lambda(\rho,S)=\{nq:q\in S\} when ρ=k/n\rho=k/n in lowest terms. A tail of an ordering is a terminal subset of that ordering.

Period-set characterization conjecture. There exist sets Ec,EdNE_c,E_d\subset\mathbb N, each a finite union of tails of the orderings \leso2\leso{2} and \leso3\leso{3}, such that

Per(F)=Λ(c,Ec)M(c,d)Λ(d,Ed).\operatorname{Per}(F)=\Lambda(c,E_c)\cup M(c,d)\cup\Lambda(d,E_d).

Conversely, given c,dRc,d\in\mathbb R with cdc\leq d and nonempty sets Ec,EdNE_c,E_d\subset\mathbb N, each a finite union of tails of the orderings \leso2\leso{2} and \leso3\leso{3}, there exists a map FL1(S)F\in {\mathcal L}_1(S) with RotR(F)=[c,d]{\operatorname{Rot}}_{\mathbb R}(F)=[c,d] and

Per(F)=Λ(c,Ec)M(c,d)Λ(d,Ed).\operatorname{Per}(F)=\Lambda(c,E_c)\cup M(c,d)\cup\Lambda(d,E_d).

This conjecture seeks to extend Misiurewicz's characterization for degree-one circle maps from liftings on the real line to maps in L1(S){\mathcal L}_1(S). The preceding theorem gives the analogous characterization for real liftings; the asserted description for maps on the specified space remains open in the supplied source.

Sources & referencesView supporting material

Primary source

Lluís Alsedà and Sylvie Ruette, “On the set of periods of sigma maps of degree 1”, arXiv:1407.1419 (2015).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.