多个侧向链对横向量子线传输性质的调制

利用递推格林函数方法，研究了与多个量子点间无相互作用的量子链相耦合的横向量子线的电子输运特性，发现量子链上格点的个数N_U与侧向无限或有限量子链个数N对横向量子线输运性质的不同调制规律.由计算可知，利用格林函数可以方便的对传输构型及传输链中的格点数进行调解，从而得到各种人为量子器件的输运性质. 关键词： 递推格林函数 无限链 有限链 电子输运     

一类积分微分方程概周期解的存在性和唯一性

考虑具无穷时滞的非线性积分微分方程概周期的存在性和唯一性问题,利用矩阵测度和不动点方法获得了一类方程的概周期的存在性和唯一性的充分条件,推广了相应文献的结果.     

Slope enclosures for functions given by two or more branches

In this paper, we consider the automatic computation of slope enclosures for continuous real functions given by two or more branches, such as piecewise defined nonsmooth functions. We show that a commonly used formula found in the literature does not always provide a slope enclosure for such functions. Furthermore, we prove a similar formula that always holds. AMS subject classification (2000)  65G20     

Linear interval equations with symmetric solution sets

Criteria for symmetry and boundedness are found for the combined solution set of a system of linear algebraic equations with interval coefficients. It is shown that the problem of the best inner interval estimation of a symmetric solution set can be exactly solved by linear programming methods.     

随机Richlet级数的增长性

本文构造了全平面上的无限级Dirirchlet级数,使得它对型函数的增长性与一个已知的不同分布随机Dirichlet的增长性相同,从而通过前者增长性与指数,系数的关系可研究后者的增长性.     

高维Cotes优化积分数值算法及其余项估计

利用一维Cotes公式及高维积分Cartesian积空间上的求积法则,将Cotes公式推广到了n维空间上,并给出了简单的误差估计.该公式具有比文[4],[5],[6]相关结果更小的误差和更高的收敛阶等优点.     

Some fractal properties of the percolating backbone in two dimensions

A new algorithm is presented, based on elements of artificial intelligence theory, to determine the fractal properties of the backbone of the incipient infinite cluster. It is found that the fractal dimensionality of the backbone isd _f ^BB =1.61±0.01, the chemical dimensionality isd _t=1.40±0.01, and the fractal dimension of the minimum pathd _min=1.15 ± 0.02 for the two-dimensional triangular lattice.     

Procreating tiles of double commutative-step digraphs

Double commutative-step digraph generalizes the double-loop digraph. A double commutative-step digraph can be represented by an L-shaped tile, which periodically tessellates the plane. Given an initial tile L（l, h, x, y）, Aguil5 et al. define a discrete iteration L（p） = L（l ＋ 2p, h ＋ 2p, x ＋ p, y ＋ p）, p = 0, 1, 2,..., over L-shapes （equivalently over double commutative-step digraphs）, and obtain an orbit generated by L（l, h, x,y）, which is said to be a procreating k-tight tile if L（p）（p = 0, 1, 2, ~ ~ ~ ） are all k-tight tiles. They classify the set of L-shaped tiles by its behavior under the above-mentioned discrete dynamics and obtain some procreating tiles of double commutative-step digraphs. In this work, with an approach proposed by Li and Xu et al., we define some new discrete iteration over L-shapes and classify the set of tiles by the procreating condition. We also propose some approaches to find infinite families of realizable k-tight tiles starting from any realizable k-tight L-shaped tile L（l, h, x, y）, 0 ≤ y - x ≤ 2k ＋ 2. As an example, we present an infinite family of 3-tight optimal double-loop networks to illustrate our approaches.