Classification of the centers and their isochronicity for a class of polynomial differential systems of arbitrary degree

In this paper we classify the centers localized at the origin of coordinates, and their isochronicity for the polynomial differential systems in R² of degree d that in complex notation z=x+iy can be written as where j is either 0 or 1. If j=0 then d?5 is an odd integer and n is an even integer satisfying 2?n?(d+1)/2. If j=1 then d?3 is an integer and n is an integer with converse parity with d and satisfying 0<n?[(d+1)/3] where [⋅] denotes the integer part function. Furthermore λ∈R and A,B,C,D∈C. Note that if d=3 and j=0, we are obtaining the generalization of the polynomial differential systems with cubic homogeneous nonlinearities studied in K.E. Malkin (1964) [17], N.I. Vulpe and K.S. Sibirskii (1988) [25], J. Llibre and C. Valls (2009) [15], and if d=2, j=1 and C=0, we are also obtaining as a particular case the quadratic polynomial differential systems studied in N.N. Bautin (1952) [2], H. Zoladek (1994) [26]. So the class of polynomial differential systems here studied is very general having arbitrary degree and containing the two more relevant subclasses in the history of the center problem for polynomial differential equations.     

A diffusion-type process with a given joint law for the terminal level and supremum at an independent exponential time

We construct a weak solution to the stochastic functional differential equation , where M_t=sup_0≤s≤tX_s. Using the excursion theory, we then solve explicitly the following problem: for a natural class of joint density functions μ(y,b), we specify σ(.,.), so that X is a martingale, and the terminal level and supremum of X, when stopped at an independent exponential time ξ_λ, is distributed according to μ. We can view (X_t∧ξλ) as an alternate solution to the problem of finding a continuous local martingale with a given joint law for the maximum and the drawdown, which was originally solved by Rogers (1993) [21] using the excursion theory. This complements the recent work of Carr (2009) [5] and Cox et al. (2010) [7], who consider a standard one-dimensional diffusion evaluated at an independent exponential time.¹     

Uniform well-posedness and inviscid limit for the Benjamin–Ono–Burgers equation

We prove that the Cauchy problem for the Benjamin–Ono–Burgers equation is uniformly globally well-posed in Hs (s?1) for all ε∈[0,1]. Moreover, we show that as ε→0 the solution converges to that of Benjamin–Ono equation in C([0,T]:Hs) (s?1) for any T>0. Our results give an alternative proof for the global well-posedness of the BO equation in H¹(R) without using gauge transform, which was first obtained by Tao (2004) [23], and also solve the problem addressed in Tao (2004) [23] about the inviscid limit behavior in H¹.     

Functions of normal operators under perturbations

In Peller (1980) [27], Peller (1985) [28], Aleksandrov and Peller (2009) [2], Aleksandrov and Peller (2010) [3], and Aleksandrov and Peller (2010) [4] sharp estimates for f(A)−f(B) were obtained for self-adjoint operators A and B and for various classes of functions f on the real line R. In this paper we extend those results to the case of functions of normal operators. We show that if a function f belongs to the Hölder class Λα(R²), 0<α<1, of functions of two variables, and N₁ and N₂ are normal operators, then ‖f(N₁)−f(N₂)‖?const‖fΛα_‖‖N₁−N₂α^‖. We obtain a more general result for functions in the space for an arbitrary modulus of continuity ω. We prove that if f belongs to the Besov class , then it is operator Lipschitz, i.e., . We also study properties of f(N₁)−f(N₂) in the case when f∈Λα(R²) and N₁−N₂ belongs to the Schatten–von Neumann class Sp.     

Moment vanishing problem and positivity: Some examples

We consider the problem of vanishing of the momentswith Ω a compact domain in Rn and P(x), q(x) complex polynomials in x∈Ω (MVP). The main stress is on relations of this general vanishing problem to the following conjecture which has been studied recently in Mathieu (1997) [22], Duistermaat and van der Kallen (1998) [17], Zhao (2010) [34] and [35] and in other publications in connection with the vanishing problem for differential operators and with the Jacobian conjecture:

Conjecture A. 

For positive μ ifmk(P,1)=0fork=1,2,… , thenmk(P,q)=0fork?1for any q.     

New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems

We consider the bounded integer knapsack problem (BKP) , subject to: , and x_j{0,1,…,m_j},j=1,…,n. We use proximity results between the integer and the continuous versions to obtain an O(n³W²) algorithm for BKP, where W=max_j=1,…,nw_j. The respective complexity of the unbounded case with m_j=∞, for j=1,…,n, is O(n²W²). We use these results to obtain an improved strongly polynomial algorithm for the multicover problem with cyclical 1’s and uniform right-hand side.     

On weighted Lebesgue function type sums

Let I be a finite or infinite interval and dμ a measure on I. Assume that the weight function w(x)>0, w^′(x) exists, and the function w^′(x)/w(x) is non-increasing on I. Denote by ℓ_k's the fundamental polynomials of Lagrange interpolation on a set of nodes x₁<x₂<<x_n in I. The weighted Lebesgue function type sum for 1≤i<j≤n and s≥1 is defined by

In this paper the exact lower bounds of S_n(x) on a “big set” of I and are obtained. Some applications are also given.     

The quaternionic evolution operator

In the recent years, the notion of slice regular functions has allowed the introduction of a quaternionic functional calculus. In this paper, motivated also by the applications in quaternionic quantum mechanics, see Adler (1995) [1], we study the quaternionic semigroups and groups generated by a quaternionic (bounded or unbounded) linear operator T=T₀+iT₁+jT₂+kT₃. It is crucial to note that we consider operators with components T?(?=0,1,2,3) that do not necessarily commute. Among other results, we prove the quaternionic version of the classical Hille–Phillips–Yosida theorem. This result is based on the fact that the Laplace transform of the quaternionic semigroup etT is the S-resolvent operator , the quaternionic analogue of the classical resolvent operator. The noncommutative setting entails that the results we obtain are somewhat different from their analogues in the complex setting. In particular, we have four possible formulations according to the use of left or right slice regular functions for left or right linear operators.     

A pattern sequence approach to Stern’s sequence

Suppose that w∈1{0,1}^∗ and let a_w(n) be the number of occurrences of the word w in the binary expansion of n. Let {s(n)}_n?0 denote the Stern sequence, defined by s(0)=0, s(1)=1, and for n?1, In this note, we show that where denotes the complement of w (obtained by sending 0?1 and 1?0) and [w]₂ denotes the integer specified by the word w∈{0,1}^∗ interpreted in base 2.     

A further refinement of a three critical points theorem

In this paper, we complete the refinement process, made by Ricceri (2009) [4], of a result established by Ricceri (2000) [1], which is one of the most applied abstract multiplicity theorems in the past decade. A sample of application of our new result is as follows.Let (n≥3) be a bounded domain with smooth boundary and let .Then, for each ?>0 small enough, there exists λ_?>0 such that, for every compact interval , there exists ρ>0 with the following property: for every λ∈[a,b] and every continuous function satisfying for some , there exists δ>0 such that, for each ν∈[0,δ], the problem has at least three weak solutions whose norms in are less than ρ.     

Spectra of lifted Ramanujan graphs

A random n-lift of a base-graph G is its cover graph H on the vertices [n]×V(G), where for each edge uv in G there is an independent uniform bijection π, and H has all edges of the form (i,u),(π(i),v). A main motivation for studying lifts is understanding Ramanujan graphs, and namely whether typical covers of such a graph are also Ramanujan.Let G be a graph with largest eigenvalue λ₁ and let ρ be the spectral radius of its universal cover. Friedman (2003) [12] proved that every “new” eigenvalue of a random lift of G is with high probability, and conjectured a bound of ρ+o(1), which would be tight by results of Lubotzky and Greenberg (1995) [15]. Linial and Puder (2010) [17] improved Friedman?s bound to . For d-regular graphs, where λ₁=d and , this translates to a bound of O(d2/3), compared to the conjectured .Here we analyze the spectrum of a random n-lift of a d-regular graph whose nontrivial eigenvalues are all at most λ in absolute value. We show that with high probability the absolute value of every nontrivial eigenvalue of the lift is . This result is tight up to a logarithmic factor, and for λ?d2/3−ε it substantially improves the above upper bounds of Friedman and of Linial and Puder. In particular, it implies that a typical n-lift of a Ramanujan graph is nearly Ramanujan.     

A new upper bound for the total vertex irregularity strength of graphs

We investigate the following modification of the well-known irregularity strength of graphs. Given a total weighting w of a graph G=(V,E) with elements of a set {1,2,…,s}, denote wt_G(v)=∑_evw(e)+w(v) for each vV. The smallest s for which exists such a weighting with wt_G(u)≠wt_G(v) whenever u and v are distinct vertices of G is called the total vertex irregularity strength of this graph, and is denoted by . We prove that for each graph of order n and with minimum degree δ>0.     

Optimal bounds for a colorful Tverberg–Vre?ica type problem

We prove the following optimal colorful Tverberg–Vre?ica type transversal theorem: For prime r and for any k+1 colored collections of points C? in Rd, , |C?|=(r−1)(d−k+1)+1, , ?=0,…,k, there are partitions of the collections C? into colorful sets such that there is a k-plane that meets all the convex hulls , under the assumption that r(d−k) is even or k=0.Along the proof we obtain three results of independent interest: We present two alternative proofs for the special case k=0 (our optimal colored Tverberg theorem (2009) [2]), calculate the cohomological index for joins of chessboard complexes, and establish a new Borsuk–Ulam type theorem for m(Zp)-equivariant bundles that generalizes results of Volovikov (1996) [17] and ?ivaljevi? (1999) [21].     

The higher-order Picone identity and comparison of half-linear differential equations of even order

An identity of the Picone type for higher-order half-linear ordinary differential operators of the form and where p_j and P_j, j=0,…,n, are continuous functions defined on [a,b] and , is derived and then the Sturmian comparison theory for the corresponding 2nth-order equations l_α[x]=0 and L_α[y]=0 based on this identity is developed.     

Radially increasing minimizing surfaces or deformations under pointwise constraints on positions and gradients

In this paper, we prove existence of radially symmetric minimizersu_A(x)=U_A(|x|), having U_A(⋅)AC monotone and increasing, for the convex scalar multiple integral(∗ ) among those u(⋅) in the Sobolev space. Here, |∇u(x)| is the Euclidean norm of the gradient vector and B_R is the ball ; while A is the boundary data.Besides being e.g. superlinear (but no growth needed if (∗) is known to have minimum), our Lagrangian?^∗∗:R×R→[0,∞] is just convex lsc and and ?^∗∗(s,⋅) is even; while ρ₁(⋅) and ρ₂(⋅) are Borel bounded away from .Remarkably, (∗) may also be seen as the calculus of variations reformulation of a distributed-parameter scalar optimal control problem. Indeed, state and gradient pointwise constraints are, in a sense, built-in, since ?^∗∗(s,v)=∞ is freely allowed.     

Hamilton cycles in random lifts of graphs

An n-lift of a graph K is a graph with vertex set V(K)×[n], and for each edge (i,j)E(K) there is a perfect matching between {i}×[n] and {j}×[n]. If these matchings are chosen independently and uniformly at random then we say that we have a random n-lift. We show that there are constants h₁,h₂ such that if h≥h₁ then a random n-lift of the complete graph K_h is hamiltonian and if h≥h₂ then a random n-lift of the complete bipartite graph K_h,h is hamiltonian .     

On a conjecture of Shanks

The conjecture in question concerns the function ?n related to the distribution of the zeroes of the Riemann zeta-function, γn, over the Gram points gn. It is the purpose of this article to show that for any α>0 the sum and this was conjectured, on numerical evidence, by Shanks (1961) [7] to be true for .     

On the sampling and recovery of bandlimited functions via scattered translates of the Gaussian

Let λ be a positive number, and let be a fixed Riesz-basis sequence, namely, (x_j) is strictly increasing, and the set of functions is a Riesz basis (i.e., unconditional basis) for L₂[−π,π]. Given a function whose Fourier transform is zero almost everywhere outside the interval [−π,π], there is a unique sequence in , depending on λ and f, such that the function

is continuous and square integrable on (−∞,∞), and satisfies the interpolatory conditions I_λ(f)(x_j)=f(x_j), . It is shown that I_λ(f)converges to f in , and also uniformly on , as λ→0⁺. In addition, the fundamental functions for the univariate interpolation process are defined, and some of their basic properties, including their exponential decay for large argument, are established. It is further shown that the associated interpolation operators are bounded on for every p[1,∞].     

Approximation of RNA multiple structural alignment

In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou (2006) introduced in [7] the problem of finding the largest nested linear graph that occurs in a set G of linear graphs, the so-called Max-NLS problem. This problem generalizes both the longest common subsequence problem and the maximum common homeomorphic subtree problem for rooted ordered trees.In the present paper, we give a fast algorithm for finding the largest nested linear subgraph of a linear graph and a polynomial-time algorithm for a fixed number (k) of linear graphs. Also, we strongly strengthen the result of Davydov and Batzoglou (2006) [7] by proving that the problem is NP-complete even if G is composed of nested linear graphs of height at most 2, thereby precisely defining the borderline between tractable and intractable instances of the problem. Of particular importance, we improve the result of Davydov and Batzoglou (2006) [7] by showing that the Max-NLS problem is approximable within ratio in O(kn²) running time, where mopt is the size of an optimal solution. We also present O(1)-approximation of Max-NLS problem running in O(kn) time for restricted linear graphs. In particular, for ncRNA derived linear graphs, a -approximation is presented.     

A note on 3-Steiner intervals and betweenness

The geodesic and geodesic interval, namely the set of all vertices lying on geodesics between a pair of vertices in a connected graph, is a part of folklore in metric graph theory. It is also known that Steiner trees of a (multi) set with k (k>2) vertices, generalize geodesics. In Brešar et al. (2009) [1], the authors studied the k-Steiner intervals S(u₁,u₂,…,u_k) on connected graphs (k≥3) as the k-ary generalization of the geodesic intervals. The analogous betweenness axiom (b2) and the monotone axiom (m) were generalized from binary to k-ary functions as follows. For any u₁,…,u_k,x,x₁,…,x_k∈V(G) which are not necessarily distinct, The authors conjectured in Brešar et al. (2009) [1] that the 3-Steiner interval on a connected graph G satisfies the betweenness axiom (b2) if and only if each block of G is geodetic of diameter at most 2. In this paper we settle this conjecture. For this we show that there exists an isometric cycle of length 2k+1, k>2, in every geodetic block of diameter at least 3. We also introduce another axiom (b2(2)), which is meaningful only to 3-Steiner intervals and show that this axiom is equivalent to the monotone axiom.