A generalization of Gale's lemma

In this work, we present a generalization of Gale's lemma. Using this generalization, we introduce two sharp combinatorial lower bounds for and , the two classic topological lower bounds for the chromatic number of a graph G.     

Singular Supercritical Trudinger–Moser Inequalities and the Existence of Extremals

In this paper, we present the singular supercritical Trudinger–Moser inequalities on the unit ball B in R~n, wher~e n ≥ 2. More precisely, we show that for any given α 0 and 0 t n, then the following two inequalities hold for ■,■.We also consider the problem of the sharpness of the constant α_(n,t). Furthermore, by employing the method of estimating the lower bound and using the concentration-compactness principle, we establish the existence of extremals. These results extend the known results when t = 0 to the singular version for 0 t n.     

广义山路引理的一些应用

具有(CPS)型条件的Ghoussoub-Preiss广义山路引理是经典的AmbrosettiRabinowitz山路引理的一个推广,本文将应用它来研究给定能量的具有对称性或非对称性势能的二阶哈密尔顿系统周期解的存在性.     

Infinitely many solutions for a class of sublinear Schrodinger equation

In this paper, we investigate the Schr\"{o}dinger equation, which satisfies that the potential is asymptotical 0 at infinity in some measure-theoretic and the nonlinearity is sublinear growth. By using variant symmetric mountain lemma, we obtain infinitely many solutions for the problem. Moreover, if the nonlinearity is locally sublinear defined for $|u|$ small, we can also get the same result. In which, we show that these solutions tend to zero in $L^{\infty}(\mathbb{R}^{N})$ by the Br\"{e}zis-Kato estimate.     

Representing (0, 1)-matrices by boolean circuits

A boolean circuit represents an n by n(0,1)-matrix A if it correctly computes the linear transformation over GF(2) on all n unit vectors. If we only allow linear boolean functions as gates, then some matrices cannot be represented using fewer than Ω(n²/lnn) wires. We first show that using non-linear gates one can save a lot of wires: any matrix can be represented by a depth-2 circuit with O(nlnn) wires using multilinear polynomials over GF(2) of relatively small degree as gates. We then show that this cannot be substantially improved: If any two columns of an n by n(0,1)-matrix differ in at least d rows, then the matrix requires Ω(dlnn/lnlnn) wires in any depth-2 circuit, even if arbitrary boolean functions are allowed as gates.     

对称超二次二阶哈密尔顿系统的周期解

我们利用Ambrosetti-Rabinowitz对称形式的山路引理证明了给定周期T的对称超二次二阶哈密尔顿系统具有无穷多个反T/2-周期且奇的周期解.     

Dirichlet零边值问题的正解存在性

由于一些本质困难,N=3被称为具Sobolev临界指数2*的Dirichlet问题-△u=λu+|u|2*-2u,x∈ΩRN;u(x)0,x∈Ω;u=0,x∈Ω的临界维数.众所周知,N=3时,上述问题存在古典(正)解的一个充分条件是Ω为R3上的小球以及14λ1λλ1.本文考虑Ω是R3中更一般的有界光滑区域,得出了一正解存在性结论,从而肯定了沈尧天在文中提及的一个未解决的问题.     

${\mathbb{Z}}/3{\mathbb{Z}}$-量子群的Gr\"{o}bner-Shirshov 基

通过计算合成, 我们证明了Yamane 给出的关系是 ${\mathbb{Z}}/3{\mathbb{Z}}$-量子群的一个Gr\"{o}bner-Shirshov 基.     

Convex mappings on some circular domains

In this paper,we consider some circular domains.And we give an extension theorem for some normalized biholomorphic convex mapping on some circular domains.Especially,we discover the normalized biholomorphic convex mapping on some circular domains have the form f(z) =(f1(z1),...,fn(zn)),where fj:D → C are normalized biholomorphic convex mapping.