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.     

Proof of the Loebl–Komlós–Sós conjecture for large, dense graphs

The Loebl–Komlós–Sós conjecture states that for any integers k and n, if a graph G on n vertices has at least n/2 vertices of degree at least k, then G contains as subgraphs all trees on k+1 vertices. We prove this conjecture in the case when k is linear in n, and n is sufficiently large.     

Partitions with initial repetitions

A variety of interesting connections with modular forms, mock theta functions and Rogers- Ramanujan type identities arise in consideration of partitions in which the smaller integers are repeated as summands more often than the larger summands. In particular, this concept leads to new interpretations of the Rogers Selberg identities and Bailey＇s modulus 9 identities.     

图的邻点可区别全色数的一个上界

Let G = （V, E） be a simple connected graph, and ｜V（G）｜ ≥ 2. Let f be a mapping from V（G） ∪ E（G） to {1,2…, k}. If arbitary uv ∈ E（G）,f（u） ≠ f（v）,f（u） ≠ f（uv）,f（v） ≠ f（uv）; arbitary uv, uw ∈ E（G）（v ≠ w）, f（uv） ≠ f（uw）;arbitary uv ∈ E（G） and u ≠ v, C（u） ≠ C（v）, where
C（u）={f（u）}∪{f（uv）｜uv∈E（G）}.
Then f is called a k-adjacent-vertex-distinguishing-proper-total coloring of the graph G（k-AVDTC of G for short）. The number min{k｜k-AVDTC of G} is called the adjacent vertex-distinguishing total chromatic number and denoted by χat（G）. In this paper we prove that if △（G） is at least a particular constant and δ ≥32√△ln△, then χat（G） ≤ △（G） ＋ 10^26 ＋ 2√△ln△.     

Support vector machine classifiers with uncertain knowledge sets via robust optimization

In this article we study support vector machine (SVM) classifiers in the face of uncertain knowledge sets and show how data uncertainty in knowledge sets can be treated in SVM classification by employing robust optimization. We present knowledge-based SVM classifiers with uncertain knowledge sets using convex quadratic optimization duality. We show that the knowledge-based SVM, where prior knowledge is in the form of uncertain linear constraints, results in an uncertain convex optimization problem with a set containment constraint. Using a new extension of Farkas' lemma, we reformulate the robust counterpart of the uncertain convex optimization problem in the case of interval uncertainty as a convex quadratic optimization problem. We then reformulate the resulting convex optimization problems as a simple quadratic optimization problem with non-negativity constraints using the Lagrange duality. We obtain the solution of the converted problem by a fixed point iterative algorithm and establish the convergence of the algorithm. We finally present some preliminary results of our computational experiments of the method.     

最大度不小于3的图的星全色数的一个上界

对圈、扇和轮作了简单的剖分,得到了其剖分图的星全色数,并运用Lovasz局部引理证明了若G(V,E)是一个最大度为△≥3的简单无向图,则Χ_(st)(G)≤22Δ~2.     

Atomic decomposition and boundedness criterion of operators on multi-parameter hardy spaces of homogeneous type

The main purpose of this paper is to derive a new ( p, q)-atomic decomposition on the multi-parameter Hardy space Hp (X1 × X2 ) for 0 p0 p ≤ 1 for some p0 and all 1 q ∞, where X1 × X2 is the product of two spaces of homogeneous type in the sense of Coifman and Weiss. This decomposition converges in both Lq (X1 × X2 ) (for 1 q ∞) and Hardy space Hp (X1 × X2 ) (for 0 p ≤ 1). As an application, we prove that an operator T1, which is bounded on Lq (X1 × X2 ) for some 1 q ∞, is bounded from Hp (X1 × X2 ) to Lp (X1 × X2 ) if and only if T is bounded uniformly on all (p, q)-product atoms in Lp (X1 × X2 ). The similar boundedness criterion from Hp (X1 × X2 ) to Hp (X1 × X2 ) is also obtained.     

A version of Hill＇s lemma for Cosserat continuum

On the basis of Hill＇s lemma for classical Cauchy continuum, a version of Hill＇s lemma for micro-macro homogenization modeling of heterogeneous Cosserat continuum is presented in the flame of average-field theory. The admissible boundary conditions required to prescribe on the representative volume element for the modeling are extracted and discussed to ensure the satisfaction of Hill-Mandel energy condition and the first-order average field theory.     

Change of Base in Bailey Pairs

Versions of Bailey's lemma which change the base from q to q ² or q ³ are given. Iterates of these versions give many new versions of multisum Rogers-Ramanujan identities.