A covering construction for packing disjoint copies of the Hoffman‐Singleton graph into K50

In this note we show how coverings induced by voltage assignments can be used to produce packings of disjoint copies of the Hoffman‐Singleton graph into K₅₀. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 408–412, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10049     

有限群表示的一个结论

利用陪集、重陪集等概念和性质 ,证明了一个利用有限群 G的子集表示 G的结论 .     

New Constructions of Disjoint Distinct Difference Sets

New constructions of regular disjoint distinct difference sets (DDDS) are presented. In particular, multiplicative and additive DDDS are considered.     

On disjoint configurations in infinite graphs

For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?₀ disjoint copies of A is referred to as ?₀A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?₀A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G₁, G₂,… such that G_i is not a minor of G_j for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?₀A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016     

图的k-单圈划分中的优化问题

图的划分问题曾引起图论界的广泛关注，在文献[4]中讨论了k-单圈划分，本文进一步研究基于k-单圈划分的优化问题，即在一个赋权图中求一个最小权可k-单圈划分的支撑子图，以及对一个不存在k-单圈划分支撑子图的图，如何添最少的边使得它有k-单圈划分的支撑子图。     

Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results

We present anO(p · n) algorithm for the problem of finding disjoint simple paths of minimum total length betweenp given pairs of terminals on oriented partial 2-trees withn nodes and positive or negative arc lengths. The algorithm is inO(n) if all terminals are distinct nodes. We characterize the convex hull of the feasible solution set for the casep=2.We gratefully acknowledge the referee's many helpful suggestions to improve the presentation of this paper.     

The trigonometric triangle

A procedure is presented by which the integration of a function such as cos ⁿ (x) or sin ⁿ (x) with n = 1, 2, 3, 4 … is facilitated.     

Reprint of : Measuring the Luttinger liquid parameter with shot noise

We explore the low-frequency noise of interacting electrons in a one-dimensional structure (quantum wire or interaction-coupled edge states) with counterpropagating modes, assuming a single channel in each direction. The system is driven out of equilibrium by a quantum point contact (QPC) with an applied voltage, which induces a double-step energy distribution of incoming electrons on one side of the device. A second QPC serves to explore the statistics of outgoing electrons. We show that measurement of a low-frequency noise in such a setup allows one to extract the Luttinger liquid constant K which is the key parameter characterizing an interacting 1D system. We evaluate the dependence of the zero-frequency noise on K and on parameters of both QPCs (transparencies and voltages).     

电场和应力作用下氮钝化扶手型氧化锌纳米带的电子结构和磁特性

采用密度泛函理论(DFT)方法,在LDA+U水平下详细研究了电场和应力作用下氮钝化扶手型氧化锌纳米带(NA8-ZnONRs)的电子结构和磁特性。对体系的电子结构和磁性进行详细的计算,结果表明：本征扶手型氧化锌纳米带(A8-ZnONRs)是无磁性P型半导体。氮钝化后NA8-ZnONRs具有铁磁金属性,其磁性主要来源于N2p轨道(2.56μ_B)和O2p轨道(0.69μ_B)电子的自旋极化,总磁矩为3.21μ_B。NA8-ZnONRs体系对X方向电场有较强的响应,通过调节X方向电场的幅度,可以有效调节体系的磁矩。在X方向电场作用下体系仍具有铁磁金属性,磁性也主要来源于N2p和O2p轨道电子的自旋极化。施加X方向应力作用后,体系仍表现为铁磁金属性。与NA8-ZnONRs纳米带磁矩相比,体系的总磁矩均发生了较大幅度的增长,表明体系对应力作用具有较明显的相应。但随着应力幅度的调节,总磁矩的变化较平坦。表明施加应力可以有效调节体系的磁矩,但在较小应力范围内,体系对应力变化的相应不明显。