超图与图公平划分的l-元组

令S为一个图或超图的某顶点子集,则e(S)表示该图中端点全部在S内的边数. Fan和Hou(2017)证明了每个最大度为?的m阶图G都存在一个k部划分(V_1, V_2,..., V_k),使得对于任意1≤i j≤k,都成立e(V_i∪V_j)min≤{4/k~2×m+4?/k,m/k-1}+o(m~(7/8)).令H表示最大度为?的m阶r-一致超图,本文证明H存在一个k部划分(V_1, V_2,..., V_k),对于任意1≤i j≤k,满足e(V_i∪V_j)≤r-1/k-1×m+o(m);也证明当?=o(m)时, H存在一个k部划分(V_1, V_2,..., V_k),使得对于任意l∈[k-1]和每个l元组(V_(j1),..., V_(jl)),有e(V_(j1)∪···∪V_(jl))≤l~r/k~r/m+o(m).     

二部平衡公平划分的一个下界

设V_1,V_2是图G的一个二部划分.如果一1≤|V_1|-|V_2|≤1,则称V_1,V_2是G的一个二部平衡划分.对于n个顶点m条边的简单图G,本文证明了:(1)若G是k-正则图(k≥3),则G存在一个最小二部平衡划分V_1,V_2,使得max{e(V_1),e(V_2)}≥((k-1)m)/4k;(2)如果r是大于4的实数,且当n是偶数时△(G)≤((3r-4))/(r+4)δ(G)-(2r)/(r+4),当n是奇数时△(G)≤(3r-4)/(r+4)δ(G)-(8r)/(r+4),那么G存在一个二部平衡划分,使得min{e(V_1),e(V_2)}≥m/r,这里e(V_i)表示G中两个顶点都在V_i中的边的数目.     

Biased Partitions and Judicious k-Partitions of Graphs

Let G =(V, E) be a graph with m edges. For reals p ∈ [0, 1] and q = 1-p, let m_p(G) be the minimum of qe(V_1) + pe(V_2) over partitions V = V_1 ∪ V_2, where e(V_i) denotes the number of edges spanned by V_i. We show that if m_p(G) = pqm-δ, then there exists a bipartition V_1, V_2 of G such that e(V_1) ≤ p~2m-δ + p(m/2)~(-1/2)+ o(√m) and e(V_2) ≤ q~2m-δ + q(m/2)~(-1/2) + o(√m) for δ = o(m~(2/3)). This is sharp for com_plete graphs up to the error term o(√m). For an integer k ≥ 2, let fk(G) denote the maximum number of edges in a k-partite subgraph of G. We prove that if fk(G) =(1-1/k)m + α,then G admits a k-partition such that each vertex class spans at most m/k~2-Ω(m/k~(7.5)) edges forα = Ω(m/k~6). Both of the above im_prove the results of Bollob′as and Scott.     

混合幂的除数和（英文）

令S_k(x)=∑d(n_1~2+n_2~2+n_3~k),3≤k∈N.1≤n_1,n_2≤x~(1/2)1≤n_3≤x~(1/k)本文得到了渐近公式S_k(x)=A(k)x~(1+1/k)logx+B(k)x~(1+1/k)+O(x~(1+1/k-δ(k)+ε)),这里A(k),B(k)是只与k有关的常数,δ(3)=5/(42),δ(4)=1/(16),δ(5)=1/(40),并且当6≤k≤7时δ(k)=1/(k2~(k-1)),当k≥8时δ(k)=1/(2k~2(k-1)).     

高维空间的一个Heilbronn型问题

本文研究了以下Heilbronn型问题:设S是欧氏空间按R~k 中由有限个点A_1,A_2,…,A_n组成的集合,令d(S)=min{A_iA_j|1≤i相似文献   

完备图分拆为带一条弦的(2k-1)-长圈

本文给出了构造G-设计的一个统一方法及当v≡1(mod 4k)时的C_(2k-1)~((r))-GD(v)的存在性,其中C_(10)~((r)),1≤r≤k-2表示带一条弦的2k-1长圈,r表示弦两个端点间的顶点个数。     

一类完全三部图的色唯一性

用P(G,λ)表示简单图G的色多项式.设G是一个给定的简单图,若对任意简单图H,当P(H,λ)=P(G,λ)时都有H和G同构(记为H≌G),则称图G是色唯一的.本文证明了以下结果:设n,k,△都为非负整数,其中k≥0,△∈{4,5},若n≥1/3k~2+1/3△~2-1/3k△-1/3k-1/3△+4/3,则完全三部图K(n,n+△,n+k)是色唯一的.同时还给出了一个猜想.     

均衡二部图中点不交的4-圈和6-圈（英文）

设G=(V_1,V_2,E)是一个均衡二部图满足|V_1|=|V_2|=n.令δ_(1,1)(G)=min{d(x)+d(y)|x∈V_1,Y∈V_2}.Amar猜想对任意的s个整数(n_1,n_2,…,n_s),n=n_1+n_2+…+n_s,其中n_i≥2.若δ_(1,1)(G)≥n+s,则G含s个点不交的圈,其长分别为2n_1,2n_2,…,2n_s(见[Discrete Math.,1986,58(1):1-10]).本文证明了若一个点数为4k的均衡二部图G满足δ_(1,1)(G)≥2k+4(k≥3),则G含k-3个4-圈和2个6-圈使得所有这些圈都是点不交的.     

素数k次方和的非线性型的整数部分

运用Dawmport-Heilbronn方法证明了:如果μ_1…,μ_r是不全为负的非零实数,至少一个μ_j(1≤j≤r)是无理数,k,m,r是正整数,k≥4,r≥2^(k-1)+1,则存在无穷多素数p_1,…,p_r,p,使得[μ_1p_1(k-1)+1,则存在无穷多素数p_1,…,p_r,p,使得[μ_1p_1^k+…+μ_rp_rk+…+μ_rp_r^k]=mp.特别地,[μ_1p_1k]=mp.特别地,[μ_1p_1^k+…+μ_rp_rk+…+μ_rp_r^k]可表示无穷多素数.     

关于k-消去二分图的一些结果

图 G的一个 k-正则支撑子图称为 G的 k-因子 ,若对 G的任一边 e,图 G- e总存在一个 k-因子 ,则称 G是 k-消去图 .证明了二分图 G=( X,Y) ,且 | X | =| Y|是 k-消去图的充分必要条件是 k| S|≤ r1 + 2 r2 +…+ k( rk+… + rΔ) - ε( S)对所有 S X成立 .并由此给出二分图是 k-消去图的充分度条件 .     

Gaussian fluctuations of eigenvalues in log-gas ensemble: Bulk case I

We study the central limit theorem of the k-th eigenvalue of a random matrix in the log-gas ensemble with an external potential V = q2mx2 m. More precisely, let Pn(d H) = Cne-nTrV(H)dH be the distribution of n × n Hermitian random matrices, ρV(x)dx the equilibrium measure, where Cnis a normalization constant, V(x) = q2mx2m with q2m=Γ(m)Γ(12)/Γ(2m+1/2), and m ≥ 1. Let x1 ≤···≤ xnbe the eigenvalues of H. Let k := k(n) be such that k(n)/n∈ [a, 1- a] for n large enough, where a ∈(0,12).Define G(s) :=∫s-1ρV(x)dx,- 1 ≤ s ≤ 1,and set t := G-1(k/n). We prove that, as n →∞,xk- t log n1/2 2π21/2nρV(t)→ N(0, 1)in distribution. Multi-dimensional central limit theorem is also proved. Our results can be viewed as natural extensions of the bulk central limit theorems for GUE ensemble established by J. Gustavsson in 2005.     

Codegree Threshold for Tiling k-graphs with Two Edges Sharing Exactly ℓ Vertices

Given integer k and a k-graph F,let t(k-1)(n,F)be the minimum integer t such that every k-graph H on n vertices with codegree at least t contains an F-factor.For integers k>3 and 0≤l≤k-1,let y(k,l)be a k-graph with two edges that shares exactly l vertices.Han and Zhao(J.Combin.Theory Ser.A,(2015))asked the following question:For all k≥3,0≤l≤k-1 and sufficiently large n divisible by 2 k-l,determine the exact value of t_k-1(n,y(k,l)).In this paper,we show that t(k-1)(n,y(k,l))=n/(2 k-l)for k>3 and 1≤l≤k-2,combining with two previously known results of R?dl,Rucinski and Szemeredi(J.Combin.Theory Ser.A,(2009))and Gao,Han and Zhao(Combinatorics,Probability and Computing,(2019)),the question of Han and Zhao is solved completely.     

振荡超奇性Hilbert变换的Sobolev有界性

主要研究R~n上沿曲线Γ(t)=(t~(p_1),t~(p_2),…,t~(p_n))的振荡超奇性Hilbert变换H_(n,α,β)=∫_0~1 f(x-Γ(t))e~(it-β)t~(-1-α),在Sobolev空间上的有界性,其中0p_1P_2…P_n,αβ0.证明了对于0γ(nα)/((n+1))(p_1+α),当|1/p-1/2|(β-(n+1)[α-(β+p_1)γ])/(2β)时,H_(n,α,β)是从L_γ~2(R~n))到L~2(R~n)的有界算子.特别地,当β≥(α-γp_1)/(γ+1/(n+1))等时,H_(n,α,β)是从L_γ~2(R~n)到L~2(R~n)的有界算子·     

玛欣凯维奇函数与泊松核的一个新微分性质

将Stein[On the functions of Littlewood-Paley,Lusin,and Marcinkiewicz,Trans.Amer.Math.Soc.,1958,88:430-466]中的玛欣凯维奇函数的逆向不等式推广到一般情形.主要结果是对于n-维欧几里得空间k-阶球面调和函数空间的任意一基底,得到玛欣凯维奇函数的一般性的逆向不等式,即存在不依赖于函数f正常数C_p,使得||f||_p≤C_pΣ_(j=1)~N=1||μ_j(f)||_p,其中{μ_j(f)}_(j=1)~N是f的由这些球面调和函数生成的玛欣凯维奇函数.此外,对于任意的n-变元的k-阶调和多项式Q(x)以及泊松核P_t(x),有Q(D)P_t(x)=C_n k(tQ(x))/((|x|)~2+t~2~(n+2k+1)/2).     

On Graph-Lagrangians and clique numbers of 3-uniform hypergraphs

The paper explores the connection of Graph-Lagrangians and its maximum cliques for 3-uniform hypergraphs.Motzkin and Straus showed that the Graph-Lagrangian of a graph is the Graph-Lagrangian of its maximum cliques.This connection provided a new proof of Turán classical result on the Turán density of complete graphs.Since then,Graph-Lagrangian has become a useful tool in extremal problems for hypergraphs.Peng and Zhao attempted to explore the relationship between the Graph-Lagrangian of a hypergraph and the order of its maximum cliques for hypergraphs when the number of edges is in certain range.They showed that if G is a 3-uniform graph with m edges containing a clique of order t-1,then λ(G)=λ([t-1]~((3))) provided (t-13)≤m≤(t-13)+_(t-22).They also conjectured:If G is an r-uniform graph with m edges not containing a clique of order t-1,then λ(G)λ([t-1]~((r))) provided (t-1r)≤ m ≤(t-1r)+(t-2r-1).It has been shown that to verify this conjecture for 3-uniform graphs,it is sufficient to verify the conjecture for left-compressed 3-uniform graphs with m=t-13+t-22.Regarding this conjecture,we show: If G is a left-compressed 3-uniform graph on the vertex set [t] with m edges and |[t-1]~((3))\E(G)|=p,then λ(G)λ([t-1]~((3))) provided m=(t-13)+(t-22) and t≥17p/2+11.     

Multiple Positive Solutions for a Nonlinear Elliptic Equation Involving Hardy–Sobolev–Maz'ya Term

In this paper, we study the existence and nonexistence of multiple positive solutions for the following problem involving Hardy–Sobolev–Maz'ya term:-Δu- λu/|y|2=|u|pt-1u/|y|t+ μf(x), x ∈Ω,where Ω is a bounded domain in RN(N ≥ 2), 0 ∈Ω, x =(y, z) ∈ Rk× RN-kand pt =N +2-2t N-2(0 ≤ t ≤2). For f(x) ∈ C1(Ω)\{0}, we show that there exists a constant μ* 0 such that the problem possessesat least two positive solutions if μ∈(0, μ*) and at least one positive solution if μ = μ*. Furthermore,there are no positive solutions if μ∈(μ*, +∞).     

广义Davey-Stewartson系统驻波的强不稳定性

本文研究方程驻波的强不稳定性iu_t+△u+a|u|~(p-1)u+E_1(|u|~2)u=0,t≥0,x∈R~n,其中a0,1p(n+2)/(n+2)~+,n∈{2,3}.当1+4/n≤pn+2/(n-2)~+)时,文[Sharp threshold of global existence and instability of standing wave for a Davey-Stewartson system,Commun.Math.Phys.,2008,283:93-125]在驻波的频率满足一定假设条件下,证明了此方程驻波的强不稳定性.本文去掉这个假设,得到相同的结论.     

Some Existence Theorems on Path Factors with Given Properties in Graphs

A path factor of G is a spanning subgraph of G such that its each component is a path.A path factor is called a P≥_n-factor if its each component admits at least n vertices. A graph G is called P≥_n-factor covered if G admits a P≥_n-factor containing e for any e ∈ E(G), which is defined by[Discrete Mathematics, 309, 2067–2076(2009)]. We first define the concept of a(P≥_n, k)-factor-critical covered graph, namely, a graph G is called(P≥_n, k)-factor-critical covered if G-D is P≥_n-factor covered for any D ? V(G) with |D| = k. In this paper, we verify that(i) a graph G with κ(G) ≥ k + 1 is(P≥2, k)-factor-critical covered if bind(G) 2+k/3;(ii) a graph G with |V(G)| ≥ k + 3 and κ(G) ≥ k + 1 is(P≥3, k)-factor-critical covered if bind(G) ≥4+k/3.     

短区间的并集中整数及其m次幂的差的均值分布

本文研究了短区间的并集中整数及其m次幂的差的均值分布问题,给出了渐近公式.具体来说,设P是奇素数,1≤H≤p,实数δ满足0 δ≤1,整数m≥2.设I~((j))是(0,p)的互不相交的子区间,1≤j≤J,满足H/2≤|I~((j))|≤H,以及(y)_p表示y在模p下的非负最小剩余.定义I=∪_(j=1)~JI~((j)),并设X是模p的Dirichlet非主特征.证明了Σ x∈1 |x-(x~m)p|δp 1=1/p∫_0~([δp]) (Σ x∈1 x≤p-1-t 1+Σ x∈1 x≥t=1 1)dt+O(mJ~(1/2)P~(1/2)log~2 plog H),以及Σ x∈1 |x-(x~m)p|δp X(x)mJ~(1/2)P~(1/2)log~2 plog H.     

K_m~-□P_n的交叉数

Klesc等人先后确定了K_m~-□P_n(4≤m≤6)的交叉数,本文利用构造法确定了K_m-2K_2(4≤m≤12,m≠10,12)的交叉数.在此基础上,可进一步确定K_m~-□P_n(4≤m≤9,m≠8)的交叉数.相比而言,我们所采用的方法更具一般性.