A variation of a conjecture due to Erdös and Sós

Erdoes and Soes conjectured in 1963 that every graph G on n vertices with edge number e（G） 〉 1/2（k - 1）n contains every tree T with k edges as a subgraph. In this paper, we consider a variation of the above conjecture, that is, for n 〉 9/ 2k^2 ＋ 37/2＋ 14 and every graph G on n vertices with e（G） 〉 1/2 （k- 1）n, we prove that there exists a graph G＇ on n vertices having the same degree sequence as G and containing every tree T with k edges as a subgraph.     

任意长圈覆盖指定的独立的点

An invariant σ2（G） of a graph is defined as follows： σ2（G） ：= min{d（u） ＋ d（v）｜u, v ∈V（G）,uv ∈ E（G）,u ≠ v} is the minimum degree sum of nonadjacent vertices （when G is a complete graph, we define σ2（G） = ∞）. Let k, s be integers with k ≥ 2 and s ≥ 4, G be a graph of order n sufficiently large compared with s and k. We show that if σ2（G） ≥ n ＋ k- 1, then for any set of k independent vertices v1,..., vk, G has k vertex-disjoint cycles C1,..., Ck such that ｜Ci｜ ≤ s and vi ∈ V（Ci） for all 1 ≤ i ≤ k.
The condition of degree sum σs（G） ≥ n ＋ k - 1 is sharp.     

On deep holes of standard Reed-Solomon codes

Determining deep holes is an important open problem in decoding Reed-Solomon codes. It is well known that the received word is trivially a deep hole if the degree of its Lagrange interpolation polynomial equals the dimension of the Reed-Solomon code. For the standard Reed-Solomon codes [p-1, k]p with p a prime, Cheng and Murray conjectured in 2007 that there is no other deep holes except the trivial ones. In this paper, we show that this conjecture is not true. In fact, we find a new class of deep holes for standard Reed-Solomon codes [q-1, k]q with q a power of the prime p. Let q≥4 and 2≤k≤q-2. We show that the received word u is a deep hole if its Lagrange interpolation polynomial is the sum of monomial of degree q-2 and a polynomial of degree at most k-1. So there are at least 2(q-1)qk deep holes if k q-3.     

Smallest close to regular bipartite graphs without an almost perfect matching

A graph G is close to regular or more precisely a （d, d ＋ k）-graph, if the degree of each vertex of G is between d and d ＋ k. Let d ≥ 2 be an integer, and let G be a connected bipartite （d, d＋k）-graph with partite sets X and Y such that ｜X｜- ｜Y｜＋1. If G is of order n without an almost perfect matching, then we show in this paper that·n ≥ 6d ＋7 when k = 1,·n ≥ 4d＋ 5 when k = 2,·n ≥ 4d＋3 when k≥3.Examples will demonstrate that the given bounds on the order of G are the best possible.     

The Threshold for the Erdos, Jacobson and Lehel Conjecture to Be True

Let σ（k, n） be the smallest even integer such that each n-term positive graphic sequence with term sum at least σ（k, n） can be realized by a graph containing a clique of k ＋ 1 vertices. Erdos et al. （Graph Theory, 1991, 439-449） conjectured that σ（k, n） = （k - 1）（2n- k） ＋ 2. Li et al. （Science in China, 1998, 510-520） proved that the conjecture is true for k 〉 5 and n ≥ （k2） ＋ 3, and raised the problem of determining the smallest integer N（k） such that the conjecture holds for n ≥ N（k）. They also determined the values of N（k） for 2 ≤ k ≤ 7, and proved that [5k-1/2] ≤ N（k） ≤ （k2） ＋ 3 for k ≥ 8. In this paper, we determine the exact values of σ（k, n） for n ≥ 2k＋3 and k ≥ 6. Therefore, the problem of determining σ（k, n） is completely solved. In addition, we prove as a corollary that N（k） -= [5k-1/2] for k ≥6.     

Extracting outer function part from Hardy space function

Any analytic signal fa(e~(it)) can be written as a product of its minimum-phase signal part(the outer function part) and its all-phase signal part(the inner function part). Due to the importance of such decomposition, Kumarasan and Rao(1999), implementing the idea of the Szeg?o limit theorem(see below),proposed an algorithm to obtain approximations of the minimum-phase signal of a polynomial analytic signal fa(e~(it)) = e~(iN0t)M∑k=0a_k~(eikt),(0.1)where a_0≠ 0, a_M≠ 0. Their method involves minimizing the energy E(f_a, h_1, h_2,..., h_H) =1/(2π)∫_0~(2π)|1+H∑k=1h_k~(eikt)|~2|fa(e~(it))|~2dt(0.2) with the undetermined complex numbers hk's by the least mean square error method. In the limiting procedure H →∞, one obtains approximate solutions of the minimum-phase signal. What is achieved in the present paper is two-fold. On one hand, we rigorously prove that, if fa(e~(it)) is a polynomial analytic signal as given in(0.1),then for any integer H≥M, and with |fa(e~(it))|~2 in the integrand part of(0.2) being replaced with 1/|fa(e~(it))|~2,the exact solution of the minimum-phase signal of fa(e~(it)) can be extracted out. On the other hand, we show that the Fourier system e~(ikt) used in the above process may be replaced with the Takenaka-Malmquist(TM) system, r_k(e~(it)) :=((1-|α_k|~2e~(it))/(1-α_ke~(it))~(1/2)∏_(j=1)~(k-1)(e~(it)-α_j/(1-α_je~(it))~(1/2), k = 1, 2,..., r_0(e~(it)) = 1, i.e., the least mean square error method based on the TM system can also be used to extract out approximate solutions of minimum-phase signals for any functions f_a in the Hardy space. The advantage of the TM system method is that the parameters α_1,..., α_n,...determining the system can be adaptively selected in order to increase computational efficiency. In particular,adopting the n-best rational(Blaschke form) approximation selection for the n-tuple {α_1,..., α_n}, n≥N, where N is the degree of the given rational analytic signal, the minimum-phase part of a rational analytic signal can be accurately and efficiently extracted out.     

On the weighted elliptic problems involving multi-singular potentials and multi-critical exponents

Suppose Ω belong to R^N（N≥3） is a smooth bounded domain,ξi∈Ω,0〈ai〈√μ,μ：=（（N-1）/2）^2,0≤μi〈（√μ-ai）^2,ai〈bi〈ai＋1 and pi：=2N/N-2（1＋ai-bi）are the weighted critical Hardy-Sobolev exponents, i = 1, 2,..., k, k ≥ 2. We deal with the conditions that ensure the existence of positive solutions to the multi-singular and multi-critical elliptic problem ∑i=1^k（-div（｜x-ξi｜^-2ai△↓u）-μiu/｜x-ξi｜^2（1＋ai）-u^pi-1/｜x-ξi｜^bipi）=0with Dirichlet boundary condition, which involves the weighted Hardy inequality and the weighted Hardy-Sobolev inequality. The results depend crucially on the parameters ai, bi and #i, i -- 1, 2,..., k.     

Exact Solution to an Extremal Problem on Graphic Sequences with a Realization Containing Every 2-Tree on k Vertices

A simple graph G is a 2-tree if G=K_3,or G has a vertex v of degree 2,whose neighbors are adjacent,and G-v is a 2-tree.Clearly,if G is a 2-tree on n vertices,then |E(G)|=2 n-3.A non-increasing sequence π=(d_1,...,d_n) of nonnegative integers is a graphic sequence if it is realizable by a simple graph G on n vertices.[Acta Math.Sin.Engl.Ser.,25,795-802(2009)] proved that if k≥2,n≥9/2 k~2+19/2 k and π=(d_1,...,d_n) is a graphic sequence with∑_(i=1)~n di(k-2)n,then π has a realization containing every 1-tree(the usual tree) on k vertices.Moreover,the lower bound(k-2)_n is the best possible.This is a variation of a conjecture due to Erdos and Sos.In this paper,we investigate an analogue problem for 2-trees and prove that if k≥3 is an integer with k≡i(mod 3),n≥ 20[k/3] ~2+31[k/3]+12 and π=(d_1,...,d_n) is a graphic sequence with ∑_(i=1)~n d_imax{k-1)(n-1), 2 [2 k/3] n-2 n-[2 k/3] ~2+[2 k/3]+1-(-1)~i}, then π has a realization containing every 2-tree on k vertices.Moreover,the lower bound max{(k-1)(n-1), 2[2 k/3]n-2 n-[2 k/3] ~2+[2 k/3]+1-(-1)~i}is the best possible.This result implies a conjecture due to [Discrete Math.Theor.Comput.Sci.,17(3),315-326(2016)].     

Precise rates in the law of the logarithm for the moment convergence in Hilbert spaces

Let （X, Xn; n ≥1） be a sequence of i.i.d, random variables taking values in a real separable Hilbert space （H, ｜｜·｜｜） with covariance operator ∑. Set Sn = X1 ＋ X2 ＋ ... ＋ Xn, n≥ 1. We prove that, for b 〉 -1,
lim ε→0 ε^2（b＋1） ∞ ∑n=1 （logn）^b/n^3/2 E{｜｜Sn｜｜-σε√nlogn}=σ^-2（b＋1）/（2b＋3）（b＋1） B｜｜Y｜^2b＋3
holds if EX=0,and E｜｜X｜｜^2（log｜｜x｜｜）^3bv（b＋4）〈∞ where Y is a Gaussian random variable taking value in a real separable Hilbert space with mean zero and covariance operator ∑, and σ^2 denotes the largest eigenvalue of ∑.     

Domination number in graphs with minimum degree two

A set D of vertices of a graph G = （V, E） is called a dominating set if every vertex of V not in D is adjacent to a vertex of D. In 1996, Reed proved that every graph of order n with minimum degree at least 3 has a dominating set of cardinality at most 3n/8. In this paper we generalize Reed＇s result. We show that every graph G of order n with minimum degree at least 2 has a dominating set of cardinality at most （3n ＋IV21）/8, where V2 denotes the set of vertices of degree 2 in G. As an application of the above result, we show that for k ≥ 1, the k-restricted domination number rk （G, γ） ≤ （3n＋5k）/8 for all graphs of order n with minimum degree at least 3.     

The Initial Value Problems and Nonlinear Boundary Value Problems for a Class of the Second order Quasilinear Parabolio Systems

In this paper initial value problems and nonlinear mixed boundary value problems for the quasilinear parabolic systems below $\[\frac{{\partial {u_k}}}{{\partial t}} - \sum\limits_{i,j = 1}^n {a_{ij}^{(k)}} (x,t)\frac{{{\partial ^2}{u_k}}}{{\partial {x_i}\partial {x_j}}} = {f_k}(x,t,u,{u_x}),k = 1, \cdots ,N\]$ are discussed.The boundary value conditions are $\[{u_k}{|_{\partial \Omega }} = {g_k}(x,t),k = 1, \cdots ,s,\]$ $\[\sum\limits_{i = 1}^n {b_i^{(k)}} (x,t)\frac{{\partial {u_k}}}{{\partial {x_i}}}{|_{\partial \Omega }} = {h_k}(x,t,u),k = s + 1, \cdots N.\]$ Under some "basically natural" assumptions it is shown by means of the Schauder type estimates of the linear parabolic equations and the embedding inequalities in Nikol'skii spaces,these problems have solutions in the spaces $\[{H^{2 + \alpha ,1 + \frac{\alpha }{2}}}(0 < \alpha < 1)\]$.For the boundary value problem with $\[b_i^{(k)}(x,t) = \sum\limits_{j = 1}^n {a_{ij}^{(k)}} (x,t)\cos (n,{x_j})\]$ uniqueness theorem is proved.     

THE ASYMPTOTIC BEHAVIOUR OF ANALYTIC FUNCTIONS

AIn this paper, the author obtains the following results:(1) If Taylor coeffiients of a function satisfy the conditions:(i),(ii),(iii)A_k=O(1/k) the for any h>0 the function φ(z)=exp{w(z)} satisfies the asymptotic equality the case h>1/2 was proved by Milin.(2) If f(z)=z α_2z~2 …∈S~* and,then for λ>1/2     

$p=-1$的Hardy型不等式的最佳常数

For p＞1,many improved or generalized results of the well-known Hardy's inequality have been established.In this paper,by means of the weight coefficient method,we establish the following Hardy type inequality for P=-1:n∑i=1(1/ii∑j=1aj)-1＜2n∑i=1(1-π2-9/3i)ai-1,Cn such that the inequality ∑ni=1(1/i∑ij=1 aj)-1≤Cn∑ni=1ai-1 holds.Moreover,by means of the Mathematica software,we give some examples.     

Positive Gegenbauer Polynomial Sums and Applications to Starlike Functions

Let $s_n(f,z):=\sum_{k=0}^{n}a_kz^k$ be the $n$th partial sum of $f(z)=\sum_{k=0}^{\infty{}}a_kz^k$. We show that $\RE s_n(f/z,z)>0$ holds for all $z\in\D,\ n\in\N$, and all starlike functions $f$ of order $\lambda$ iff $\lambda_0\leq\lambda<1$ where $\lambda_0=0.654222...$ is the unique solution $\lambda\in(\frac{1}{2},1)$ of the equation $\int_{0}^{3\pi/2}t^{1-2\lambda}\cos t \,dt=0$. Here $\D$ denotes the unit disk in the complex plane $\C$. This result is the best possible with respect to $\lambda_0$. In particular, it shows that for the Gegenbauer polynomials $C_{n}^{\mu}(x)$ we have $\sum_{k=0}^n C_{k}^{\mu}(x)\cos k \theta>0$ for all $n\in\N,\ x\in[-1,1]$, and $0<\mu\leq\mu_0:=1-\lambda_0=0.345778...$. This result complements an inequality of Brown, Wang, and Wilson (1993) and extends a result of Ruscheweyh and Salinas (2000).     

Rate Optimality of Wavelet Series Approximations of Fractional Brownian Motion

Consider the fractional Brownian motion process $B_H(t), t\in [0,T]$, with parameter $H\in (0,1)$. Meyer, Sellan and Taqqu have developed several random wavelet representations for $B_H(t)$, of the form $\sum_{k=0}^\infty U_k(t)\epsilon_k$ where $\epsilon_k$ are Gaussian random variables and where the functions $U_k$ are not random. Based on the results of Kühn and Linde, we say that the approximation $\sum_{k=0}^n U_k(t)\epsilon_k$ of $B_H(t)$ is optimal if $$ \displaystyle \left( E \sup_{t\in [0,T]} \left| \sum_{k=n}^\infty U_k(t) \epsilon_k\right|^2 \right)^{1/2} =O \left( n^{-H} (1+\log n)^{1/2} \right), $$ as $n\rightarrow\infty$. We show that the random wavelet representations given in Meyer, Sellan and Taqqu are optimal.     

THE DECOMPOSITION THEOREM OF A PROBABILITY-FLOW

suppose that p is a Markov transition matrix on the sapce E,and {ui}(\[i \in E\])is an initial distribution.The Matrix (ui,pij)is called a probility-flow.we obtain the following theorem:For any initial distribution {ui}(ui>0)which need not be stationary,we have \[{u_i}{p_{ij}} = {u_i}{p_{ij}}^d + \sum\limits_{k \in K} {{r_{ij}}^{(k)}} + \sum\limits_{i \in L} {{g_{ij}}^{(l)}} \] where, 1) \[{u_i}{p_{ij}}^d = {u_i}{p_{ij}}^d(i,j \in E)\] \[{p_{ij}}^d\]is called the detailed balabce part of p; 2)For each \[k \in K\](at most denumerable),there is a circular road \[{a^{(k)}} = (i_1^{(k)},i_2^{(k)},...,i_n^{(k)},i_1^{(k)})\](\[n \geqslant 3,{i_s} \ne {i_t}(S \ne t,1 \leqslant S,t \leqslant n\]),and there is a constant \[{c_k} > 0\],such that \[{r_{ij}}^{(k)} = \left\{ {\begin{array}{*{20}{c}} {{c_k},(i,j) \in {a^{(k)}}} \\ {0,(else)} \end{array}} \right.\] and \[\sum\limits_{k \in K} {{r_{ij}}^{(k)}} \] is called the circulation part of p; 3)For any \[l \in L\](at most denumerable),there is a read in E; \[{r^{(l)}} = (j_1^{(1)},...,j_n^{(l)})\] \[n \geqslant 2,{j_s}^{(l)} \ne {j_t}^{(l)}(s \ne t,l \leqslant s,t \leqslant n)\],and there is a constant \[{d_l} > 0\],such that \[{g_{ij}}^{(l)} = \left\{ {\begin{array}{*{20}{c}} {{d_l},(i,j) \in {r^l}} \\ {0,(else)} \end{array}} \right.\] and \[\sum\limits_{i \in L} {{g_{ij}}^{(l)}} \]is called the divergent part of p. This theorem is extetion of the theorem of circulation decomposition given by Qian Minping.     

图的上可嵌入性与独立顶点的新度和

Let G be a k(k ≤3)-edge connected simple graph with minimal degree ≥ 3,girth g,r=g12.For any independent set {a1,a2 , . . . , a 6/(4 k)} of G,if,then G is up-embeddable.     

ON A MULTILINEAR OSCILLATORY SINGULAR INTEGRAL OPERATOR （I）

ＯＮＡＭＵＬＴＩＬＩＮＥＡＲＯＳＣＩＬＬＡＴＯＲＹＳＩＮＧＵＬＡＲＩＮＴＥＧＲＡＬＯＰＥＲＡＴＯＲ（Ｉ）ＣＨＥＮＷＥＮＧＵＨＵＧＵＯＥＮＬＵＳＨＡＮＺＨＥＮＭａｎｕｓｃｒｉｐｔｒｅｃｅｉｖｅｄＯｃｔｏｂｅｒ１８，１９９４．ＲｅｖｉｓｅｄＤｅｃｅ...     

多维风险模型中独立和的局部大偏差

In this paper, we study the case of independent sums in multi-risk model. Assume that there exist k types of variables. The ith are denoted by {Xij, j ≥ 1}, which are i.i.d.with common density function fi(x) ∈ OR and finite mean, i = 1,..., k. We investigate local large deviations for partial sums k i=1Sni= k i=1 nij=1Xij.     

$k$-广义拟树的第一个leap Zagreb 指标

图$G$的第一个leap Zagreb指标定义如下: $LM_1(G)=\sum_(v\in v(G)}d_2(v/G)^2$, 其中$d_2(v/G)$是离点$v$的距离为2的顶点. 令$\mathcal{QT}^{(k)}(n)$是有$n$个顶点的$k$-广义拟树的集合.若$G\in \mathcal{QT}^{(k)}(n)$, 本文给出了图$G$的第一个leap Zagreb指标的范围.