Existence of solutions for a nonperiodic semilinear Schrödinger equation

In this paper we consider a class of semilinear Schrödinger equation which terms are asymptotically periodic at infinity. Under a weaker superquadratic condition on the nonlinearity, the existence of a ground state solution is established. The main tools employed here to overcome the new difficulties are the concentration-compactness principle and the Local Mountain Pass Theorem.     

The noncommutative Wiener lemma, linear independence, and spectral properties of the algebra of time-frequency shift operators

In this paper we analyze the Banach *-algebra of time-frequency shifts with absolutely summable coefficients. We prove a noncommutative version of the Wiener lemma. We also construct a faithful tracial state on this algebra which proves the algebra contains no compact operators. As a corollary we obtain a special case of the Heil-Ramanathan-Topiwala conjecture regarding linear independence of finitely many time-frequency shifts of one function. We also estimate the coefficient decay of the inverse of finite linear combinations of time-frequency shifts.

     

Periodic solutions of sublinear Liénard differential equations

In this paper, we study the existence of periodic solutions of the second order differential equations x^″+f(x)x^′+g(x)=e(t). Using continuation lemma, we obtain the existence of periodic solutions provided that F(x) () is sublinear when x tends to positive infinity and g(x) satisfies a new condition

where M, d are two positive constants.     

Turán's theorem for pseudo-random graphs

The generalized Turán number ex(G,H) of two graphs G and H is the maximum number of edges in a subgraph of G not containing H. When G is the complete graph Km on m vertices, the value of ex(Km,H) is , where o(1)→0 as m→∞, by the Erd?s-Stone-Simonovits theorem.In this paper we give an analogous result for triangle-free graphs H and pseudo-random graphs G. Our concept of pseudo-randomness is inspired by the jumbled graphs introduced by Thomason [A. Thomason, Pseudorandom graphs, in: Random Graphs '85, Poznań, 1985, North-Holland, Amsterdam, 1987, pp. 307-331. MR 89d:05158]. A graph G is (q,β)-bi-jumbled if

     

Quasilinear elliptic equations with BMO coefficients in Lipschitz domains

We obtain a global estimate for the weak solution to an elliptic partial differential equation of -Laplacian type with BMO coefficients in a Lipschitz domain with small Lipschitz constant.

     

Packing tripods: Narrowing the density gap

In 1984, Stein and his co-authors posed a problem concerning simple three-dimensional shapes, known as semicrosses, or tripods. By definition, a tripod of order n is formed by a corner and the three adjacent edges of an integer n×n×n cube. How densely can one fill the space with non-overlapping tripods of a given order? In particular, is it possible to fill a constant fraction of the space as tripod order tends to infinity? In this paper, we settle the second question in the negative: the fraction of the space that can be filled with tripods must be infinitely small as the order grows. We also make a step towards the solution of the first question, by improving the currently known asymptotic lower bound on tripod packing density, and by presenting some computational results on low-order packings.     

On a characteristic equation of well-poised Bailey chains

In this paper, we find by inverse technique two solutions of a system of linear equations which together serve as a sufficient and necessary condition for well-poised Bailey chains. Using these two solutions, we establish a new well-poised Bailey chain, two usual Bailey chains, and a well-poised extension of Bailey’s lemma. Their applications to q-series are also investigated. X. Ma was supported by Natural Science Foundation of China (No. 10771156).     

Rademacher complexity in Neyman-Pearson classification

Neyman-Pearson（NP） criterion is one of the most important ways in hypothesis testing. It is also a criterion for classification. This paper addresses the problem of bounding the estimation error of NP classification, in terms of Rademacher averages. We investigate the behavior of the global and local Rademacher averages, and present new NP classification error bounds which are based on the localized averages, and indicate how the estimation error can be estimated without a priori knowledge of the class at hand.