Combinatorial R Matrices for a Family of Crystals: B(1)n,D(1)n,A(2)2n,and D(2)n + 1 Cases

For coherent families of crystals of affine Lie algebras of type B⁽¹⁾_n, D⁽¹⁾_n, A⁽²⁾_2n, and D⁽²⁾_n + 1 we describe the combinatorial R matrix using column insertion algorithms for B, C, D Young tableaux. This is a continuation of previous work by the authors (2000, in “Physical Combinatorics” (M. Kashiwara and T. Miwa, Eds.), Birkhäuser, Boston).     

On generalized Jordan 1-derivation in rings

Let n ⩾ 1 be a fixed integer and let R be an (n + 1)!-torsion free 1-ring with identity element e. If F, d:R → R are two additive mappings satisfying F(xⁿ⁺¹) = F(x)(x¹)ⁿ + xd(x)(x¹)ⁿ⁻¹ + x²d(x)(x¹)ⁿ⁻²+ ⋯ +xⁿd(x) for all x ∈ R, then d is a Jordan 1-derivation and F is a generalized Jordan 1-derivation on R.     

New exact solitary-wave special solutions for the nonlinear dispersive K(m, n) equations

In this paper, we study the nonlinear dispersive K(m, n) equations: u_t + (u^m)_x − (uⁿ)_xxx = 0 which exhibit solutions with solitary patterns. New exact solitary solutions are found. The two special cases, K(2, 2) and K(3, 3), are chosen to illustrate the concrete features of the decomposition method in K(m, n) equations. The nonlinear equations K(m, n) are studied for two different cases, namely when m = n being odd and even integers. General formulas for the solutions of K(m, n) equations are established.     

Maximal subgroups of the Coxeter group W(H4) and quaternions

The largest finite subgroup of O(4) is the non-crystallographic Coxeter group W(H₄) of order 14,400. Its derived subgroup is the largest finite subgroup W(H₄)/Z₂ of SO(4) of order 7200. Moreover, up to conjugacy, it has five non-normal maximal subgroups of orders 144, two 240, 400 and 576. Two groups [W(H₂) × W(H₂)] ⋊ Z₄ and W(H₃) × Z₂ possess non-crystallographic structures with orders 400 and 240 respectively. The groups of orders 144, 240 and 576 are the extensions of the Weyl groups of the root systems of SU(3) × SU(3), SU(5) and SO(8) respectively. We represent the maximal subgroups of W(H₄) with sets of quaternion pairs acting on the quaternionic root systems.     

Characterizations of PG(n − 1, q)\PG(k − 1, q) by Numerical and Polynomial Invariants

We show that the simple matroid PG(n − 1, q)\PG(k − 1, q), for n ≥ 4 and 1 ≤ k ≤ n − 2, is characterized by a variety of numerical and polynomial invariants. In particular, any matroid that has the same Tutte polynomial as PG(n − 1, q)\PG(k − 1, q) is isomorphic to PG(n − 1, q)\PG(k − 1, q).     

Exact special solitary solutions with compact support for the nonlinear dispersive K(m, n) equations

The nonlinear dispersive K(m, n) equations, u_t−(u^m)_x−(uⁿ)_xxx = 0 which exhibit compactons: solitons with compact support, are studied. New exact solitary solutions with compact support are found. The two special cases, K(2, 2) and K(3, 3), are chosen to illustrate the concrete features of the decomposition method in K(m, n) equations. General formulas for the solutions of K(m, n) equations are established.     

Group theory and unification of forces: Application to ‘non-universal’ gaugino masses

We will give an overview on how to embed the Standard Model (SM), based on SU(3) × SU(2) × U(1), within larger groups. We will review the different chains one follows when spontaneously breaking SO(10) down to the SM. Finally, We shall discuss the question of non-universal gaugino masses in supersymmetric SO(10) theories.     

The geometry of SO(n)\SO0(n, 1)

Consider the Lie group SO₀(n, 1) with the left-invariant metric coming from the Killing-Cartan form. The maximal compact subgroup SO(n) of the isometry group acts from the left and right. This paper studies the geometry of the quotient space of the homogeneous submersion SO₀(n, 1) → SO(n)\SO₀(n, 1). It is a cohomogeneity one manifold, which can be expressed as a warped product. Its group of isometries, geodesics, and sectional curvatures are calculated.     

Fast Rectangular Matrix Multiplication and Applications

First we study asymptotically fast algorithms for rectangular matrix multiplication. We begin with new algorithms for multiplication of ann×nmatrix by ann×n²matrix in arithmetic timeO(n^ω),ω=3.333953…, which is less by 0.041 than the previous record 3.375477…. Then we present fast multiplication algorithms for matrix pairs of arbitrary dimensions, estimate the asymptotic running time as a function of the dimensions, and optimize the exponents of the complexity estimates. For a large class of input matrix pairs, we improve the known exponents. Finally we show three applications of our results:   (a) we decrease from 2.851 to 2.837 the known exponent of the work bounds for fast deterministic (NC) parallel evaluation of the determinant, the characteristic polynomial, and the inverse of ann×nmatrix, as well as for the solution to a nonsingular linear system ofnequations,   (b) we asymptotically accelerate the known sequential algorithms for the univariate polynomial composition mod xⁿ, yielding the complexity boundO(n^1.667) versus the old record ofO(n^1.688), and for the univariate polynomial factorization over a finite field, and   (c) we improve slightly the known complexity estimates for computing basic solutions to the linear programming problem withmconstraints andnvariables.     

Statistical properties of nucleotides in human chromosomes 21 and 22

In this paper the statistical properties of nucleotides in human chromosomes 21 and 22 are investigated. The n-tuple Zipf analysis with n = 3, 4, 5, 6, and 7 is used in our investigation. It is found that the most common n-tuples are those which consist only of adenine (A) and thymine (T), and the rarest n-tuples are those in which GC or CG pattern appears twice. With the n-tuples become more and more frequent, the double GC or CG pattern becomes a single GC or CG pattern. The percentage of four nucleotides in the rarest ten and the most common ten n-tuples are also considered in human chromosomes 21 and 22, and different behaviors are found in the percentage of four nucleotides. Frequency of appearance of n-tuple f(r) as a function of rank r is also examined. We find the n-tuple Zipf plot shows a power-law behavior for r < 4ⁿ⁻¹ and a rapid decrease for r > 4ⁿ⁻¹. In order to explore the interior statistical properties of human chromosomes 21 and 22 in detail, we divide the chromosome sequence into some moving windows and we discuss the percentage of ξη (ξ, η = A, C, G, T) pair in those moving windows. In some particular regions, there are some obvious changes in the percentage of ξη pair, and there maybe exist functional differences. The normalized number of repeats N₀(l) can be described by a power law: N₀(l) ∼ l^−μ. The distance distributions P₀(S) between two nucleotides in human chromosomes 21 and 22 are also discussed. A two-order polynomial fit exists in those distance distributions: log P₀(S) = a + bS + cS², and it is quite different from the random sequence.     

Matrix characterization of linear codes with arbitrary Hamming weight hierarchy

The support of an [n, k] linear code C over a finite field F_q is the set of all coordinate positions such that at least one codeword has a nonzero entry in each of these coordinate position. The rth generalized Hamming weight d_r(C), 1 ⩽ r ⩽ k, of C is defined as the minimum of the cardinalities of the supports of all [n, r] subcodes of C. The sequence (d₁(C), d₂(C), … , d_k(C)) is called the Hamming weight hierarchy (HWH) of C. The HWH, d_r(C) = n − k + r;  r = 1, 2 , …, k, characterizes maximum distance separable (MDS) codes. Therefore the matrix characterization of MDS codes is also the characterization of codes with the HWH d_r(C) = n − k + r; r = 1, 2, … , k. A linear code C with systematic check matrix [I∣P], where I is the (n − k) × (n − k) identity matrix and P is a (n − k) × k matrix, is MDS iff every square submatrix of P is nonsingular. In this paper we extend this characterization to linear codes with arbitrary HWH. Using this result, we characterize Near-MDS codes, Near-Near-MDS (N²-MDS) codes and A^μ-MDS codes. The MDS-rank of C is the smallest integer η such that d_η+1 = n − k + η + 1 and the defect vector of C with MDS-rank η is defined as the ordered set {μ₁(C), μ₂(C), μ₃(C), … , μ_η(C), μ_η+1(C)}, where μ_i(C) = n − k + i − d_i(C). We call C a dually defective code if the defect vector of the code and its dual are the same. We also discuss matrix characterization of dually defective codes. Further, the codes meeting the generalized Greismer bound are characterized in terms of their generator matrix. The HWH of dually defective codes meeting the generalized Greismer bound are also reported.     

Pattern Frequency Sequences and Internal Zeros

Let q be a pattern and let S_n, q(c) be the number of n-permutations having exactly c copies of q. We investigate when the sequence (S_n, q(c))_c ≥ 0 has internal zeros. If q is a monotone pattern it turns out that, except for q = 12 or 21, the nontrivial sequences (those where n is at least the length of q) always have internal zeros. For the pattern q = 1(l + 1)l…2 there are infinitely many sequences which contain internal zeros and when l = 2 there are also infinitely many which do not. In the latter case, the only possible places for internal zeros are the next-to-last or the second-to-last positions. Note that by symmetry this completely determines the existence of internal zeros for all patterns of length at most 3.     

New exact solution profiles of the nonlinear dispersion Drinfel’d–Sokolov (D(m, n)) system

In this paper, to understand the role of nonlinear dispersion in the coupled systems, the nonlinear dispersion Drinfel’d–Sokolov system (called D(m, n) system) is investigated. As a consequence, many types of compacton and solitary pattern solutions are obtained. Moreover, some solitary wave solutions are also deduced for differential parameters m, n. When n = 1, the D(m, 1) system with linear dispersion is shown to possess also compacton and solitary pattern solutions, which contain the known results. Moreover, some rational solutions of D(m, n) system are also deduced.     

On Certain C-Test Words for Free Groups

Let F_m be a free group of a finite rank m ≥ 2 and let X_i, Y_j be elements in F_m. A non-empty word w(x₁,…,x_n) is called a C-test word in n letters for F_m if, whenever (X₁,…,X_n) = w(Y₁,…,Y_n) ≠ 1, the two n-typles (X₁,…,X_n) and (Y₁,…,Y_n) are conjugate in F_m. In this paper we construct, for each n ≥ 2, a C-test word v_n(x₁,…,x_n) with the additional property that v_n(X₁,…,X_n) = 1 if and only if the subgroup of F_m generated by X₁,…,X_n is cyclic. Making use of such words v_m(x₁,…,x_m) and v_m + 1(x₁,…,x_m + 1), we provide a positive solution to the following problem raised by Shpilrain: There exist two elements u₁, u₂ ∈ F_m such that every endomorphism ψ of F_m with non-cyclic image is completely determined by ψ(u₁), ψ(u₂).     

A semi-Markov process with an inverse Gaussian distribution as sojourn time

Let X_n denote the state of a device after n repairs. We assume that the time between two repairs is the time τ taken by a Wiener process {W(t), t ? 0}, starting from w₀ and with drift μ < 0, to reach c ∈ [0, w₀). After the nth repair, the process takes on either the value X_n?1 + 1 or X_n?1 + 2. The probability that X_n = X_n?1 + j, for j = 1, 2, depends on whether τ ? t₀ (a fixed constant) or τ > t₀. The device is considered to be worn out when X_n ? k, where k ∈ {1, 2, …}. This model is based on the ones proposed by Rishel (1991) [1] and Tseng and Peng (2007) [2]. We obtain an explicit expression for the mean lifetime of the device. Numerical methods are used to illustrate the analytical findings.     

Space–time symmetry violation,configuration mixing model and E-infinity theory

We have studied the time reversal symmetry violation on the bases of the configuration mixing model and E-infinity theory. With the use of the Cabibbo angle approximation, we have presented the transformation matrix in terms of the golden ratio (?), and shown that the time reversal symmetry violation is described by the configuration mixing of the unstable and stable manifolds (W^u, W^s). The magnitude of the mixing for the weak interaction field is given by the expression sin² θ_T(theor) ≈ sin⁴ θ_C(theor) ≈ (?)¹² = 3.105 × 10^?3, which is compared to the Kaon decay experiment ～2.3 × 10^?3. We have also discussed the space–time symmetry violation by using the CPT theorem.     

Structurally unstable regular dynamics in 1D piecewise smooth maps,and circle maps

In this work we consider a simple system of piecewise linear discontinuous 1D map with two discontinuity points: X′ = aX if ∣X∣ < z, X′ = bX if ∣X∣ > z, where a and b can take any real value, and may have several applications. We show that its dynamic behaviors are those of a linear rotation: either periodic or quasiperiodic, and always structurally unstable. A generalization to piecewise monotone functions X′ = F(X) if ∣X∣ < z, X′ = G(X) if ∣X∣ > z is also given, proving the conditions leading to a homeomorphism of the circle.     

Lower Bounds on the Depth of Monotone Arithmetic Computations

Consider an arithmetic expression of lengthninvolving only the operations {+, ×} and non-negative constants. We prove lower bounds on the depth of any binary computation tree over the same sets of operations and constants that computes such an expression. We exhibit a family of arithmetic expressions that requires computation trees of depth at least 1.5 log₂ n−O(1), thus proving a conjecture of S. R. Kosaraju (1986,in“Proc. of the 18th ACM Symp. on Theory Computing,” pp. 231–239). In contrast, Kosaraju showed how to compute such expressions with computation trees of depth 2 log₂ n+O(1).