Random matrix products and applications to cellular automata

Let λ be the upper Lyapunov exponent corresponding to a product of i.i.d. randomm×m matrices (X _i) _i ^0/∞ over ℂ. Assume that theX _i's are chosen from a finite set {D ₀,D ₁...,D _t-1(ℂ), withP(X _i=D_j)>0, and that the monoid generated byD ₀, D₁,…, D_q−1 contains a matrix of rank 1. We obtain an explicit formula for λ as a sum of a convergent series. We also consider the case where theX _i's are chosen according to a Markov process and thus generalize a result of Lima and Rahibe [22]. Our results on λ enable us to provide an approximation for the numberN _≠0(F(x)ⁿ,r) of nonzero coefficients inF(x) ⁿ.(modr), whereF(x) ∈ ℤ[x] andr≥2. We prove the existence of and supply a formula for a constant α (<1) such thatN _≠0(F(x)ⁿ,r) ≈n ^α for “almost” everyn. Supported in part by FWF Project P16004-N05     

A new approach to the random field problem

A new approach to quenched random problems, based on constructing an equivalent annealed system, is presented. The difficulties with the existing solutions of the random field problem are discussed. The new approach is applied to the random field problem yielding a different new result for the dimensionality shift. A by-product of this result is that the lower critical dimension is 2 for the Ising model.     

Polytopes of constant weight

A study is made of the non-regular planar 3-connected graphs with constant weight.     

The complexity of finding generalized paths in tournaments

Given a tournament with n vertices, we consider the number of comparisons needed, in the worst case, to find a permutation υ₁υ₂…υ_n of the vertices, such that the results of the games υ₁υ₂, υ₂υ₃,…, υ_n−1υ_n match a prescribed pattern. If the pattern requires all arcs to go forwrd, i.e., υ₁ → υ₂, υ₂ → υ₃,…, υ_n−1 → υ_n, and the tournament is transitive, then this is essentially the problem of sorting a linearly ordered set. It is well known that the number of comparisons required in this case is at least cn lg n, and we make the observation that O(n lg n) comparisons suffice to find such a path in any (not necessarily transitive) tournament. On the other hand, the pattern requiring the arcs to alternate backward-forward-backward, etc., admits an algorithm for which O(n) comparisons always suffice. Our main result is the somewhat surprising fact that for various other patterns the complexity (number of comparisons) of finding paths matching the pattern can be cn lg^αn for any α between 0 and 1. Thus there is a veritable spectrum of complexities, depending on the prescribed pattern of the desired path. Similar problems on complexities of algorithms for finding Hamiltonian cycles in graphs and directed graphs have been considered by various authors, [2, pp. 142, 148, 149; 4].     

A problem on conjugacy of matrices

Let F be an infinite field and n?12. Then the number of conjugacy classes of the upper triangular nilpotent matrices in M_n(F) under action by the subgroup of GL_n(F) consisting of all the upper triangular matrices is infinite.     

Nonstandard extension of quantum logic and Dirac's bra-ket formalism of quantum mechanics

An extension of the quantum logical approach to the axiomatization of quantum mechanics usingnonstandard analysis methods is proposed. The physical meaning of a quantum logic as a lattice of propositions is conserved by its nonstandard extension. But not only the usual Hubert space formalism of quantum mechanics can be derived from the nonstandard extended quantum logic. Also the Dirac bra-ket quantum mechanics can be derived as a consequence of such an extended quantum logic.