Positive ground state solutions for Schrödinger–Poisson system with critical nonlocal term in ℝ3

This paper is dedicated to studying the following Schrödinger–Poisson system $$\left\{\begin{array}{ll}-\mathrm{\Delta }u+V(x)u-K(x)\varphi |u{|}^{3}u=a(x)f(u),& x\in {ℝ}^3,\\ -\mathrm{\Delta }\varphi =K(x)|u{|}^5,& x\in {ℝ}^3.\end{array}\right.$$ Under some different assumptions on functions V(x), K(x), a(x) and f(u), by using the variational approach, we establish the existence of positive ground state solutions.     

带有临界增长的Kirchhoff方程极小能量变号解的存在性

为了深入研究Kirchhoff方程的性质,讨论了带有Hartree项和临界增长非线性项的Kirchhoff方程极小能量变号解的存在性。利用能量泛函在变号Nehari流形上的下确界C_λ收敛于0,得到空间E紧嵌入L~6(R~3)这一技术性结果。结果表明,利用限制变分方法和定量形变引理获得极小化序列对应的极小值点是该问题的非平凡解。研究方法在理论证明方面得到了良好的结果,对研究其他Kirchhoff方程解的存在性有一定的指导意义。     

超临界水氧化处理有机物废料的新技术

和传统方法相比，超临界水氧化处理有机物废料有着极大的优势。介绍了处理废料的原理和工业应用的可能性。     

具Hardy-Sobolev临界指数的奇异椭圆方程多解的存在性

运用变分方法研究了下面问题-Δpu=μupx(s)s-2u f(x,u),x∈Ω,u=0,x∈Ω,多重解的存在性,其中Ω是一个具有光滑边界的有界区域.     

New universality classes in “Percolative” dynamics

We study a site analogue of directed percolation. Random trajectories are generated and their critical behavior is studied. The critical behavior corresponds to that of simple percolation in some of the parameter space, but elsewhere the exponents reveal new universality classes. As a byproduct, we use the model to make an improved estimate of the percolation hull exponents and to calculate the site percolation probability for the square lattice.     

基于LabVIEW的高温超导材料特性测试实验

高温超导体临界特性的测量是近代物理实验中最为经典的实验之一,本文通过使用GM制冷机,利用Lab-VIEW虚拟仪器软件和高性能采集卡,改进了传统的测量高温超导材料临界特性的实验装置.本测试系统不仅可以测量高温超导体在不同温度下的临界电流,还可以测量其失超传播特性.该实验对于学生了解超导体特性和培养严谨的科学作风十分有益.     

TWO-POINT BOUNDARY VALUE PROBLEM FOR A CLASS OF SECOND-ORDER DIFFERENCE EQUATIONS

In this paper, we apply a critical point theorem and obtain the condition for the existence of three solutions to two-point boundary value problem of a second order nonlinear difference equation.     

Rank-perfect and" weakly rank-perfect graphs

An edge e of a perfect graph G is critical if G−e is imperfect. We would like to decide whether G−e is still “almost perfect” or already “very imperfect”. Via relaxations of the stable set polytope of a graph, we define two superclasses of perfect graphs: rank-perfect and weakly rank-perfect graphs. Membership in those two classes indicates how far an imperfect graph is away from being perfect. We study the cases, when a critical edge is removed from the line graph of a bipartite graph or from the complement of such a graph.     

A dynamical test of phase transition order: New things in old places or old wine in new bottles

We first discuss nonlinear aspects of phase transition theory applied to a particular liquid crystal phase transition. A simple derivation is given to show how two coupled Goldstone modes (one appearing as gauge fluctuations of the ordered phase) can force a phase transition, against all expectations, to take place discontinuously (theory of Halperin, Lubensky, and Ma)-but the discontinuity may be immeasurably small. Then, we describe a new dynamical test of phase transition order, developed by Cladiset al., that turns out to be more sensitive than x-ray diffraction and adiabatic calorimetry. Quantitative data found by this new method are in excellent agreement with the measurements of adiabatic calorimetry and x-ray diffraction as well as expectations implicit in the predictions of HLM.This is the text of an after-banquet talk given at the CNLS Workshop on the Dynamics of Concentrated Systems.     

On the critical exponents of random k‐SAT

There has been much recent interest in the satisfiability of random Boolean formulas. A random k‐SAT formula is the conjunction of m random clauses, each of which is the disjunction of k literals (a variable or its negation). It is known that when the number of variables n is large, there is a sharp transition from satisfiability to unsatisfiability; in the case of 2‐SAT this happens when m/n → 1, for 3‐SAT the critical ratio is thought to be m/n ≈ 4.2. The sharpness of this transition is characterized by a critical exponent, sometimes called ν = ν_k (the smaller the value of ν the sharper the transition). Experiments have suggested that ν₃ = 1.5 ± 0.1. ν₄ = 1.25 ± 0.05, ν₅ = 1.1 ± 0.05, ν₆ = 1.05 ± 0.05, and heuristics have suggested that ν_k → 1 as k → ∞. We give here a simple proof that each of these exponents is at least 2 (provided the exponent is well defined). This result holds for each of the three standard ensembles of random k‐SAT formulas: m clauses selected uniformly at random without replacement, m clauses selected uniformly at random with replacement, and each clause selected with probability p independent of the other clauses. We also obtain similar results for q‐colorability and the appearance of a q‐core in a random graph. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 21: 182–195, 2002