The minimum degree threshold for perfect graph packings

Let H be any graph. We determine up to an additive constant the minimum degree of a graph G which ensures that G has a perfect H-packing (also called an H-factor). More precisely, let δ(H,n) denote the smallest integer k such that every graph G whose order n is divisible by |H| and with δ(G)≥k contains a perfect H-packing. We show that

Homological Connectivity Of Random 2-Complexes

Let Δ_n−1 denote the (n − 1)-dimensional simplex. Let Y be a random 2-dimensional subcomplex of Δ_n−1 obtained by starting with the full 1-dimensional skeleton of Δ_n−1 and then adding each 2−simplex independently with probability p. Let denote the first homology group of Y with mod 2 coefficients. It is shown that for any function ω(n) that tends to infinity

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.     

Remarks on Spectral Radius and Laplacian Eigenvalues of a Graph

Let G be a graph with n vertices, m edges and a vertex degree sequence (d ₁, d ₂,..., d _n ), where d ₁ ≥ d ₂ ≥ ... ≥ d _n . The spectral radius and the largest Laplacian eigenvalue are denoted by ϱ(G) and μ(G), respectively. We determine the graphs with

Diffusion times and stability exponents for nearly integrable analytic systems

For a positive integer n and R>0, we set . Given R>1 and n≥4 we construct a sequence of analytic perturbations (H _j ) of the completely integrable Hamiltonian on , with unstable orbits for which we can estimate the time of drift in the action space. These functions H _j are analytic on a fixed complex neighborhood V of , and setting the time of drift of these orbits is smaller than (C(1/ɛ _j )^1/2(n-3)) for a fixed constant c>0. Our unstable orbits stay close to a doubly resonant surface, the result is therefore almost optimal since the stability exponent for such orbits is 1/2(n−2). An analogous result for Hamiltonian diffeomorphisms is also proved. Two main ingredients are used in order to deal with the analytic setting: a version of Sternberg's conjugacy theorem in a neighborhood of a normally hyperbolic manifold in a symplectic system, for which we give a complete (and seemingly new) proof; and Easton windowing method that allow us to approximately localize the wandering orbits and estimate their speed of drift.     

A new characterization of Anderson’s inequality in <Emphasis Type="Italic">C</Emphasis><Subscript>1</Subscript>-classes

Let ℋ be a separable infinite dimensional complex Hilbert space, and let ℒ(H) denote the algebra of all bounded linear operators on ℋ into itself. Let A = (A ₁, A ₂,..., A _n), B = (B ₁, B ₂,..., B _n) be n-tuples of operators in ℒ(H); we define the elementary operators Δ _A,B : ℒ(H) ↦ ℒ(H) by

Lower semicontinuity of some functionals under PDE constraints: An \mathcal{A}-quasiconvex pair

The problem of establishing necessary and sufficient conditions for l.s.c. under PDE constraints is studied for a special class of functionals:

The Law of Iterated Logarithm of Rescaled Range Statistics for AR（1） Model

Let {Xn,n ≥ 0} be an AR（1） process. Let Q（n） be the rescaled range statistic, or the R/S statistic for {Xn} which is given by （max1≤k≤n（∑j=1^k（Xj - ^-Xn）） - min 1≤k≤n（∑j=1^k（ Xj - ^Xn ））） /（n ^-1∑j=1^n（Xj -^-Xn）^2）^1/2 where ^-Xn = n^-1 ∑j=1^nXj. In this paper we show a law of iterated logarithm for rescaled range statistics Q（n） for AR（1） model.     

On the local Artin conductor f<Subscript>Artin</Subscript> (Χ) of a character Χ of Gal(E/K) — II: Main results for the metabelian case

This paper which is a continuation of [2], is essentially expository in nature, although some new results are presented. LetK be a local field with finite residue class fieldK _k. We first define (cf. Definition 2.4) the conductorf(E/K) of an arbitrary finite Galois extensionE/K in the sense of non-abelian local class field theory as wheren _G is the break in the upper ramification filtration ofG = Gal(E/K) defined by . Next, we study the basic properties of the idealf(E/K) inO _k in caseE/K is a metabelian extension utilizing Koch-de Shalit metabelian local class field theory (cf. [8]). After reviewing the Artin charactera _G : G → ℂ ofG := Gal(E/K) and Artin representationsA _g G → G →GL(V) corresponding toa _G : G → ℂ, we prove that (Proposition 3.2 and Corollary 3.5) where Χ_gr : G → ℂ is the character associated to an irreducible representation ρ: G → GL(V) ofG (over ℂ). The first main result (Theorem 1.2) of the paper states that, if in particular,ρ : G → GL(V) is an irreducible representation ofG(over ℂ) with metabelian image, then where Gal(E^ker(ρ)/E^ker(ρ)•) is any maximal abelian normal subgroup of Gal(E^ker(ρ)/K) containing Gal(E^ker(ρ) /K)′, and the break n_G/ker(ρ) in the upper ramification filtration of G/ker(ρ) can be computed and located by metabelian local class field theory. The proof utilizes Basmaji’s theory on the structure of irreducible faithful representations of finite metabelian groups (cf. [1]) and on metabelian local class field theory (cf. [8]). We then discuss the application of Theorem 1.2 on a problem posed by Weil on the construction of a ‘natural’A _G ofG over ℂ (Problem 1.3). More precisely, we prove in Theorem 1.4 that ifE/K is a metabelian extension with Galois group G, then Kazim İlhan ikeda whereN runs over all normal subgroups of G, and for such anN, V _n denotes the collection of all ∼-equivalence classes [ω]∼, where ‘∼’ denotes the equivalence relation on the set of all representations ω : (G/N)^• → ℂ^Χ satisfying the conditions Inert(ω) = {δ ∈ G/N : ℂ_δ} = ω =(G/N) and where δ runs over R((G/N)^•/(G/N)), a fixed given complete system of representatives of (G/N)^•/(G/N), by declaring that ω₁ ∼ ω₂ if and only if ω₁ = ω _2,δ for some δ ∈ R((G/N)^•/(G/N)). Finally, we conclude our paper with certain remarks on Problem 1.1 and Problem 1.3.     

Asymptotic behavior of the irrational factor

We study the irrational factor function I(n) introduced by Atanassov and defined by , where is the prime factorization of n. We show that the sequence {G(n)/n} _n≧1, where G(n) = Π _ν=1 ⁿ I(ν)^1/n , is convergent; this answers a question of Panaitopol. We also establish asymptotic formulas for averages of the function I(n). Research of the third author is supported in part by NSF grant number DMS-0456615.     

The Extremal Function For Noncomplete Minors

  We investigate the maximum number of edges that a graph G can have if it does not contain a given graph H as a minor (subcontraction). Let

Weighted estimates for multilinear commutators of Marcinkiewicz integral

Let μ be the n-dimensional Marcinkiewicz integral and μb the multilinear commutator of μ. In this paper, the following weighted inequalities are proved for ω ∈ A∞ and 0 〈 p 〈 ∞,
｜｜μ（f）｜｜LP（ω）≤C｜Mf｜LP（ω） and ｜｜μb（f）｜｜LP（ω）≤C｜｜ML（log L）^1/r f｜｜LP（ω）.
The weighted weak L（log L）^1/r -type estimate is also established when p=1 and ω∈A1.     

Solutions to Some Open Problems in Fluid Dynamics

Let u=u（x,t,uo）represent the global solution of the initial value problem for the one-dimensional fluid dynamics equation ut-εuxxt＋δux＋γHuxx＋βuxxx＋f（u）x=αuxx,u（x,0）=uo（x）, whereα〉0,β〉0,γ〉0,δ〉0 andε〉0 are constants.This equation may be viewed as a one-dimensional reduction of n-dimensional incompressible Navier-Stokes equations. The nonlinear function satisfies the conditions f（0）=0,｜f（u）｜→∞as ｜u｜→∞,and f∈C^1（R）,and there exist the following limits Lo=lim sup/u→o f（u）/u^3 and L∞=lim sup/u→∞ f（u）/u^5 Suppose that the initial function u0∈L^I（R）∩H^2（R）.By using energy estimates,Fourier transform,Plancherel＇s identity,upper limit estimate,lower limit estimate and the results of the linear problem vt-εv（xxt）＋δvx＋γHv（xx）＋βv（xxx）=αv（xx）,v（x,0）=vo（x）, the author justifies the following limits（with sharp rates of decay） lim t→∞[（1＋t）^（m＋1/2）∫｜uxm（x,t）｜^2dx]=1/2π（π/2α）^（1/2）m!!/（4α）^m[∫R uo（x）dx]^2, if∫R uo（x）dx≠0, where 0!!=1,1!!=1 and m!!=1·3…（2m-3）…（2m-1）.Moreover lim t→∞[（1＋t）^（m＋3/2）∫R｜uxm（x,t）｜^2dx]=1/2π（x/2α）^（1/2）（m＋1）!!/（4α）^（m＋1）[∫Rρo（x）dx]^2, if the initial function uo（x）=ρo′（x）,for some functionρo∈C^1（R）∩L^1（R）and∫Rρo（x）dx≠0.     

On the Upper Bounds of the Numbers of Perfect Matchings in Graphs with Given Parameters

Let φ(G),κ(G),α(G),χ(G),cl(G),diam(G)denote the number of perfect matchings,connectivity,independence number,chromatic number,clique number and diameter of a graph G,respectively.In this note,by constructing some extremal graphs,the following extremal problems are solved:1.max{φ(G):|V(G)|=2n,κ(G)≤k}=k[(2n-3)!!],2.max{φ(G):|V(G)|=2n,α(G)≥k}=[multiply from i=0 to k-1(2n-k-i)[(2n-2k-1)!!],3.max{φ(G):|V(G)|=2n,χ(G)≤k}=φ(T_(k,2n))T_(k,2n)is the Turán graph,that is a complete k-partite graphon 2n vertices in which all parts are as equal in size as possible,4.max{φ(G):|V(G)|=2n,cl(G)=2}=n1,5.max{φ(G):|V(G)|=2n,diam(G)≥2}=(2n-2)(2n-3)[(2n-5)!!],max{φ(G):|V(G)|=2n,diam(G)≥3}=(n-1)~2[(2n-5)!!].     

On super vertex-graceful unicyclic graphs

A graph G with p vertices and q edges, vertex set V(G) and edge set E(G), is said to be super vertex-graceful (in short SVG), if there exists a function pair (f, f ⁺) where f is a bijection from V(G) onto P, f ⁺ is a bijection from E(G) onto Q, f ⁺((u, v)) = f(u) + f(v) for any (u, v) ∈ E(G),

Gauss Sum of Index 4： （2） Non-cyclic Case

Assume that m ≥ 2, p is a prime number, （m,p（p - 1）） = 1,-1 not belong to 〈p〉 belong to （Z/mZ）^＊ and [（Z/mZ）^＊：〈p〉]=4.In this paper, we calculate the value of Gauss sum G（X）=∑x∈F^＊x（x）ζp^T（x） over Fq,where q=p^f,f=φ（m）/4,x is a multiplicative character of Fq and T is the trace map from Fq to Fp.Under our assumptions,G（x） belongs to the decomposition field K of p in Q（ζm） and K is an imaginary quartic abelian unmber field.When the Galois group Gal（K/Q） is cyclic,we have studied this cyclic case in anotyer paper：＂Gauss sums of index four：（1）cyclic case＂（accepted by Acta Mathematica Sinica,2003）.In this paper we deal with the non-cyclic case.     

On the riemann zeta-function and the divisor problem

Let Δ(x) denote the error term in the Dirichlet divisor problem, and E(T) the error term in the asymptotic formula for the mean square of . If with , then we obtain

On some homotopical and homological properties of monoid presentations

If a monoid S is given by some finite complete presentation ℘, we construct inductively a chain of CW-complexes

Systems with nonextendable convergence of quasipolynomials

The system , where Λ={λ _n } is the set of zeros (of multiplicitiesm _n ) of the Fourier transform

NOTES ON GLAISHER＇S CONGRUENCES

Let p be an odd prime and let n≥1,k≥0 and r be integers,denote by Bk the kth Bernoulli number,It is proved that(i) If r≥1 is odd and suppose 1≥r+4,then ∑j=1^p-1 1/(np+j)^r=-(2n+1)r(r+1)/2(r+2)Bp-r-2p^2(mod p^3).(ii)If r≥2 is even and suppose p≥r+3, then p-1∑j=1 1/(np+j)^r=r/r+1Bv-r-1p(mod P^2).(iii) p-1∑j=1 1/(np+j)p-2=-(2n+1)p(mod P^2).This result generalizes the Glaisher‘s congruence. As a corollary, a generalization of the Wolsten-holme‘s theorem is obtained.