Divergence of a Random Walk Through Deterministic and Random Subsequences

Let {S _n} _n0 be a random walk on the line. We give criteria for the existence of a nonrandom sequence n _i for which respectively We thereby obtain conditions for to be a strong limit point of {S _n} or {S _n /n}. The first of these properties is shown to be equivalent to for some sequence a _i , where T(a) is the exit time from the interval [–a,a]. We also obtain a general equivalence between and for an increasing function fand suitable sequences n _i and a _i. These sorts of properties are of interest in sequential analysis. Known conditions for and (divergence through the whole sequence n) are also simplified.     

Minimax-robust prediction of discrete time series

Summary We discuss a robust approach for predicting a weakly stationary discrete time series whose spectral density f is not exactly known. We assume that we know that f ), where is a convex set of spectral densities fulfilling some not too stringent conditions. We proof the existence of a most indeterministic density f ⁰ in , and we show that the classical optimal linear predictor for a time series with spectral density f ⁰ is mini-max-robust in the sense that it minimizes the maximal possible prediction error.We investigate some special models , and, in doing so, we illustrate a generally applicable method for determining the robust predictor. In particular, we discuss model sets which are defined by conditions on a finite part of the autocovariance sequence of the corresponding time series. These examples are of particular interest as the most indeterministic density is an autoregressive one, i.e. the robust predictor is finite. We discuss connections between this type of model set and maximum entropy and generalized maximum entropy spectral estimates.     

s-Prime elements in multiplicative lattices

Let be aC-lattice which is strong join principally generated. In this paper, we consider prime elements of for which every semiprimary element is primary. We show, for example, that a compact nonmaximal primep with this property is principal. We also show that if every primepm has this property, then is either a one dimensional domain or a primary lattice. It follows that if every primep satisfies the property, and if there are only a finite number of minimal primes in , then is the finite direct product of one-dimensional domains and primary lattices.     

Spectral Properties of Abelian C*-Algebras

Let be an Abelian unital C ^*-algebra and let denote its Gelfand spectrum. We give some necessary and sufficient conditions for a nondegenerate representation of to be unitarily equivalent to a representation in which the elements of act multiplicatively, by their Gelfand transforms, on a space L ²( ,), where is a positive measure on the Baire sets of . We also compare these conditions with the multiplicity-free property of a representation.     

Théorème de division avec des conditions au bord

Let be an open subset of ⁿ and be a subalgebra of the algebra of analytic functions on . We suppose that satisfies some weak conditions of noetherianity such that we can construct a finite stratification for each ideal of . We also suppose that satifies global £ojasiewicz's inequalities. We prove the following: Let andf C on flat on ; if for eacha the Taylor's serie off ata, T _a f, is in the ideal generated byT _a f ₁,...,T _a f _p in the ring of formal power series, then there exist ₁,..., _p ,C on flat on such that . This result extends the classic Hormander's theorem of division (for a polynomial) or the £ojasiewicz-Malgrange theorem in the local analytic case.Reherches menées dans le cadre du Programme d'Appui à la Recherche Scientifique (PARS MI 33)     

A lower bound for the optimal crossing-free Hamiltonian cycle problem

Consider a drawing in the plane ofK _n , the complete graph onn vertices. If all edges are restricted to be straight line segments, the drawing is called rectilinear. Consider a Hamiltonian cycle in a drawing ofK _n . If no pair of the edges of the cycle cross, it is called a crossing-free Hamiltonian cycle (cfhc). Let (n) represent the maximum number of cfhc's of any drawing ofK _n , and (n) the maximum number of cfhc's of any rectilinear drawing ofK _n . The problem of determining (n) and (n), and determining which drawings have this many cfhc's, is known as the optimal cfhc problem. We present a brief survey of recent work on this problem, and then, employing a recursive counting argument based on computer enumeration, we establish a substantially improved lower bound for (n) and (n). In particular, it is shown that (n) is at leastk × 3.2684 ⁿ . We conjecture that both (n) and (n) are at mostc × 4.5 ⁿ .This research, part of which was conducted at Queen's University, was supported by an N.S.E.R.C. postgraduate scholarship.     

The Invariants of the Clifford Groups

The automorphism group of the Barnes-Wall lattice L _m in dimension 2 ^m (m ; 3) is a subgroup of index 2 in a certain Clifford group of structure 2 ₊ ^1+2m . O ⁺(2m,2). This group and its complex analogue of structure .Sp(2m, 2) have arisen in recent years in connection with the construction of orthogonal spreads, Kerdock sets, packings in Grassmannian spaces, quantum codes, Siegel modular forms and spherical designs. In this paper we give a simpler proof of Runge@apos;s 1996 result that the space of invariants for of degree 2k is spanned by the complete weight enumerators of the codes , where C ranges over all binary self-dual codes of length 2k; these are a basis if m k - 1. We also give new constructions for L _m and : let M be the -lattice with Gram matrix . Then L _m is the rational part of M ^m, and = Aut(M^m). Also, if C is a binary self-dual code not generated by vectors of weight 2, then is precisely the automorphism group of the complete weight enumerator of . There are analogues of all these results for the complex group , with doubly-even self-dual code instead of self-dual code.     

On Some Rings of Arithmetical Functions

In this paper, we consider several constructions which from a given B-product * _B lead to another one We shall be interested in finding what algebraic properties of the ring are shared also by the ring . In particular, for some constructions the rings R _B and will be isomorphic and therefore have the same algebraic properties.     

A randomized algorithm for fixed-dimensional linear programming

We give a (Las Vegas) randomized algorithm for linear programming in a fixed dimensiond for which the expected computation time is , where lim _{d d} = 0. This improves the corresponding worst-case complexity, . The method is based on a recent idea of Clarkson. Two variations on the algorithm are examined briefly.     

The All-Paths Transit Function of a Graph

A transit function R on a set V is a function satisfying the axioms and , for all . The all-paths transit function of a connected graph is characterized by transit axioms.     

K-Theory for the Banach Algebra of Operators on James''s Quasi-reflexive Banach Spaces

We prove that the K-groups of the Banach algebra of bounded, linear operators on the pth James space , where 1 < p < , are given by and . Moreover, for each Banach space and each non-zero, closed ideal contained in the ideal of inessential operators, we show that and . This enables us to calculate the K-groups of for each Banach space which is a direct sum of finitely many James spaces and -spaces.     

A characterization of the line set of an odd-dimensional Baer subspace

Generalizing a theorem of Beutelspacher and Seeger, we consider line sets inP=PG(2t + 1,q),t IN, with the following properties: (1) any (t + 1)-dimensional subspace ofP contains at least one line of , (2) if a pointx ofP is incident with at least two lines of then the points in the factor geometryP/x which are induced by the lines of throughx form a blocking set of type (t, 1) inP/x, (3) any line of is coplanar with at least one further line of . We will show that the examples of minimal cardinality are exactly the line sets of Baer subspaces ofP.     

The Martin boundary and completion of Markov chains

Summary In this paper we treat a time-symmetrical Martin boundary theory for continuous parameter Markov chains. This is done by reversing the time sense of a Markov chainX _t in such a way as to obtain a dual Markov chain , and considering the two chains together. Various relations between the Martin exit boundaries and of these processes are studied. The exit boundary of , is in a sense an entrance boundary forX _t and vice versa. After a natural identification of certain points in and one can topologizeI in such a way thatboth X _t and have standard modifications in this space which are right continuous, have left limits, and are strongly Markov.Research supported in part at Stanford University, Stanford, California under AFOSR 0049.     

On the Spectrum of Cartesian Powers of Classical Automorphisms

We prove the following statement: the set of all essential spectral multiplicities of (n times) is on for Chacon transformations T, or, equivalently, the operator T(ⁿ) has a simple spectrum on the subspace C _Sim of all functions that are invariant with respect to permutations of the coordinates. As an immediate consequence of this fact, we have the disjointness of all convolution powers of the spectral measure for Chacon transformations. If n=2, then T× T has a homogeneous spectrum of multiplicity 2 on , i.e., this is a solution of Rokhlin's problem for Chacon transformations. Similar statements are considered for other classical automorphisms.     

Uniform and universal Glivenko-Cantelli classes

A class of measurable functions on a probability space is called a Glivenko-Cantelli class if the empirical measuresP _n converge to the trueP uniformly over almost surely. is a universal Glivenko-Cantelli class if it is a Glivenko-Cantelli Cantelli class for all lawsP on a measurable space, and a uniform Glivenko-Cantelli class if the convergence is also uniform inP. We give general sufficient conditions for the Glivenko-Cantelli and universal Glivenko-Cantelli properties and examples to show that some stronger conditions are not necessary. The uniform Glivenko-Cantelli property is characterized, under measurability assumptions, by an entropy condition.     

A structure theorem for weak buildings of spherical type

Following earlier work of Tits [8], this paper deals with the structure of buildings which are not necessarily thick; that is, possessing panels (faces of codimension 1) which are contained in two chambers, only. To every building , there is canonically associated a thick building whose Weyl group W( ) can be considered as a reflection subgroup of the Weyl group W() of . One can reconstruct from together with the embedding W( ) W(). Conversely, if is any thick building and W any reflection group containing W( ) as a reflection subgroup, there exists a weak building with Weyl group W and associated thick building .     

A remark concerning the modulus of smoothness introduced by Ditzian and Totik

For each functionf(x) continuous on the segment [–1, 1], we set . We study the relationship between the ordinarykth modulus of continuity of therth derivative of the function and thekth modulus of continuity with weight _r of the rth derivativef ^(r) of the functionf introduced by Ditzian and Totik. Thus, ifr is odd andk is even, we prove that these moduli are equivalent ast0.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 47, No. 12, pp. 1627–1638, December, 1995.     

Transfinite interpolation on the medians of a triangle and best L 1-approximation

Let be a triangle in and let be the set of its three medians. We construct interpolants to smooth functions using transfinite (or blending) interpolation on The interpolants are of type f(₁)+g(₂)+h(₃), where (₁,₂,₃) are the barycentric coordinates with respect to the vertices of . Based on an error representation formula, we prove that the interpolant is the unique best L¹-approximant by functions of this type subject the function to be approximated is from a certain convexity cone in C³().Received: 17 December 2003     

Elementary Abelian Covers of Graphs

Let _G (X) be the set of all (equivalence classes of) regular covering projections of a given connected graph X along which a given group G Aut X of automorphisms lifts. There is a natural lattice structure on _G (X), where _{1 2} whenever ₂ factors through ₁. The sublattice _G () of coverings which are below a given covering : X^~ X naturally corresponds to a lattice _G () of certain subgroups of the group of covering transformations. In order to study this correspondence, some general theorems regarding morphisms and decomposition of regular covering projections are proved. All theorems are stated and proved combinatorially in terms of voltage assignments, in order to facilitate computation in concrete applications.For a given prime p, let _G ^p (X) _G (X) denote the sublattice of all regular covering projections with an elementary abelian p-group of covering transformations. There is an algorithm which explicitly constructs _G ^p (X) in the sense that, for each member of _G ^p (X), a concrete voltage assignment on X which determines this covering up to equivalence, is generated. The algorithm uses the well known algebraic tools for finding invariant subspaces of a given linear representation of a group. To illustrate the method two nontrival examples are included.     

On the Structure of a Certain Class of Mixed Tsirelson Spaces

We study Banach spaces of the form We call such a space a p-space, p[1,), if for every k the space is isomorphic to _pk and the sequence (p_k) strictly decreases to p. We examine the finite block representability of the spaces _r in a p-space proving that it depends not only on p but also on the sequences (p_k) and (n_k). Assuming that _i n_i ^1/q decreases to 0, where q is the conjugate exponent of p, we prove the existence of an asymptotic biorthogonal system in X and also that c ₀ is finitely representable in X. Moreover we investigate the modified versions of p-spaces proving that, if n_km1/pkm-1/pk_m-1 increases to infinity for a subsequence (n_km) , then ₁ embeds into X. We also investigate complemented minimality for the class of spaces where is either a subsequence of the sequence of Schreier classes ( _n)_{n N} or a subsequence of ( _n)_{n N}.