Gauss整环上不可分解的Hermite型

本文给出了构作虚二次域Ｑ（－ｍ）的整数环上不可分解的正定整Ｈｅｒ ｍｉｔｅ型的方法．     

第Ⅱ类三态叠加多模叠加态光场等幂次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压缩效应.     

Thermodynamics of fusion and sublimation for a homologous series of eleven alkane-α,ω-diols HO-(CH2)n-OH: Structure-related odd–even effect

Temperatures and enthalpies of fusion and solid-to-solid transition of a homologous series of linear alkane-α,ω-diols, HO-(CH₂)_n-OH where n = (6 to 16), were measured by differential scanning calorimetry (d.s.c.). The enthalpies and temperatures of fusion displayed a marked odd–even effect as a function of the number of methylene groups in the alkyl chains, with even terms showing higher values than odd terms. Thermodynamic parameters of fusion were compared with those of isoelectronic linear alkanes and earlier measured alkane-α,ω-diamines, alkane-α,ω-diamides and alkane-α,ω-dinitriles. Results were discussed with reference to the effects of chain length on crystal structures and packing patterns raised on hydrogen bonding and hydrophobic interaction interplay. The enthalpies of sublimation at T = 298.15 K were obtained from the enthalpies of fusion and the literature enthalpies of vaporisation, both adjusted to 298.15 K. A smoother odd–even pattern was observed for the enthalpies of sublimation.     

平面图的k-重(2k+2)-染色

G=(V,E)表示一个顶点集为V,边集为E的有限简单无向图.若存在映射φ:V(G)→Zk(n)(Zk(n)是由{1,2,…,n}的所有k-元子集构成的集合),满足:(A) uv∈E(G),有φ(u)∩φ(u)=θ,则称φ是G的一个k-重n-顶点染色.本文证明了奇围长至少为5k-7(k=4)或5k-9(k=6)的平面图G...     

A polynomial algorithm for the max-cut problem on graphs without long odd cycles

Given a graphG=[V, E] with positive edge weights, the max-cut problem is to find a cut inG such that the sum of the weights of the edges of this cut is as large as possible. Letg(K) be the class of graphs whose longest odd cycle is not longer than2K+1, whereK is a nonnegative integer independent of the numbern of nodes ofG. We present an O(n ^4K) algorithm for the max-cut problem for graphs ing(K). The algorithm is recursive and is based on some properties of longest and longest odd cycles of graphs. This research was supported by National Science Foundation Grant ECS-8005350 to Cornell University.     

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.     

Matchings in graphs of odd regularity and girth

We establish lower bounds on the matching number of graphs of given odd regularity d$d$ and odd girth g$g$, which are sharp for many values of d$d$ and g$g$. For d=g=5$d=g=5$, we characterize all extremal graphs.     

图P^3n的奇优美标号算法

本文讨论了图P^3n的奇优美性,给出了图只奇优美标号算法．