无8-,9-和10-圈的平面图的3-可选择性

寻找平面图是3-或者4-可选择的充分条件是图的染色理论中一个重要研究课题,本文研究了围长至少是4的特殊平面图的选择数,通过权转移的方法证明了每个围长至少是4且不合8-圈,9-圈和10-圈的平面图是3-可选择的．     

平面图的强边染色

图$G$的强边染色是在正常边染色的基础上, 要求距离不超过$2$的任意两条边染不同的颜色, 强边染色所用颜色的最小整数称为图$G$的强边色数。本文首先给出极小反例的构型, 然后通过权转移法, 证明了$g(G)\geq5$, $\Delta(G)\geq6$且$5$-圈不相交的平面图的强边色数至多是$4\Delta(G)-1$。     

Derived Brackets

We survey the many instances of derived bracket construction in differential geometry, Lie algebroid and Courant algebroid theories, and their properties. We recall and compare the constructions of Buttin and of Vinogradov, and we prove that the Vinogradov bracket is the skew-symmetrization of a derived bracket. Odd (resp., even) Poisson brackets on supermanifolds are derived brackets of canonical even (resp., odd) Poisson brackets on their cotangent bundle (resp., parity-reversed cotangent bundle). Lie algebras have analogous properties, and the theory of Lie algebroids unifies the results valid for manifolds on the one hand, and for Lie algebras on the other. We outline the role of derived brackets in the theory of Poisson structures with background'.     

decay problem for the dissipative wave equation in odd dimensions

Consider the Cauchy problem in odd dimensions for the dissipative wave equation: (□+∂_t)u=0 in with (u,∂_tu)|_t=0=(u₀,u₁). Because the L² estimates and the L^∞ estimates of the solution u(t) are well known, in this paper we pay attention to the L^p estimates with 1p<2 (in particular, p=1) of the solution u(t) for t0. In order to derive L^p estimates we first give the representation formulas of the solution u(t)=∂_tS(t)u₀+S(t)(u₀+u₁) and then we directly estimate the exact solution S(t)g and its derivative ∂_tS(t)g of the dissipative wave equation with the initial data (u₀,u₁)=(0,g). In particular, when p=1 and n1, we get the L¹ estimate: u(t)_L¹Ce^−t/4(u_0W^n,1+u_1W^n−1,1)+C(u_0L¹+u_1L¹) for t0.     

第Ⅱ类三态叠加多模叠加态光场等幂次2m+1次方Y压缩

构造了由多模虚相干态|{iZ_j}>_q、多模虚相干态的相反态|{-iZ_j}>_q和多模真空态|{O_j}>_q这三种不同的量子光场态的线性叠加所组成的第Ⅱ类三态叠加多模叠加态光场|ψ₂⁽³⁾>_q.利用多模压缩态理论,研究了态|ψ₂⁽³⁾>_q的广义非线性等幂次2m+1次方Y压缩特性.结果发现:在压缩次数N=2m+1(m=0,1,2,3,…,…)的条件下,只要各模的初始相位和态间的初始相位差分别满足一定的取值条件,态|ψ₂⁽³⁾>_q就可呈现出周期性变化的、任意奇数次的广义非线性等幂次N次方Y压缩效应.     

群环Z_nG的基于理想△(G)的零因子图

主要讨论了群环Z_nG的基于理想△(G)的零因子图Γ_(△(G))(Z_nG)的性质,分别给出了Γ_(△(G))(Z_nG)的围长,平面性和直径的详细刻画.同时,给出了交换环R基于其理想I的零因子图Γ_I(R)与商环R/I的零因子图Γ(R/I)的直径的关系的一个刻画.     

A Totally(Δ+1)-colorable 1-planar Graph with Girth at Least Five

A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge.In this paper,we prove that every 1-planar graph G with maximum degree Δ(G)≥12 and girth at least five is totally(Δ(G)+1)-colorable.     

Odd subgraphs and matchings

Let G be a graph and f : V(G)→{1,3,5,…}. Then a subgraph H of G is called a (1,f)-odd subgraph if deg_H(x){1,3,…,f(x)} for all xV(H). If f(x)=1 for all xV(G), then a (1,f)-odd subgraph is nothing but a matching. A (1,f)-odd subgraph H of G is said to be maximum if G has no (1,f)-odd subgraph K such that |K|>|H|. We show that (1,f)-odd subgraphs have some properties similar to those of matchings, in particular, we give a formula for the order of a maximum (1,f)-odd subgraph, which is similar to that for the order of a maximum matching.     

Turán numbers for odd wheels

The Turán number $\text{ex}(n,G)$ is the maximum number of edges in any $n$-vertex graph that does not contain a subgraph isomorphic to $G$. A wheel$W_n$ is a graph on $n$ vertices obtained from a $C_{n?1}$ by adding one vertex $w$ and making $w$ adjacent to all vertices of the $C_{n?1}$. We obtain two exact values for small wheels:

$\text{ex}(n,W_5)=?\frac{n^2}{4}+\frac{n}{2}?,$

$\text{ex}(n,W_7)=?\frac{n^2}{4}+\frac{n}{2}+1?.$

Given that $\text{ex}(n,W_6)$ is already known, this paper completes the spectrum for all wheels up to 7 vertices. In addition, we present the construction which gives us the lower bound $\text{ex}(n,W_{2k+1})>?\frac{n^2}{4}?+?\frac{n}{2}?$ in general case.