Lower bounds for the Hilbert number of polynomial systems

Let $H(m)$ denote the maximal number of limit cycles of polynomial systems of degree m. It is called the Hilbert number. The main part of Hilbert?s 16th problem posed in 1900 is to find its value. The problem is still open even for $m=2$. However, there have been many interesting results on the lower bound of it for $m?2$. In this paper, we give some new lower bounds of this number. The results obtained in this paper improve all existing results for all $m?7$ based on some known results for $m=3,4,5,6$. In particular, we obtain that $H(m)$ grows at least as rapidly as $\frac{1}{2\ln 2}{(m+2)}^2\ln (m+2)$ for all large m.     

On the geography of threefolds of general type

Let X be a complex nonsingular projective 3-fold of general type. We show that there are positive constants c, $c^{\prime }$ and $m_1$ such that $\chi ({\omega }_X)??c\mathrm{Vol}(X)$ and $P_m(X)?c^{\prime }{m}^3\mathrm{Vol}(X)$ for all $m?m_1$.     

Tighter approximation bounds for LPT scheduling in two special cases

$Q||C_{\max }$ denotes the problem of scheduling n jobs on m machines of different speeds such that the makespan is minimized. In the paper two special cases of $Q||C_{\max }$ are considered: case I, when $m?1$ machine speeds are equal, and there is only one faster machine; and case II, when machine speeds are all powers of 2 (2-divisible machines). Case I has been widely studied in the literature, while case II is significant in an approach to design so called monotone algorithms for the scheduling problem.We deal with the worst case approximation ratio of the classic list scheduling algorithm ‘Largest Processing Time (LPT)’. We provide an analysis of this ratio $\mathit{Lpt}/\mathit{Opt}$ for both special cases: For ‘one fast machine’, a tight bound of $(\sqrt{3}+1)/2\approx 1.3660$ is given. For 2-divisible machines, we show that in the worst case $1.3673<\mathit{Lpt}/\mathit{Opt}<1.4$. Besides, we prove another lower bound of $955/699>(\sqrt{3}+1)/2$ when LPT breaks ties arbitrarily.To our knowledge, the best previous lower and upper bounds were $(4/3,3/2?1/2m]$ in case I [T. Gonzalez, O.H. Ibarra, S. Sahni, Bounds for LPT schedules on uniform processors, SIAM Journal on Computing 6 (1) (1977) 155–166], respectively $[4/3?1/3m,3/2]$ in case II [R.L. Graham, Bounds on multiprocessing timing anomalies, SIAM Journal on Applied Mathematics 17 (1969) 416–429; A. Kovács, Fast monotone 3-approximation algorithm for scheduling related machines, in: Proc. 13th Europ. Symp. on Algs. (ESA), in: LNCS, vol. 3669, Springer, 2005, pp. 616–627]. Moreover, Gonzalez et al. conjectured the lower bound 4/3 to be tight in the ‘one fast machine’ case [T. Gonzalez, O.H. Ibarra, S. Sahni, Bounds for LPT schedules on uniform processors, SIAM Journal on Computing 6 (1) (1977) 155–166].     

Transcendence degree one function fields over a finite field with many automorphisms

Let $\mathbb{K}$ be the algebraic closure of a finite field ${\mathbb{F}}_q$ of odd characteristic p. For a positive integer m prime to p, let $F=\mathbb{K}(x,y)$ be the transcendence degree 1 function field defined by $y^q+y=x^m+x^{?m}$. Let $t=x^{m(q?1)}$ and $H=\mathbb{K}(t)$. The extension $F|H$ is a non-Galois extension. Let K be the Galois closure of F with respect to H. By Stichtenoth [20], K has genus $\mathfrak{g}(K)=(qm?1)(q?1)$, p-rank (Hasse–Witt invariant) $\gamma (K)={(q?1)}^2$ and a $\mathbb{K}$-automorphism group of order at least $2q^{2}m(q?1)$. In this paper we prove that this subgroup is the full $\mathbb{K}$-automorphism group of K; more precisely ${\text{Aut}}_{\mathbb{K}}(K)=\mathrm{\Delta }?D$ where Δ is an elementary abelian p-group of order $q^2$ and D has an index 2 cyclic subgroup of order $m(q?1)$. In particular, $\sqrt{m}|{\text{Aut}}_{\mathbb{K}}(K)|>\mathfrak{g}{(K)}^{3/2}$, and if K is ordinary (i.e. $\mathfrak{g}(K)=\gamma (K)$) then $|{\text{Aut}}_{\mathbb{K}}(K)|>{\mathfrak{g}}^{3/2}$. On the other hand, if G is a solvable subgroup of the $\mathbb{K}$-automorphism group of an ordinary, transcendence degree 1 function field L of genus $\mathfrak{g}(L)\ge 2$ defined over $\mathbb{K}$, then $|{\text{Aut}}_{\mathbb{K}}(K)|\le 34{(\mathfrak{g}(L)+1)}^{3/2}<68\sqrt{2}\mathfrak{g}{(L)}^{3/2}$; see [15]. This shows that K hits this bound up to the constant $68\sqrt{2}$.Since ${\text{Aut}}_{\mathbb{K}}(K)$ has several subgroups, the fixed subfield $F^N$ of such a subgroup N may happen to have many automorphisms provided that the normalizer of N in ${\text{Aut}}_{\mathbb{K}}(K)$ is large enough. This possibility is worked out for subgroups of Δ.     

The adversary degree-associated reconstruction number of double-brooms

A vertex-deleted subgraph of a graph G is a card. A dacard specifies the degree of the deleted vertex along with the card. The adversary degree-associated reconstruction number $\mathrm{adrn}(G)$ is the least k such that every set of k dacards determines G. We determine $\mathrm{adrn}(D_{m,n,p})$, where the double-broom $D_{m,n,p}$ with $p\ge 2$ is the tree with $m+n+p$ vertices obtained from a path with p vertices by appending m leaves at one end and n leaves at the other end. We determine $\mathrm{adrn}(D_{m,n,p})$ for all $m,n,p$. For $2\le m\le n$, usually $\mathrm{adrn}(D_{m,n,p})=m+2$, except $\mathrm{adrn}(D_{m,m+1,p})=m+1$ and $\mathrm{adrn}(D_{m,m+2,p})=m+3$. There are exceptions when $(m,n)=(2,3)$ or $p=4$. For $m=1$ the usual value is 4, with exceptions when $p\in \{2,3\}$ or $n=2$.     

On the semiclassical approximation to the eigenvalue gap of Schrödinger operators

We consider two types of Schrödinger operators $H(t)=?d^2/d{x}^2+q(x)+t\cos x$ and $H(t)=?d^2/d{x}^2+q(x)+A\cos (tx)$ defined on $L^2(\mathbb{R})$, where q is an even potential that is bounded from below, A is a constant, and $t>0$ is a parameter. We assume that $H(t)$ has at least two eigenvalues below its essential spectrum; and we denote by ${\lambda }_1(t)$ and ${\lambda }_2(t)$ the lowest eigenvalue and the second one, respectively. The purpose of this paper is to study the asymptotics of the gap $\Gamma (t)={\lambda }_2(t)?{\lambda }_1(t)$ in the limit as $t\to \infty$.     

On a discrete bilinear singular operator

We prove that for a large class of functions P and Q, the discrete bilinear operator $T_{P,Q}(f,g)(n)={\sum }_{m\in \mathbb{Z}?\{0\}}f(n?P(m))g(n?Q(m))\frac{1}{m}$ is bounded from $l^2\times l^2$ into $l^{1+?,\infty }$ for any $?\in (0,1]$.     

On a nonlinear Schrödinger equation with a localizing effect

We consider the nonlinear Schrödinger equation associated to a singular potential of the form $a{|u|}^{?(1?m)}u+bu$, for some $m\in (0,1)$, on a possible unbounded domain. We use some suitable energy methods to prove that if $\mathrm{Re}(a)+\mathrm{Im}(a)>0$ and if the initial and right hand side data have compact support then any possible solution must also have a compact support for any $t>0$. This property contrasts with the behavior of solutions associated to regular potentials $(m?1)$. Related results are proved also for the associated stationary problem and for self-similar solution on the whole space and potential $a{|u|}^{?(1?m)}u$. The existence of solutions is obtained by some compactness methods under additional conditions. To cite this article: P. Bégout, J.I. Díaz, C. R. Acad. Sci. Paris, Ser. I 342 (2006).     

Sur les bornes inférieures de l'écart des variétés invariantes

Let m be an integer ?3, set $?(r)=\frac{1}{2}(r_1^2+?+r_{m?1}^2)+r_m$ for $r\in {\mathbb{R}}^m$, and consider a badly approximable vector ${\overline{\omega }}^0\in {\mathbb{R}}^{m?2}$. Fix $\alpha >1$, $L>0$ and $R>1+6{\overline{\omega }}^0{6}_{\infty }$. We construct a sequence $(H_N)$ of $\text{Gevrey}\text{-}(\alpha ,L)$ Hamiltonian functions of ${\mathbb{T}}^m\times {\overline{B}}_{\infty }(0,R)$, which converges to ? when $N\to \infty$, such that for each N the system generated by $H_N$ possesses a $(m?1)$-dimensional hyperbolic invariant torus with fixed frequency vector $({\overline{\omega }}^0,1)$, which admits a homoclinic point with splitting matrix of the form $\mathrm{diag}(0,{\nu }_N,\dots ,{\nu }_N,0)\in M_m(\mathbb{R})$, with ${\nu }_N?\exp (?c{(\frac{1}{{?}_N})}^{\raisebox{1ex}{$1$}\!\left/ \!\raisebox{-1ex}{$2(\alpha ?1)(m?2)$}\right.})$, where ${?}_N:=6H_N??6_{\alpha ,L}$ and $c>0$. To cite this article: J.-P. Marco, C. R. Acad. Sci. Paris, Ser. I 340 (2005).