Little higgs models and T parity

Little Higgs models are an interesting extension of the Standard Model at the TeV scale. They provide a simple and attractive mechanism of electroweak symmetry breaking. We review one of the simplest models of this class, the Littlest Higgs model, and its extension with T parity. The model with T parity satisfies precision electroweak constraints without fine-tuning, contains an attractive dark matter candidate, and leads to interesting phenomenology at the Large Hadron Collider (LHC).     

The Level-split of the Two-level Entangled Atom in an Optical Field

The behavior of a two-level entangled atom in an optical field with circular polarization is studied in this paper. The interaction of an optical field and one of the entangled atoms is analyzed in detail. A general solution of the SchrAo¨Gdinger equation about the motion of the entangled atom is obtained. The properties of the action are dependent on the initial state of the atom. By detecting the entangled atom out of the field, we can obtain the state of the other atom moving in the field. It is shown that the state of the atom out of the field will influence the energies of the split-levels of the atom in the field.     

Lorentz-Compton佯谬与一个双赢判决性散射实验设计

通过对“可见光区域是否存在Compton效应”的讨论而进一步深化到经典条件下“光的量子理论能否包含光的经典电磁理论”的实验验证,发现了Lorentz-Compton佯谬,并基于逆Compton散射设计了一个敏感而又可行的双赢判决性散射实验来解决此佯谬。     

上海基础房价相关指标及走势的分析与研究

基础房价的相关指标及其走势一直是大众关心的热门话题．本文通过对上海基础房价相关指标的分析，建立了市场房价走势的两个数学模型．模型一：在相关性分析的基础上利用主成分分析消除指标间的共线性，再用回归拟合房价模型并进行预测；模型二：在相关性分析的基础上利用核估计方法预测出房价．继呵对2005年下半年的房价走势进行了预测，得出的结果与实际情况相吻合．     

Partitioning series-parallel multigraphs into ν *-excluding edge covers

We prove that, for any given vertex ν* in a series-parallel graph G, its edge set can be partitioned into κ = min{κ′(G) + 1, δ(G)} subsets such that each subset covers all the vertices of G possibly except for ν*, where δ(G) is the minimum degree of G and κ′(G) is the edge-connectivity of G. In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for actually finding such a partition by our proof.     

~ Transform Demonstration of Dark Soliton Solutions Found by Inverse Scattering

One of the basic problems about the inverse scattering transform for solving a completely integrable nonlinear evolutions equation is to demonstrate that the Jost solutions obtained from the inverse scattering equations of Cauchy integral satisfy the Lax equations. Such a basic problem still exists in the procedure of deriving the dark soliton solutions of the NLS equation in normal dispersion with non-vanishing boundary conditions through the inverse scattering transform. In this paper, a pair of Jost solutions with same analytic properties are composed to be a 2 × 2 matrix and then another pair are introduced to be its right inverse confirmed by the Liouville theorem. As they are both 2 × 2 matrices, the right inverse should be the left inverse too, based upon which it is not difficult to show that these Jost solutions satisfy both the first and second Lax equations. As a result of compatibility condition, the dark soliton solutions definitely satisfy the NLS equation in normal dispersion with non-vanishing boundary conditions.     

Fast algorithms for determining the linear complexities of sequences over GF(pm) with the period 3n

In this paper, for the the primes p such that 3 is a divisor of p − 1, we prove a result which reduces the computation of the linear complexity of a sequence over GF(p ^m) (any positive integer m) with the period 3n (n and p ^m − 1 are coprime) to the computation of the linear complexities of three sequences with the period n. Combined with some known algorithms such as generalized Games-Chan algorithm, Berlekamp-Massey algorithm and Xiao-Wei-Lam-Imamura algorithm, we can determine the linear complexity of any sequence over GF(p ^m) with the period 3n (n and p ^m − 1 are coprime) more efficiently.     

Enumeration of inequivalent irreducible Goppa codes

We consider irreducible Goppa codes over F_q of length qⁿ defined by polynomials of degree r, where q is a prime power and n,r are arbitrary positive integers. We obtain an upper bound on the number of such codes.     

Speedup estimates for some variants of the parallel implementations of the branch-and-bound method

The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered.     

A Joint Integral Test for the Locations of Extrema for Brownian Motion

Let μ⁺(t) and μ⁻(t) be the locations of the maximum and minimum, respectively, of a standard Brownian motion in the interval [0,t]. We establish a joint integral test for the lower functions of μ⁺(t) and μ⁻(t), in the sense of Paul Lévy. In particular, it yields the law of the iterated logarithm for max(μ⁺(t),μ⁻(t)) as a straightforward consequence. Our result is in agreement with well-known theorems of Chung and Erdős [(1952) Trans. Amer. Math. Soc. 72, 179–186.], and Csáki, F?ldes and Révész [(1987) Prob. Theory Relat. Fields 76, 477–497].