On the role of kinesthetic thinking in computational geometry

Computational geometry is a new (about 30 years) and rapidly growing branch of knowledge in computer science that deals with the analysis and design of algorithms for solving geometric problems. These problems typically arise in computer graphics, image processing, computer vision, robotics, manufacturing, knot theory, polymer physics and molecular biology. Since its inception many of the algorithms proposed for solving geometric problems, published in the literature, have been found to be incorrect. These incorrect algorithms rather than being ‘purely mathematical’ often contain a strong kinesthetic component. This paper explores the relationship between computational geometric thinking and kinesthetic thinking, the effect of the latter on the correctness and efficiency of the resulting algorithms, and their implications for education.     

Hypercomplex analysis and integration of systems of ordinary differential equations

We review the theory of hypercomplex numbers and hypercomplex analysis with the ultimate goal of applying them to issues related to the integration of systems of ordinary differential equations (ODEs). We introduce the notion of hypercomplexification, which allows the lifting of some results known for scalar ODEs to systems of ODEs. In particular, we provide another approach to the construction of superposition laws for some Riccati‐type systems, we obtain invariants of Abel‐type systems, we derive integrable Ermakov systems through hypercomplexification, we address the problem of linearization by hypercomplexification, and we provide a solution to the inverse problem of the calculus of variations for some systems of ODEs. Copyright © 2016 John Wiley & Sons, Ltd.     

On the inclusion of collisional correlations in quantum dynamics

We present a formalism to describe collisional correlations responsible for thermalization effects in finite quantum systems. The approach consists in a stochastic extension of time dependent mean field theory. Correlations are treated in time dependent perturbation theory and loss of coherence is assumed at some time intervals allowing a stochastic reduction of the correlated dynamics in terms of a stochastic ensemble of time dependent mean-fields. This theory was formulated long ago in terms of density matrices but never applied in practical cases because of its complexity. We propose here a reformulation of the theory in terms of wave functions and use a simplified 1D model of cluster and molecules allowing to test the theory in a schematic but realistic manner. We illustrate the performance in terms of several observables, in particular global moments of the density matrix and single particle entropy built on occupation numbers. The occupation numbers remain fixed in time dependent mean-field propagation and change when evaluating the correlations, then taking fractional values. They converge asymptotically towards Fermi distributions which is a clear indication of thermalization.     

Context-free grammars for triangular arrays

We consider context-free grammars of the form G = {f → fb1+b2+1ga1+a2, g → fb1 ga1+1},where ai and bi are integers sub ject to certain positivity conditions. Such a grammar G gives rise to triangular arrays {T(n, k)}0≤k≤n satisfying a three-term recurrence relation. Many combinatorial sequences can be generated in this way. Let Tn (x) =∑nk=0T(n, k)xk. Based on the differential operator with respect to G, we define a sequence of linear operators Pn such that Tn+1(x) = Pn(Tn(x)). Applying the characterization of real stability preserving linear operators on the multivariate polynomials due to Borcea and Br?ndén, we obtain a necessary and sufficient condition for the operator Pn to be real stability preserving for any n. As a consequence, we are led to a sufficient condition for the real-rootedness of the polynomials defined by certain triangular arrays, obtained by Wang and Yeh.Moreover, as special cases we obtain grammars that lead to identities involving the Whitney numbers and the Bessel numbers.     

Solvation Rule for Solid‐Electrolyte Interphase Enabler in Lithium‐Metal Batteries

Despite the exceptionally high energy density of lithium metal anodes, the practical application of lithium‐metal batteries (LMBs) is still impeded by the instability of the interphase between the lithium metal and the electrolyte. To formulate a functional electrolyte system that can stabilize the lithium‐metal anode, the solvation behavior of the solvent molecules must be understood because the electrochemical properties of a solvent can be heavily influenced by its solvation status. We unambiguously demonstrated the solvation rule for the solid‐electrolyte interphase (SEI) enabler in an electrolyte system. In this study, fluoroethylene carbonate was used as the SEI enabler due to its ability to form a robust SEI on the lithium metal surface, allowing relatively stable LMB cycling. The results revealed that the solvation number of fluoroethylene carbonate must be ≥1 to ensure the formation of a stable SEI in which the sacrificial reduction of the SEI enabler subsequently leads to the stable cycling of LMBs.     

随机变量序列的大数定律及常返性定理

对一类有界独立或相依的随机变量序列|ξn|,获得了它的伯努利大数定律、波雷尔强大数定律及常返性定理.作为应用,得出了Loève专著[1]中的推广的伯努利大数定律、常返性定理,改进了[1]中的推广的波雷尔强大数定律.     

Along the Lines of Nonadditive Entropies: q-Prime Numbers and q-Zeta Functions

The rich history of prime numbers includes great names such as Euclid, who first analytically studied the prime numbers and proved that there is an infinite number of them, Euler, who introduced the function ζ(s)≡∑n=1∞n−s=∏pprime11−p−s, Gauss, who estimated the rate at which prime numbers increase, and Riemann, who extended ζ(s) to the complex plane z and conjectured that all nontrivial zeros are in the R(z)=1/2 axis. The nonadditive entropy Sq=k∑ipilnq(1/pi)(q∈R;S1=SBG≡−k∑ipilnpi, where BG stands for Boltzmann-Gibbs) on which nonextensive statistical mechanics is based, involves the function lnqz≡z1−q−11−q(ln1z=lnz). It is already known that this function paves the way for the emergence of a q-generalized algebra, using q-numbers defined as 〈x〉q≡elnqx, which recover the number x for q=1. The q-prime numbers are then defined as the q-natural numbers 〈n〉q≡elnqn(n=1,2,3,⋯), where n is a prime number p=2,3,5,7,⋯ We show that, for any value of q, infinitely many q-prime numbers exist; for q≤1 they diverge for increasing prime number, whereas they converge for q>1; the standard prime numbers are recovered for q=1. For q≤1, we generalize the ζ(s) function as follows: ζq(s)≡〈ζ(s)〉q (s∈R). We show that this function appears to diverge at s=1+0, ∀q. Also, we alternatively define, for q≤1, ζq∑(s)≡∑n=1∞1〈n〉qs=1+1〈2〉qs+⋯ and ζq∏(s)≡∏pprime11−〈p〉q−s=11−〈2〉q−s11−〈3〉q−s11−〈5〉q−s⋯, which, for q<1, generically satisfy ζq∑(s)<ζq∏(s), in variance with the q=1 case, where of course ζ1∑(s)=ζ1∏(s).     

KINETIC ANALYSIS OF CO-CONDENSATION POLYMERIZATION OF AB2 AND AB MONOMERS

This work deals with the kinetics of co-condensation polymerization of AB2 and AB monomers, giving expressions of the two-dimensional molecular weight distribution function and the number/weight average molecular weights of the resulting copolymers. The two-dimensional molecular weight distribution depends on two indices, n and l, which are the respective numbers of AB2 and AB units in a copolymer species. The evolution of the two-dimensional weight and z distributions during the co-condensation polymerization has been evaluated systematically. Finally, the two-dimensional distribution was transformed into a one-dimensional molecular weight distribution with only one variable (the molecular weight of the products instead of the degree of polymerization). The calculated results show that the highly branched copolymer has a very broad molecular weight distribution when the co-condensation polymerization approaches completion.     

NOD随机变量序列加权乘积和的强大数律

利用乘积和的一表示定理和NOD（negatively orthant dependent）随机变量的性质,在较一般的条件下,得到了不同分布的NOD随机变量序列加权乘积和的强大数律,推广和改进了已知的一些文献中相应的结论.