Second moment of error term of mean value for binary Egyptian fractions

We study the mean square of the error term of the mean value for binary Egyptian fractions.We get an asymptotic formula under the Riemann Hypothesis.     

Binary functions,degeneracy, and alternating dimaps

This paper continues the study of combinatorial properties of binary functions — that is, functions $f:2^E\to ?$ such that $f(0?)=1$, where $E$ is a finite set. Binary functions have previously been shown to admit families of transforms that generalise duality, including a trinity transform, and families of associated minor operations that generalise deletion and contraction, with both these families parameterised by the complex numbers. Binary function representations exist for graphs (via the indicator functions of their cutset spaces) and indeed arbitrary matroids (as shown by the author previously). In this paper, we characterise degenerate elements – analogues of loops and coloops – in binary functions, with respect to any set of minor operations from our complex-parameterised family. We then apply this to study the relationship between binary functions and Tutte’s alternating dimaps, which also support a trinity transform and three associated minor operations. It is shown that only the simplest alternating dimaps have binary representations of the form we consider, which seems to be the most direct type of representation. The question of whether there exist other, more sophisticated types of binary function representations for alternating dimaps is left open.     

Thermalization of electron–positron plasma with quantum degeneracy

The non-equilibrium electron–positron–photon plasma thermalization process is studied using relativistic Boltzmann solver, taking into account quantum corrections both in non-relativistic and relativistic cases. Collision integrals are computed from exact QED matrix elements for all binary and triple interactions in the plasma. It is shown that in non-relativistic case (temperatures $k_{B}T\le 0.3m_e{c}^2$) binary interaction rates dominate over triple ones, resulting in establishment of the kinetic equilibrium prior to final relaxation towards the thermal equilibrium, in agreement with the previous studies. On the contrary, in relativistic case (final temperatures $k_{B}T\ge 0.3m_e{c}^2$) triple interaction rates are fast enough to prevent the establishment of kinetic equilibrium. It is shown that thermalization process strongly depends on quantum degeneracy in initial state, but does not depend on plasma composition.     

Variations of the Catalan numbers from some nonassociative binary operations

We investigate certain nonassociative binary operations that satisfy a four-parameter generalization of the associative law. From this we obtain variations of the ubiquitous Catalan numbers and connections to many interesting combinatorial objects such as binary trees, plane trees, lattice paths, and permutations.     

Evaluation of an activated carbon from olive stones used as an adsorbent for heavy metal removal from aqueous phases

The performance of a microporous activated carbon prepared chemically from olive stones for removing Cu(II), Cd(II) and Pb(II) from single and binary aqueous solutions was investigated via the batch technique. The activated carbon sample was characterized using N₂ adsorption–desorption isotherms, SEM, XRD, FTIR, and Boehm titration. The effect of initial pH and contact time were studied. Adsorption kinetic rates were found to be fast and kinetic experimental data fitted very well the pseudo-second-order equation. The adsorption isotherms fit the Redlich–Peterson model very well and maximum adsorption amounts of single metal ions solutions follow the trend Pb(II) > Cd(II) > Cu(II). The adsorption behavior of binary solution systems shows a relatively high affinity to Cu(II) at the activated carbon surface of the mixture with Cd(II) or Pb(II). An antagonistic competitive adsorption phenomenon was observed. Desorption experiments indicated that about 59.5% of Cu(II) and 23% of Cd(II) were desorbed using a diluted sulfuric acid solution.     

Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs

For any graph G, let be the number of spanning trees of G, be the line graph of G, and for any nonnegative integer r, be the graph obtained from G by replacing each edge e by a path of length connecting the two ends of e. In this article, we obtain an expression for in terms of spanning trees of G by a combinatorial approach. This result generalizes some known results on the relation between and and gives an explicit expression if G is of order and size in which s vertices are of degree 1 and the others are of degree k. Thus we prove a conjecture on for such a graph G.     

Statistical and Geometrical Way of Model Selection for a Family of Subdivision Schemes

The objective of this article is to introduce a generalized algorithm to produce the m-point n-ary approximating subdivision schemes(for any integer m, n ≥ 2). The proposed algorithm has been derived from uniform B-spline blending functions. In particular, we study statistical and geometrical/traditional methods for the model selection and assessment for selecting a subdivision curve from the proposed family of schemes to model noisy and noisy free data. Moreover, we also discuss the deviation of subdivision curves generated by proposed family of schemes from convex polygonal curve. Furthermore, visual performances of the schemes have been presented to compare numerically the Gibbs oscillations with the existing family of schemes.     

一类新的(2n-1)点二重动态逼近细分

利用正弦函数构造了一类新的带有形状参数ω的(2n-1)点二重动态逼近细分格式.从理论上分析了随n值变化时这类细分格式的C~k连续性和支集长度;算法的一个特色是随着细分格式中参数ω的取值不同,相应生成的极限曲线的表现张力也有所不同,而且这一类算法所对应的静态算法涵盖了Chaikin,Hormann,Dyn,Daniel和Hassan的算法.文末附出大量数值实例,在给定相同的初始控制顶点,且极限曲线达到同一连续性的前提下和现有几种算法做了比较,数值实例表明这类算法生成的极限曲线更加饱满,表现力更强.