Related papers: On some deterministic dictionaries supporting spar…
We study Hilbert spaces $H$ interpreted, in an appropriate sense, in a first-order theory. Under a new finiteness hypothesis that we call {\em scatteredness} we prove that $H$ is a direct sum of {\em asymptotically free} components, where…
Recent work in signal processing and statistics have focused on defining new regularization functions, which not only induce sparsity of the solution, but also take into account the structure of the problem. We present in this paper a class…
In this paper two novel possibilistic clustering algorithms are presented, which utilize the concept of sparsity. The first one, called sparse possibilistic c-means, exploits sparsity and can deal well with closely located clusters that may…
We present theoretical guarantees for an alternating minimization algorithm for the dictionary learning/sparse coding problem. The dictionary learning problem is to factorize vector samples $y^{1},y^{2},\ldots, y^{n}$ into an appropriate…
A dynamic dictionary is a data structure that maintains sets of cardinality at most $n$ from a given universe and supports insertions, deletions, and membership queries. A filter approximates membership queries with a one-sided error that…
The efficient sparse coding and reconstruction of signal vectors via linear observations has received a tremendous amount of attention over the last decade. In this context, the automated learning of a suitable basis or overcomplete…
Within the framework of the recently proposed formalism using non-hermitean Hamiltonians constrained merely by their PT invariance we describe a new exactly solvable family of the harmonic-oscillator-like potentials with non-equidistant…
We consider an arbitrary representation of the additive group over a field of characteristic zero and give an explicit description of a finite separating set in the corresponding ring of invariants.
Any limiting point process for the time normalized exceedances of high levels by a stationary sequence is necessarily compound Poisson under appropriate long range dependence conditions. Typically exceedances appear in clusters. The…
We introduce a novel way to incorporate prior information into (semi-) supervised non-negative matrix factorization, which we call differentiable dictionary search. It enables general, highly flexible and principled modelling of mixtures…
We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…
Sparse representations using data dictionaries provide an efficient model particularly for signals that do not enjoy alternate analytic sparsifying transformations. However, solving inverse problems with sparsifying dictionaries can be…
In this article, the concept of copulas is generalised to infinite dimensional Hilbert spaces. We show one direction of Sklar's theorem and explain that the other direction fails in infinite dimensional Hilbert spaces. We derive a necessary…
An algebraic classification is given for spaces of holomorphic vector-valued modular forms of arbitrary real weight and multiplier system, associated to irreducible, T-unitarizable representations of the full modular group, of dimension…
Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…
Extended Alexander groups are used to define an invariant for open virtual strings. Examples of non-commuting open strings and a ribbon-concordance obstruction are given. An example is given of a slice virtual open string that is not…
Motivated by the recent rapid development of complexity theory applied to quantum mechanical processes we present the complete derivation of Nielsen's complexity of unitaries belonging to the representations of oscillator group. Our…
We characterize those finite groups for which the bounded derived category of finite dimensional representations over an algebraically closed field of characteristic $p$ has distributive lattice of thick subcategories: they are precisely…
Let ${\mathbb M}$ be an arbitrary o-minimal structure. Let $G$ be a definably compact definably connected abelian definable group of dimension $n$. Here we compute the new the intrinsic o-minimal fundamental group of $G;$ for each $k>0$,…
We introduce a suitable notion of integral operators (comprising the fractional Laplacian as a particular case) acting on functions with minimal requirements at infinity. For these functions, the classical definition would lead to divergent…