Length computation of matrix subalgebras of special type

Let {ie910-01} be a field and let {ie910-02} be a finite-dimensional {ie910-03}-algebra. We define the length of a finite generating set of this algebra as the smallest number k such that words of length not greater than k generate {ie910-04} as a vector space, and the length of the algebra is the maximum of the lengths of its generating sets. In this article, we give a series of examples of length computation for matrix subalgebras. In particular, we evaluate the lengths of certain upper triangular matrix subalgebras and their direct sums, and the lengths of classical commutative matrix subalgebras. The connection between the length of an algebra and the lengths of its subalgebras is also studied. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 13, No. 4, pp. 165–197, 2007.     

Edge-decompositions of highly connected graphs into paths

We prove that a graph of edge-connectivity at least has an edge-decomposition into paths of length 4 if and only its size is divisible by 4. We also prove that a graph of girth >m and of edge-connectivity at least 8 ^m has an edge-decomposition into paths of length m provided its size is divisible by m, and m is a power of 2.      

Subwords in Reverse-Complement Order

We examine finite words over an alphabet of pairs of letters, where each word w₁w₂ ... w_t is identified with its reverse complement where ( ). We seek the smallest k such that every word of length n, composed from Γ, is uniquely determined by the set of its subwords of length up to k. Our almost sharp result (k~ 2n = 3) is an analogue of a classical result for “normal” words. This problem has its roots in bioinformatics. Received October 19, 2005     

Convergence of Associated Continued Fractions Revised

This is an expository article which contains alternative proofs of many theorems concerning convergence of a continued fraction to a holomorphic function. The continued fractions which are studied are continued fractions of the form

On cyclic codes of length $${2^{2^r}-1}$$ with two zeros whose dual codes have three weights

In 1976, Helleseth conjectured that two binary m-sequences of length 2 ^m − 1 can not have a three-valued crosscorrelation function when m is a power of 2. We show that this conjecture is true when −1 is a correlation value. In other words, if C_1,k{{\mathcal{C}}_{1,k}} is the cyclic code of length 2 ^m − 1 with two zeros α, α ^k , where α is a primitive element of \mathbbF_2^m{{\mathbb{F}}_{2^m}} and gcd(k, 2 ^m − 1) = 1, then its dual C_1,k^{^}{{\mathcal{C}}_{1,k}^{\perp}} can not have three weights when m is a power of 2.     

Lengths of periods of continued fractions of square roots of integers

Empirical study of the period’s length T of the continued fractions of $\sqrt{Q}$ (for growing integers Q) shows several strange asymptotical results, for instance, $T\leq C\sqrt{Q}\ln{Q}$ . These results show important differences between the statistics of the elements of the continued fractions of random real numbers and of square roots of random integers.     

On the convergence of continued fractions at Runckel’s points

We consider the limit periodic continued fractions of Stieltjes type

The Iterated Aluthge Transform of an Operator

The Aluthge transform (defined below) of an operator T on Hilbert space has been studied extensively, most often in connection with p-hyponormal operators. In [6] the present authors initiated a study of various relations between an arbitrary operator T and its associated , and this study was continued in [7], in which relations between the spectral pictures of T and were obtained. This article is a continuation of [6] and [7]. Here we pursue the study of the sequence of Aluthge iterates { ⁽ⁿ⁾} associated with an arbitrary operator T. In particular, we verify that in certain cases the sequence { ⁽ⁿ⁾} converges to a normal operator, which partially answers Conjecture 1.11 in [6] and its modified version below (Conjecture 5.6). Submitted: December 5, 2000? Revised: August 30, 2001.     

Ramanujan’s inverse elliptic arc approximation

We suggest a continued fraction origin to Ramanujan’s approximation to $(\frac{a-b}{a+b})^{2}$ in terms of the arc length of an ellipse with semiaxes a and b.     

Connectivity properties of horospheres in Euclidean buildings and applications to finiteness properties of discrete groups

Let G(O_S)\mathbf{G}(\mathcal{O}_{S}) be an S-arithmetic subgroup of a connected, absolutely almost simple linear algebraic group G over a global function field K. We show that the sum of local ranks of G determines the homological finiteness properties of G(O_S)\mathbf{G}(\mathcal{O}_{S}) provided the K-rank of G is 1. This shows that the general upper bound for the finiteness length of G(O_S)\mathbf{G}(\mathcal{O}_{S}) established in an earlier paper is sharp in this case.     

Diophantine Approximations on Fractals

We exploit dynamical properties of diagonal actions to derive results in Diophantine approximations. In particular, we prove that the continued fraction expansion of almost any point on the middle third Cantor set (with respect to the natural measure) contains all finite patterns (hence is well approximable). Similarly, we show that for a variety of fractals in [0, 1]², possessing some symmetry, almost any point is not Dirichlet improvable (hence is well approximable) and has property C (after Cassels). We then settle by similar methods a conjecture of M. Boshernitzan saying that there are no irrational numbers x in the unit interval such that the continued fraction expansions of {nx mod 1}_{n ? \mathbb N}{\{nx\,{\rm mod}\,1\}_{n \in {\mathbb N}}} are uniformly eventually bounded.     

Minimal Length Elements of Thompson's Group F

Elements of the group are represented by pairs of binary trees and the structure of the trees gives insight into the properties of the elements of the group. The review section presents this representation and reviews the known relationship between elements of F and binary trees. In the main section we give a method of determining the minimal lengths of elements of Thompson's group F in the two generator presentation

Accelerating convergence of limit periodic continued fractionsK(a n /1)

Summary It is shown that the convergence of limit periodic continued fractionsK(a _n /1) with lima _n =a can be substantially accelerated by replacing the sequence of approximations {S _n (0)} by the sequence {S _n (x ₁)}, where . Specific estimates of the improvement are derived.     

Distributions of Numbers of Success Runs of Fixed Length in Markov Dependent Trials

Let {Z _n , n 1} be a time-homogeneous {0, 1}-valued Markov chain, and let N _n be a random variable denoting the number of runs of "1" of length k in the first n trials. In this article we conduct a systematic study of N _n by establishing formulae for the evaluation of its probability generating function, probability mass function and moments. This is done in three different enumeration schemes for counting runs of length k, the "non-overlapping", the "overlapping" and the "at least" scheme. In the special case of i.i.d. trials several new results are established.     

Lattices of Order-Convex Sets of Forests

We give a characterization of the class Co(F)\mathbf{Co}(\mathcal{F}) [Co(F_n)\mathrm{\mathbf{Co}}(\mathcal{F}_n), n < ω, respectively] of lattices isomorphic to convexity lattices of posets which are forests [forests of length at most n, respectively], as well as of the class Co(L)\mathbf{Co}(\mathcal{L}) of lattices isomorphic to convexity lattices of linearly ordered posets. This characterization yields that the class of finite members from Co(F)\mathbf{Co}(\mathcal{F}) [from Co(F_n)\mathbf{Co}(\mathcal{F}_n), n < ω, or from Co(L)\mathbf{Co}(\mathcal{L})] is finitely axiomatizable within the class of finite lattices.     

On zero-sum sequences of prescribed length

Summary. Let k ≥ 1 be any integer. Let G be a finite abelian group of exponent n. Let s_k(G) be the smallest positive integer t such that every sequence S in G of length at least t has a zero-sum subsequence of length kn. We study this constant for groups when d = 3 or 4. In particular, we prove, as a main result, that for every k ≥ 4, and for every prime p ≥ 5.     

Orthogonal vectors in then-dimensional cube and codes with missing distances

Fork a positive integer letm(4k) denote the maximum number of ±1-vectors of length 4k so that no two are orthogonal. Equivalently,m(4k) is the maximal number of codewords in a code of length 4k over an alphabet of size two, such that no two codewords have Hamming distance 2k. It is proved thatm(4k)=4 ifk is the power of an odd prime.     

A construction of maximal linearly independent array

Let M be a subset of r-dimensional vector space Vτ （F2） over a finite field F2, consisting of n nonzero vectors, such that every t vectors of M are linearly independent over F2. Then M is called （n, t）-linearly independent array of length n over Vτ（F2）. The （n, t）-linearly independent array M that has the maximal number of elements is called the maximal （r, t）-linearly independent array, and the maximal number is denoted by M（r, t）. It is an interesting combinatorial structure, which has many applications in cryptography and coding theory. It can be used to construct orthogonal arrays, strong partial balanced designs. It can also be used to design good linear codes, In this paper, we construct a class of maximal （r, t）-linearly independent arrays of length r ＋ 2, and provide some enumerator theorems.     

Bilateral semidirect product decompositions of transformation monoids

In this paper we consider the monoid OR_n\mathcal {OR}_{n} of all full transformations on a chain with n elements that preserve or reverse the orientation, as well as its submonoids OD_n\mathcal {OD}_{n} of all order-preserving or order-reversing elements, OP_n\mathcal {OP}_{n} of all orientation-preserving elements and O_n\mathcal {O}_{n} of all order-preserving elements. By making use of some well known presentations, we show that each of these four monoids is a quotient of a bilateral semidirect product of two of its remarkable submonoids.