Spectral sequences in analytic homotopy theory

Translated from Matematicheskie Zametki, Vol. 47, No. 5, pp. 52–61, May, 1990.     

Spectral analytic comparisons for data augmentation

The sandwich algorithm (SA) is an alternative to the data augmentation (DA) algorithm that uses an extra simulation step at each iteration. In this paper, we show that the sandwich algorithm always converges at least as fast as the DA algorithm, in the Markov operator norm sense. We also establish conditions under which the spectrum of SA dominates that of DA. An example illustrates the results.     

An alternating direction algorithm for matrix completion with nonnegative factors

This paper introduces an algorithm for the nonnegative matrix factorization-and-completion problem, which aims to find nonnegative low-rank matrices X and Y so that the product XY approximates a nonnegative data matrix M whose elements are partially known (to a certain accuracy). This problem aggregates two existing problems: (i) nonnegative matrix factorization where all entries of M are given, and (ii) low-rank matrix completion where nonnegativity is not required. By taking the advantages of both nonnegativity and low-rankness, one can generally obtain superior results than those of just using one of the two properties. We propose to solve the non-convex constrained least-squares problem using an algorithm based on the classical alternating direction augmented Lagrangian method. Preliminary convergence properties of the algorithm and numerical simulation results are presented. Compared to a recent algorithm for nonnegative matrix factorization, the proposed algorithm produces factorizations of similar quality using only about half of the matrix entries. On tasks of recovering incomplete grayscale and hyperspectral images, the proposed algorithm yields overall better qualities than those produced by two recent matrix-completion algorithms that do not exploit nonnegativity.     

Boundary-value problems for analytic and generalized analytic functions

This paper deals with boundary value problems of linear conjugation with shift for analytic functions in the case of piecewise continuous coefficients. Int main goal is the construction of a canonical matrix for these problems. Boundary value problems with shift for generalized analytic functions and vectors as well as differential boundary value problems are studied. Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 59, Algebra and Geometry, 2008.     

MacNeille completion and profinite completion can coincide on finitely generated modal algebras

Following Bezhanishvili and Vosmaer, we confirm a conjecture of Yde Venema by piecing together results from various authors. Specifically, we show that if ${\mathbb{A}}$ is a residually finite, finitely generated modal algebra such that HSP( ${\mathbb{A}}$ ) has equationally definable principal congruences, then the profinite completion of ${\mathbb{A}}$ is isomorphic to its MacNeille completion, and ? is smooth. Specific examples of such modal algebras are the free K4-algebra and the free PDL-algebra.     

Whales and the universal completion

In this paper we introduce whales in the collection of subsets of the Boolean algebra of bands in a Dedekind complete Riesz space and employ them to give a short (and constructive) proof of the existence of universal completions for Archimedean Riesz spaces.

     

Interval dimension and MacNeille completion

Equality between the interval dimensions of a poset and its MacNeille completion, announced in [7], has been obtained by the authors as a byproduct of their study of Galois lattices in [8]. The purpose of this note is to give a direct proof, similar to the classical proof of Baker's result stating that the dimension (in the Dushnik-Miller sense) of a poset and its MacNeille completion are the same.Supported by French PRC Math-Info.     

Spectral analysis of certain compact factors for Gaussian dynamical systems

For factors of a Gaussian automorphismT determined by compact subgroups of the group of unitary operators acting onL ² of the spectral measure ofT, we prove that the maximal spectral multiplicity is either 1 or infinity. As an application, we show that the maximal multiplicity of those factors an allL ^p, 1<p<+∞, is the same.     

Additive completion and disjoint translations

Supported by Hungarian National Foundation for Scientific Research, Grant No. 1901.     

Ergodic transport theory and piecewise analytic subactions for analytic dynamics

We consider a piecewise analytic real expanding map f: [0, 1] ?? [0, 1] of degree d which preserves orientation, and a real analytic positive potential g: [0, 1] ?? ?. We assume the map and the potential have a complex analytic extension to a neighborhood of the interval in the complex plane. We also assume log g is well defined for this extension. It is known in Complex Dynamics that under the above hypothesis, for the given potential ?? log g, where ?? is a real constant, there exists a real analytic eigenfunction ? _?? defined on [0, 1] (with a complex analytic extension) for the Ruelle operator of ?? log g. Under some assumptions we show that $\frac{1} {\beta }\log \varphi _\beta$ converges and is a piecewise analytic calibrated subaction. Our theory can be applied when log g(x) = ?log f??(x). In that case we relate the involution kernel to the so called scaling function.     

Order completion monads

Categories of partially ordered sets that are complete under least upper bounds of subsets of a given form (finite, chains, etc.) are characterized as categories of algebras for submonads of the monad of complete semilattices. A general completion construction is given, and several structural properties, such as tensor products, colimits, and factorizations, are studied.MEC (Spain) postdoctoral research fellow. On leave from Dto. Algebra y Fund., Universidad de Santiago. Research conducted at the Mathematics Department, University of California at Berkeley.Presented by F. E. J. Linton.