On planar intersection graphs with forbidden subgraphs

Let be a family of n compact connected sets in the plane, whose intersection graph has no complete bipartite subgraph with k vertices in each of its classes. Then has at most n times a polylogarithmic number of edges, where the exponent of the logarithmic factor depends on k. In the case where consists of convex sets, we improve this bound to O(n log n). If in addition k = 2, the bound can be further improved to O(n). © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 205–214, 2008     

Harrington’s conservation theorem redone

Leo Harrington showed that the second-order theory of arithmetic WKL ₀ is -conservative over the theory RCA ₀. Harrington’s proof is model-theoretic, making use of a forcing argument. A purely proof-theoretic proof, avoiding forcing, has been eluding the efforts of researchers. In this short paper, we present a proof of Harrington’s result using a cut-elimination argument.      

Robust stability analysis of stochastic neural networks with Markovian jumping parameters and probabilistic time‐varying delays

This article discusses the issue of robust stability analysis for a class of Markovian jumping stochastic neural networks (NNs) with probabilistic time‐varying delays. The jumping parameters are represented as a continuous‐time discrete‐state Markov chain. Using the stochastic stability theory, properties of Brownian motion, the information of probabilistic time‐varying delay, the generalized Ito's formula, and linear matrix inequality (LMI) technique, some novel sufficient conditions are obtained to guarantee the stochastical stability of the given NNs. In particular, the activation functions considered in this article are reasonably general in view of the fact that they may depend on Markovian jump parameters and they are more general than those usual Lipschitz conditions. The main features of this article are described in the following: first one is that, based on generalized Finsler lemma, some improved delay‐dependent stability criteria are established and the second one is that the nonlinear stochastic perturbation acting on the system satisfies a class of Lipschitz linear growth conditions. By resorting to the Lyapunov–Krasovskii stability theory and the stochastic analysis tools, sufficient stability conditions are established using an efficient LMI approach. Finally, two numerical examples and its simulations are given to demonstrate the usefulness and effectiveness of the proposed results. © 2014 Wiley Periodicals, Inc. Complexity 21: 59–72, 2016     

关于全纯映照模的Schwarz引理一点注记

记DC为单位圆盘,B~k C~k为开欧氏单位球,Ω是C~k(或C)中的域.记H_n(D,Ω)为满足一定条件的全纯映照族(或函数族)的全体.作者证明了若,∈Hn(D,D),则|f′(z)|≤(n|z|~(n-1))/(1-|z|~(2n))(1-|f|(z|~2),z∈DD同时,对Hn(D,B~k)中映照的模也得到类似的结果.该结论推广了Pavlovic的相应结果.     

单位球上星形映射在极值点处的偏差定理

利用多复变数的边界型Schwarz引理,建立了C~n中单位球上正规化双全纯星形映射在极值点处的行列式型偏差定理和矩阵型偏差定理.     

Sobolev方程一个新的H~1-Galerkin混合有限元分析

研究了Sobolev方程的H~1-Galerkin混合有限元方法.利用不完全双二次元Q_2~-和一阶BDFM元,建立了一个新的混合元模式,通过Bramble-Hilbert引理,证明了单元对应的插值算子具有的高精度结果.进一步,对于半离散和向后欧拉全离散格式,分别导出了原始变量u在H~1-模和中间变量p在H(div)-模意义下的超逼近性质.     

Multiplicity of solutions for Kirchhoff type equations involving critical Sobolev exponents in high dimension

In this paper, we study the following Kirchhoff‐type elliptic problem where is a bounded domain with smooth boundary ?Ω, a,b,λ,μ > 0 and 1 < q < 2^?=2N/(N ? 2). When N = 4, we obtain that there is a ground state solution to the problem for q∈(2,4) by using a variational methods constrained on the Nehari manifold and also show the problem possesses infinitely many negative energy solutions for q∈(1,2) by applying usual Krasnoselskii genus theory. In addition, we admit that there is a positive solution to the equations for N≥5 under some suitable conditions. Copyright © 2016 John Wiley & Sons, Ltd.     

Multidimensional van der Corput and sublevel set estimates

Van der Corput's lemma gives an upper bound for one-dimensional oscillatory integrals that depends only on a lower bound for some derivative of the phase, not on any upper bound of any sort. We establish generalizations to higher dimensions, in which the only hypothesis is that a partial derivative of the phase is assumed bounded below by a positive constant. Analogous upper bounds for measures of sublevel sets are also obtained. The analysis, particularly for the sublevel set estimates, has a more combinatorial flavour than in the one-dimensional case.

     

Du Bois–Reymond Type Lemma and Its Application to Dirichlet Problem with the p(t)–Laplacian on a Bounded Time Scale

This paper is devoted to study the existence of solutions and their regularity in the p(t)–Laplacian Dirichlet problem on a bounded time scale. First, we prove a lemma of du Bois–Reymond type in time-scale settings. Then, using direct variational methods and the mountain pass methodology, we present several sufficient conditions for the existence of solutions to the Dirichlet problem.     

Tiny families of functions with random properties: A quality-size trade-off for hashing

We present three explicit constructions of hash functions, which exhibit a trade-off between the size of the family (and hence the number of random bits needed to generate a member of the family), and the quality (or error parameter) of the pseudorandom property it achieves. Unlike previous constructions, most notably universal hashing, the size of our families is essentially independent of the size of the domain on which the functions operate. The first construction is for the mixing property—mapping a proportional part of any subset of the domain to any other subset. The other two are for the extraction property—mapping any subset of the domain almost uniformly into a range smaller than it. The second and third constructions handle, respectively, the extreme situations when the range is very large or very small. We provide lower bounds showing that our constructions are nearly optimal, and mention some applications of the new constructions. © 1997 John Wiley & Sons, Inc. Random Struct. Alg., 11 , 315–343 (1997)