白云石制备似立方体状方解石型碳酸钙晶体及其机理研究

以轻烧白云石粉、氯化铵和二氧化碳为原料,在未使用晶型控制剂的情况下,通过蒸氨-沉钙过程制备出了似立方体状碳酸钙。研究了反应温度、溶液中钙离子浓度、通气速率、搅拌速度以及陈化时间对碳酸钙中方解石相含量以及晶体形貌的影响,并探索了沉钙反应的晶型控制机理。结果表明,在反应温度40 ℃、钙离子浓度0.05 mol/L、通碳速率100 mL/min、搅拌速度400 r/min和陈化时间2 h的条件下,制备出形貌规整、粒径分布均匀的似立方体状碳酸钙,平均粒径为5~10 μm。该研究为提升白云石的使用价值、生产高附加价值的碳酸钙产品,以及提高白云石资源的利用率提供理论基础。     

给定度序列图的覆盖成本和反向覆盖成本的研究

具有n个顶点且度序列为(m,2,…,2,1,…,1)(1的重数为m)的连通图不止一个(这些图均为树),而每个树对应唯一一个段序列(l₁,l₂,…,l_m).通过对任意一树移动最长段的悬挂点到最短段悬挂点的方式得到另一树,比较前后两树的覆盖成本和反向覆盖成本,给出了具有最小覆盖成本和反向覆盖成本的极树,并且进一步给出了取得最小覆盖成本和反向覆盖成本的顶点.     

Finite groups with three composite character degrees

Let G be a finite group and let cd(G) be the set of all irreducible character degrees of G. We consider finite groups G with the property that cd(G) has at most three composite members. We derive a bound 8 for the size of character degree sets of such groups.     

Vertex-disjoint rainbow triangles in edge-colored graphs

Let $G$ be an edge-colored graph of order $n$. The minimum color degree of $G$, denoted by ${\delta }^c\left(G\right)$, is the largest integer $k$ such that for every vertex $v$, there are at least $k$ distinct colors on edges incident to $v$. We say that an edge-colored graph is rainbow if all its edges have different colors. In this paper, we consider vertex-disjoint rainbow triangles in edge-colored graphs. Li (2013) showed that if ${\delta }^c\left(G\right)\ge (n+1)∕2$, then $G$ contains a rainbow triangle and the lower bound is tight. Motivated by this result, we prove that if $n\ge 20$ and ${\delta }^c\left(G\right)\ge (n+2)∕2$, then $G$ contains two vertex-disjoint rainbow triangles. In particular, we conjecture that if ${\delta }^c\left(G\right)\ge (n+k)∕2$, then $G$ contains $k$ vertex-disjoint rainbow triangles. For any integer $k\ge 2$, we show that if $n\ge 16k-12$ and ${\delta }^c\left(G\right)\ge n∕2+k-1$, then $G$ contains $k$ vertex-disjoint rainbow triangles. Moreover, we provide sufficient conditions for the existence of $k$ edge-disjoint rainbow triangles.