Degree Spectra of Relations on Boolean Algebras

We show that every computable relation on a computable Boolean algebra is either definable by a quantifier-free formula with constants from (in which case it is obviously intrinsically computable) or has infinite degree spectrum.     

Constructive and Non-Constructive Infinite Formulas in Computable Structures

A transition from arbitrary -formulas to computable formulas in the class of computable structures is considered. It is shown that transition of a certain type is possible which doubles the complexity of the formulas. In addition, the complexity jump is analyzed for the transition from an arbitrary Scott family consisting of -formulas to a computable Scott family in a fixed computable structure. Exact estimates of this jump are found.     

On a Hierarchy of Groups of Computable Automorphisms

Basics and results on groups of computable automorphisms are collected in [1].We recall the main definitions. A computable model

Universality of the automorphism group of the real line

We discuss the question, whether each automorphism group (of cardinality at most ) of a linear order is embeddable into the automorphism group of the real line. We show that the answer to this question is independent of the axioms of ZFC: the answer is positive, if we assume < and Souslin's hypothesis; the answer is negative, if we assume orV=L.     

Relatively Hyperimmune Relations on Structures

Let be a computable structure and let R be an additional relation on its domain. We establish a necessary and sufficient condition for the existence of an isomorphic copy of such that the image of R is h-simple (h-immune) relative to .     

Integral Representations for Continuous Linear Functionals in Operator-Initiated Topologies

On a given cone (resp. vector space) we consider an initial topology and order induced by a family of linear operators into a second cone which carries a locally convex topology. We prove that monotone linear functionals on which are continuous with respect to this initial topology may be represented as certain integrals of continuous linear functionals on . Based on the Riesz representation theorem from measure theory, we derive an integral version of the Jordan decomposition for linear functionals on ordered vector spaces.     

Initial Segments of Recursive Linear Orders

We show that any -initial segment of a recursive linear order can be presented recursively.     

On the Geometry of Inner Approximations to the Set of Null Controllability for Constrained Linear Systems

The problem of obtaining inner approximations to the set of null controllability for linear systems is considered, and the geometry of certain sets arising in the approximation of using linear feedback is explored. A two-dimensional example is worked in detail in order to delineate the limitations to the use of linear feedback.     

Sequence Spaces l p,q in Probabilistic Characterizations of Weak Type Operators

We study operators (not necessarily linear) defined on a quasi-Bahach space X and taking values in the space of real-valued Lebesgue-measurable functions. Factorization theorems for linear and superlinear operators with values in the space are proved with the help of the Lorentz sequence spaces . Sequences of functions belonging to fixed bounded sets in the spaces are characterized for and . The possibility of distinguishing weak type operators (bounded in the space ) from operators factorizable through is obtained in terms of sequences of independent random variables. A criterion under which an operator is symmetrically bounded in order in , is established. Some refinements of the above-mentioned results are obtained for translation shift-invariant sets and operators. Bibliography: 30 titles.     

Commutativity of the Arens product in lattice ordered algebras

Let be an Abelian Archimedean lattice ordered algebra. The order bidual furnished with the Arens product is again a lattice ordered algebra. We show that the order continuous order bidual is Abelian. This solves an open problem and improves a result of Scheffold, who proved it for the case of normed lattice ordered algebras. The proof is based on the up-down-up approximation of positive elements in the order continuous order bidual by elements in the canonical image of in Components of positive elements in are characterized and the result is applied to the Arens product of -and almost -algebras.     

Computable Homogeneous Boolean Algebras and a Metatheorem

We consider computable homogeneous Boolean algebras. Previously, countable homogeneous Boolean algebras have been described up to isomorphism and a simple criterion has been found for the existence of a strongly constructive (decidable) isomorphic copy for such. We propose a natural criterion for the existence of a constructive (computable) isomorphic copy. For this, a new hierarchy of -computable functions and sets is introduced, which is more delicate than Feiner's. Also, a metatheorem is proved connecting computable Boolean algebras and their hyperarithmetical quotient algebras.     

Tissus linéaires et théorèmes d'algébrisation de type Abdel-inverse et Reiss-inverse

A d-web in ( ,0) is given by d complex analytic foliations of codimension one in ( ,0) which are in general position. A d-web in ( ,0) is linear if all the leaves are (pieces of) hyperplanes in and is algebraic if it is associated, by duality, to a nondegenerate algebraic curve in of degree d. We characterize linear webs in ( ,0). We give explicit conditions under which a linear d-web in ( ,0) is algebraic and we obtain equations for in this case. Some related problems are discussed and some questions are posed.     

A Note on Extremes of Concomitants of Order Statistics

Let be a sequence of identically distributed variables. We study the asymptotic distribution of , where Y _[r:n] denotes the concomitant of the rth order statistic X _r:n , corresponding to , and is held fixed while . Conditions are given for the and to have the same asymptotic behavior as that we would apply if were i.i.d. The result is illustrated with a simple linear regression model , where is a stationary sequence with extremal index .     

A Shifted-Barrier Primal-Dual Algorithm Model for Linearly Constrained Optimization Problems

In this paper we describe a Newton-type algorithm model for solving smooth constrained optimization problems with nonlinear objective function, general linear constraints and bounded variables. The algorithm model is based on the definition of a continuously differentiable exact merit function that follows an exact penalty approach for the box constraints and an exact augmented Lagrangian approach for the general linear constraints. Under very mild assumptions and without requiring the strict complementarity assumption, the algorithm model produces a sequence of pairs converging quadratically to a pair where satisfies the first order necessary conditions and is a KKT multipliers vector associated to the linear constraints. As regards the behaviour of the sequence x ^k alone, it is guaranteed that it converges at least superlinearly. At each iteration, the algorithm requires only the solution of a linear system that can be performed by means of conjugate gradient methods. Numerical experiments and comparison are reported.     

Convex Subgroups of Partially Right-Ordered Groups

We study into the question of whether a partial order can be induced from a partially right-ordered group onto a space of right cosets of w.r.t. some subgroup of . Examples are constructed showing that the condition of being convex for in is insufficient for this. A necessary and sufficient condition (in terms of a subgroup and a positive cone of ) is specified under which an order of can be induced onto . Sufficient conditions are also given. We establish properties of the class of partially right-ordered groups for which is partially ordered for every convex subgroup , and properties of the class of groups such that is partially ordered for every partial right order on and every subgroup that is convex under .     

Frobenius Groups Generated by Quadratic Elements

An automorphism of a group X is said to be quadratic if there exist integers and such that for any . If is a Frobenius group then an element is said to be quadratic if induces, by conjugation in the core of , a quadratic automorphism. By definition, a group H acts on a group F freely if for and only with or . It is proved that a Frobenius group generated by two quadratic elements is finite and its core is commutative. In particular, any Frobenius group generated by two elements of order at most 4 is finite. Also we argue that a Frobenius group with finitely generated soluble core is finite. The results mentioned are used to show that a group acting freely on an Abelian group is finite if it is generated by elements of order 3, and the order of a product of every two elements of order 3 in is finite.     

Sharp Conditions for the CLT of Linear Processes in a Hilbert Space

In this paper we study the behavior of sums of a linear process associated to a strictly stationary sequence with values in a real separable Hilbert space and are linear operators from H to H. One of the results is that satisfies the CLT provided are i.i.d. centered having finite second moments and . We shall provide an example which shows that the condition on the operators is essentially sharp. Extensions of this result are given for sequences of weak dependent random variables under minimal conditions.     

Lexicographic Order and Linearity

Let be a list of all words of , lexicographically ordered with respect to some basis. Lexicodes are codes constructed from by applying a greedy algorithm. A short proof, only based on simple principles from linear algebra, is given for the linearity of these codes. The proof holds for any ordered basis, and for any selection criterion, thus generalizing the results of several authors. An extension of the applied technique shows that lexicodes over are linear for a wide choice of bases and for a large class of selection criteria. This result generalizes a property of Conway and Sloane.     

Strong Positivity in Right-Invariant Order on Braid Groups and Quasipositivity

Dehornoy constructed a right invariant order on the braid group B _n uniquely defined by the condition 1{\text{ if }}\beta _0 ,\beta _1$$ " align="middle" border="0"> are words in . A braid is called strongly positive if 1$$ " align="middle" border="0"> for any . In the present paper it is proved that the braid is strongly positive if the word does not contain . We also provide a geometric proof of the result by Burckel and Laver that the standard generators of a braid group are strongly positive. Finally, we discuss relations between the right invariant order and quasipositivity.     

On Generalized Hamming Weights for Galois Ring Linear Codes

The definition of generalized Hamming weights (GHW) for linear codes over Galois rings is discussed. The properties of GHW for Galois ring linear codes are stated. Upper and existence bounds for GHW of – linear codes and a lower bound for GHW of the Kerdock code over – are derived. GHW of some – linear codes are determined.