Transference numbers for ultra concentrated solutions of aqueous hydrochloric acid at 25°C

Transference numbers of HCl(aq) solutions at 25°C, from 0.01 to 13.6 mol-kg^–1(m) have been obtained by measuring the emf of cells with transference using hydrogen gas/platinum electrodes. Good agreement is obtained at concentrations up to 1 m with all previous data, and our results strongly corroborate those of King and Spiro over the 2–8m concentration range. The transference numbers of the hydronium ion fit the empirical equation, _H ^HCl = 0.821 + 0.0457m ^1/2 – 2.476×10^–2m – 1.90×10^–4 m ² – 1.45×10^–5 m ³ the maximum deviation in T _H ^HCl being 0.003.     

Picture Fuzzy Threshold Graphs with Application in Medicine Replenishment

In this study, a novel concept of picture fuzzy threshold graph (PFTG) is introduced. It has been shown that PFTGs are free from alternating 4-cycle and it can be constructed by repeatedly adding a dominating or an isolated node. Several properties about PFTGs are discussed and obtained the results that every picture fuzzy graph (PFG) is equivalent to a PFTG under certain conditions. Also, the underlying crisp graph (UCG) of PFTG is a split graph (SG), and conversely, a given SG can be applied to constitute a PFTG. A PFTG can be decomposed in a unique way and it generates three distinct fuzzy threshold graphs (FTGs). Furthermore, two important parameters i.e., picture fuzzy (PF) threshold dimension (TD) and PF partition number (PN) of PFGs are defined. Several properties on TD and PN have also been discussed. Lastly, an application of these developed results are presented in controlling medicine resources.     

桑蚕种良卵率调查中样本间卵粒数的偏差控制方法

桑蚕种良卵率是蚕种质量检验的重要指标,控制样本间卵粒数的偏差是保证良卵率准确性的关键。通过对桑蚕卵粒重的调查分析,得出其分布服从正态分布。若从一批蚕种中抽取1g卵作为样本,则来自同一总体的2个样本的卵粒数之差不超过16粒,其置信概率为95%;当置信概率取99%时,两个样本的卵粒数之差不超过21粒。文章为蚕业生产提供了一种实用的克卵粒数偏差控制方法。     

复数星图与单路的多染色拉姆齐数

对给定的简单图$H_1,H_2,\ldots,H_c$, 我们将使完全图$K_n$的任意边分解$\{G_i\}^c_{i=1}$都存在至少一个$G_i$有子图同构于$H_i$的最小正整数$n$称为多染色拉姆齐数 $R(H_1,H_2,\ldots,$ $H_c)$. 对正整数$m,n_1,n_2,\ldots,n_c$, 令$\Sigma=\sum_{i=1}^{c}(n_i-1)$. 在文献中,我们已经获得了$R(K_{1,n_1},\ldots,K_{1,n_c},P_m)$ 的一些界和精确值.Wang推测若$\Sigma\not\equiv 0\pmod{m-1}$且$\Sigma+1\ge (m-3)^2$, 则有$R(K_{1,n_1},\ldots, K_{1,n_c}, P_m)=\Sigma+m-1.$ 本文中, 我们给出了一个新的下界并给出$R(K_{1,n_1},\ldots,K_{1,n_c},P_m)$在$m\leq\Sigma$, $\Sigma\equiv k\pmod{m-1}$且$2\leq k \leq m-2$情况下的部分精确值. 这些结果部分证实了Wang的猜想.     

Signed Fuzzy-Valued Measures and Radon-Nikodym Theorem of Fuzzy-Valued Measurable Functions

In this paper, we introduce and study the signed fuzzy-valued measure and using the representation theorem of fuzzy numbers, we establish the Radon-Nikodym theorem for fuzzy-valued measurable functions with respect to fuzzy-valued measures.AMS Subject Classification (2000): 28E10, 04A72The research of this work is supposed by a grant of the education committee of Liaoning Province, China #20161049     

Efimov's Effect in a Model of Perturbation Theory of the Essential Spectrum

A model operator similar to the energy operator of a system with a nonconserved number of particles is studied. The essential spectrum of the operator is described, and under some natural conditions on the parameters it is shown that there are infinitely many eigenvalues lying below the bottom of the essential spectrum.     

On Some Three-Color Ramsey Numbers

 In this paper we study three-color Ramsey numbers. Let K _i,j denote a complete i by j bipartite graph. We shall show that (i) for any connected graphs G ₁, G ₂ and G ₃, if r(G ₁, G ₂)≥s(G ₃), then r(G ₁, G ₂, G ₃)≥(r(G ₁, G ₂)−1)(χ(G ₃)−1)+s(G ₃), where s(G ₃) is the chromatic surplus of G ₃; (ii) (k+m−2)(n−1)+1≤r(K _1,k , K _1,m , K _n )≤ (k+m−1)(n−1)+1, and if k or m is odd, the second inequality becomes an equality; (iii) for any fixed m≥k≥2, there is a constant c such that r(K _k,m , K _k,m , K _n )≤c(n/logn), and r(C _2m , C _2m , K _n )≤c(n/logn) ^m/(m−1) for sufficiently large n. Received: July 25, 2000 Final version received: July 30, 2002 RID="*" ID="*" Partially supported by RGC, Hong Kong; FRG, Hong Kong Baptist University; and by NSFC, the scientific foundations of education ministry of China, and the foundations of Jiangsu Province Acknowledgments. The authors are grateful to the referee for his valuable comments. AMS 2000 MSC: 05C55     

On the number of distinct prime factors of an odd perfect number

It is not known whether or not there exists an odd perfect number. We describe an algorithmic approach for showing that if there is an odd perfect number then it has t distinct prime factors, and we discuss its application towards showing that t9.     

Some Bipartite Ramsey Numbers

Consider a complete bipartite graph K(s, s) with p = 2s points. Let each line of the graph have either red or blue colour. The smallest number p of points such that K(s, s) always contains red K(m, n) or blue K(m, n) is called bipartite Ramsey number denoted by rb(K(m, n), K(m, n)). In this paper, we show that

Construction of graphs with given circular flow numbers

Suppose r ≥ 2 is a real number. A proper r‐flow of a directed multi‐graph is a mapping such that (i) for every edge , ; (ii) for every vertex , . The circular flow number of a graph G is the least r for which an orientation of G admits a proper r‐flow. The well‐known 5‐flow conjecture is equivalent to the statement that every bridgeless graph has circular flow number at most 5. In this paper, we prove that for any rational number r between 2 and 5, there exists a graph G with circular flow number r. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 304–318, 2003