相关论文: A new class of rank one transformations with singu…

We prove that for infinite rank-one transformations satisfying a property called "partial boundedness," the only commuting transformations are powers of the original transformation. This shows that a large class of infinite…

In this thesis, a new class of algorithms based on Sums of Squares Programming is developed. These allow to reduce a degree-$d$ homogeneous polynomial $T = \sum_{i = 1}^m \langle a_i, X \rangle^d $ to a quadratic form being close to a…

In this paper we consider the decomposition of positive semidefinite matrices as a sum of rank one matrices. We introduce and investigate the properties of various measures of optimality of such decompositions. For some classes of positive…

We define and study a homological version of Sullivan's rational de Rham complex for simplicial sets. This new functor can be generalised to simplicial symmetric spectra and in that context it has excellent categorical properties which…

In this paper, we present a partial survey of the tools borrowed from tensor algebra, which have been utilized recently in Statistics and Signal Processing. It is shown why the decompositions well known in linear algebra can hardly be…

In this lecture notes we try to familiarize the audience with the theory of Bernoulli polynomials; we study their properties, and we give, with proofs and references, some of the most relevant results related to them. Several applications…

We give a rank augmentation technique for rank 3 string C-group representations of the symmetric group $S_n$ and list the hypotheses under which it yields a valid string C-group representation of rank 4 thereof.

In this paper transformations for matrix orthogonal polynomials in the real line are studied. The orthogonality is understood in a broad sense, and is given in terms of a nondegenerate continuous sesquilinear form, which in turn is…

We introduce a new, elementary method for studying random differences in arithmetic progressions and convergence phenomena along random sequences of integers. We apply our method to obtain significant improvements on previously known…

This note is to indicate the new sphere of applicability of the method developed by Mlak as well as by the author. Restoring those ideas is summoned by current developments concerning $K$-spectral sets on numerical ranges.

In this work we study different notions of ranks and approximation of tensors. We consider the tensor rank, the nuclear rank and we introduce the notion of symmetric decomposable rank, a notion of rank defined only on symmetric tensors. We…

We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…

A relatively simple algebraic framework is given, in which all the compact symmetric spaces can be described and handled without distinguishing cases. We also give some applications and further results.

The first and second-order supersymmetry transformations are used to generate Hamiltonians with known spectra departing from the trigonometric Poschl-Teller potentials. The several possibilities of manipulating the initial spectrum are…

We introduce the notion of central extension of gerbes on a topological space. We then show that there are obstruction classes to lifting objects and isomorphisms in a central extension. We also discuss pronilpotent gerbes. These results…

The subdifferential of convex functions of the singular spectrum of real matrices has been widely studied in matrix analysis, optimization and automatic control theory. Convex analysis and optimization over spaces of tensors is now gaining…

We study ruled submanifolds of Euclidean space. First, to each (parametrized) ruled submanifold $\sigma$, we associate an integer-valued function, called degree, measuring the extent to which $\sigma$ fails to be cylindrical. In particular,…

We present a simple extension of Lindeberg's argument for the Central Limit Theorem to get a general invariance result. We apply the technique to prove results from random matrix theory, spin glasses, and maxima of random fields.

A spectral factorization theorem is proved for polynomial rank-deficient matrix-functions. The theorem is used to construct paraunitary matrix-functions with first rows given.

In this chapter we provide a theoretically founded investigation of state-of-the-art learning approaches for inverse problems from the point of view of spectral reconstruction operators. We give an extended definition of regularization…