Sparse pseudo‐random graphs are Hamiltonian

In this article we study Hamilton cycles in sparse pseudo‐random graphs. We prove that if the second largest absolute value λ of an eigenvalue of a d‐regular graph G on n vertices satisfies and n is large enough, then G is Hamiltonian. We also show how our main result can be used to prove that for every c >0 and large enough n a Cayley graph X (G,S), formed by choosing a set S of c log⁵ n random generators in a group G of order n, is almost surely Hamiltonian. © 2002 Wiley Periodicals, Inc. J Graph Theory 42: 17–33, 2003     

Strongly Modular Subgroup in Finite Group

Ｓｔｒｏｎｇｌｙ　Ｍｏｄｕｌａｒ　Ｓｕｂｇｒｏｕｐ　ｉｎ　Ｆｉｎｉｔｅ　ＧｒｏｕｐＳｔｒｏｎｇｌｙＭｏｄｕｌａｒＳｕｂｇｒｏｕｐｉｎＦｉｎｉｔｅＧｒｏｕｐ￥ＹｕＪｉａｎｌｉ；ＪｉａｏＤｏｎｇｗｕ（ＬｕｏｙａｎｇＩｎｓｔｉｔｕｔｅｏｆＴｅｃｈｎｏｌｏｇ...     

Near-perfect matrices

A 0, 1 matrixA isnear-perfect if the integer hull of the polyhedron {x0: Ax } can be obtained by adding one extra (rank) constraint. We show that in general, such matrices arise as the cliquenode incidence matrices of graphs. We give a colouring-like characterization of the corresponding class of near-perfect graphs which shows that one need only check integrality of a certain linear program for each 0, 1, 2-valued objective function. This in contrast with perfect matrices where it is sufficient to check 0, 1-valued objective functions. We also make the following conjecture: a graph is near-perfect if and only if sequentially lifting any rank inequality associated with a minimally imperfect graph results in the rank inequality for the whole graph. We show that the conjecture is implied by the Strong Perfect Graph Conjecture. (It is also shown to hold for graphs with no stable set of size eleven.) Our results are used to strengthen (and give a new proof of) a theorem of Padberg. This results in a new characterization of minimally imperfect graphs: a graph is minimally imperfect if and only if both the graph and its complement are near-perfect.The research has partially been done when the author visited Mathematic Centrum, CWI, Amsterdam, The Netherlands.     

基于能力培养的应用型本科物理实验教学模式探索

通过对传统大学物理实验教学现状的分析和讨论,针对目前大学物理实验课程的教学模式进行研究,在遵循实验教学自身规律的前提下,构建"模块化"实验课程教学模式,从而改善课程结构,为培养学生解决具体问题的实践能力和创新思维提供针对性的训练;并采用"启发式""问题式"的教学方法和多样化的考核评价标准,对于不同专业、不同基础、不同背景的学生进行差异化教学,建立以人才培养为核心的科学教学体系,进一步提高大学物理实验课程的教学质量和效果.     

A novel configuration model for random graphs with given degree sequence

Recently, random graphs in which vertices are characterized by hidden variables controlling the establishment of edges between pairs of vertices have attracted much attention. This paper presents a specific realization of a class of random network models in which the connection probability between two vertices (i,j) is a specific function of degrees ki and kj. In the framework of the configuration model of random graphs, we find the analytical expressions for the degree correlation and clustering as a function of the variance of the desired degree distribution. The obtained expressions are checked by means of numerical simulations. Possible applications of our model are discussed.     

Scaling spectra and return times of dynamical systems

The grand canonical version of the spectrum of singularities formalism is presented, relying naturally upon certain Markov transition graphs. The structure of a graph is simply determined by the close return times of the dynamical system described. Thus, an intimate connection exists between the shape of the singularity curve and a small but interesting set of dynamical properties.     

分数阶Chua's系统错位同步无感模块化电路实现及应用

基于分数阶混沌系统稳定性理论, 设计高效的非线性控制器, 实现初始值不同的两个分数阶Chua's系统错位投影同步. 根据分数阶复频域近似方法, 提出分数阶系统的等效电路, 实现分数阶Chua's系统错位投影同步的无感模块化电路. 最后,利用改进的混沌掩盖通信原理, 将以上同步方案应用于混沌保密通信中, 在发送端使用分数阶混沌序列对有用信号加密传送, 从接收端可以无失真地恢复出有用信号. 数值仿真与电路仿真证实了提出方案的可行性. 关键词： 分数阶Chua's系统 错位投影同步 无感模块化电路 保密通信     

Quantum Mayer Graphs for Coulomb Systems and the Analog of the Debye Potential

Within the Feynman–Kac path integral representation, the equilibrium quantities of a quantum plasma can be represented by Mayer graphs. The well known Coulomb divergencies that appear in these series are eliminated by partial resummations. In this paper, we propose a resummation scheme based on the introduction of a single effective potential that is the quantum analog of the Debye potential. A low density analysis of shows that it reduces, at short distances, to the bare Coulomb interaction between the charges (which is able to lead to bound states). At scale of the order of the Debye screening length ^–1 _D, approaches the classical Debye potential and, at large distances, it decays as a dipolar potential (this large distance behaviour is due to the quantum nature of the particles). The prototype graphs that result from the resummation obey the same diagrammatical rules as the classical graphs of the Abe–Meeron series. We give several applications that show the usefulness of to account for Coulombic effects at all distances in a coherent way.     

Families of Line-Graphs and Their Quantization

Any directed graph G with N vertices and J edges has an associated line-graph L(G) where the J edges form the vertices of L(G). We show that the non-zero eigenvalues of the adjacency matrices are the same for all graphs of such a family L ⁿ (G). We give necessary and sufficient conditions for a line-graph to be quantisable and demonstrate that the spectra of associated quantum propagators follow the predictions of random matrices under very general conditions. Line-graphs may therefore serve as models to study the semiclassical limit (of large matrix size) of a quantum dynamics on graphs with fixed classical behaviour.     

Experimental probes of emergent symmetries in the quantum Hall system

Experiments studying renormalization group flows in the quantum Hall system provide significant evidence for the existence of an emergent holomorphic modular symmetry Γ₀(2)${\Gamma }_0(2)$. We briefly review this evidence and show that, for the lowest temperatures, the experimental determination of the position of the quantum critical points agrees to the parts per mille   level with the prediction from Γ₀(2)${\Gamma }_0(2)$. We present evidence that experiments giving results that deviate substantially from the symmetry predictions are not cold enough to be in the quantum critical domain. We show how the modular symmetry extended by a non-holomorphic particle–hole duality leads to an extensive web of dualities related to those in plateau–insulator transitions, and we derive a formula relating dual pairs (B,Bd)$(B,B_d)$ of magnetic field strengths across any transition. The experimental data obtained for the transition studied so far is in excellent agreement with the duality relations following from this emergent symmetry, and rule out the duality rule derived from the “law of corresponding states”. Comparing these generalized duality predictions with future experiments on other transitions should provide stringent tests of modular duality deep in the non-linear domain far from the quantum critical points.