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.     

Epidemiological models with quadratic equation for endemic equilibria—A bifurcation atlas

The existence and occurrence, especially by a backward bifurcation, of endemic equilibria is of utmost importance in determining the spread and persistence of a disease. In many epidemiological models, the equation for the endemic equilibria is quadratic, with the coefficients determined by the parameters of the model. Despite its apparent simplicity, such an equation can describe an amazing number of dynamical behaviors. In this paper, we shall provide a comprehensive survey of possible bifurcation patterns, deriving explicit conditions on the equation's parameters for the occurrence of each of them, and discuss illustrative examples.     

A note on Hadwiger’s conjecture for W5-free graphs with independence number two

The Hadwiger number of a graph $G$, denoted $h\left(G\right)$, is the largest integer $t$ such that $G$ contains $K_t$ as a minor. A famous conjecture due to Hadwiger in 1943 states that for every graph $G$, $h\left(G\right)\ge \chi \left(G\right)$, where $\chi \left(G\right)$ denotes the chromatic number of $G$. Let $\alpha \left(G\right)$ denote the independence number of $G$. A graph is $H$-free if it does not contain the graph $H$ as an induced subgraph. In 2003, Plummer, Stiebitz and Toft proved that $h\left(G\right)\ge \chi \left(G\right)$ for all $H$-free graphs $G$ with $\alpha \left(G\right)\le 2$, where $H$ is any graph on four vertices with $\alpha \left(H\right)\le 2$, $H=C_5$, or $H$ is a particular graph on seven vertices. In 2010, Kriesell subsequently generalized the statement to include all forbidden subgraphs $H$ on five vertices with $\alpha \left(H\right)\le 2$. In this note, we prove that $h\left(G\right)\ge \chi \left(G\right)$ for all $W_5$-free graphs $G$ with $\alpha \left(G\right)\le 2$, where $W_5$ denotes the wheel on six vertices.     

C^n中子空间之间极端主角的一些应用

本文给出了Ｃ＾ｎ中子空间之间最大和最小主角在矩阵逼近，投影算子的扰动分析，群逆以及Ｏｒａｘｉｎ逆的扰动估计，条件数理论，Ｂｏｔｔ－Ｄｕｆｆｉｎ系统扰动分析中一些应用。     

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

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

Proof of a conjecture on irredundance perfect graphs

Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H)=γ(H), for every induced subgraph H of G. In this article we present a result which immediately implies three known conjectures on irredundance perfect graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 292–306, 2002     

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.     

猜想M(2k,k+1)=3k-1+[(k-1)/2]的反例

Brualdi与Jung在[1]中研究了一类具有固定线和k的n×n矩阵上的最大跳跃数M(n,k),并提出猜想M(2k, k + 1) = 3k - 1 + [(k-1)/2].本文给出了这一猜想的两个反例．