Related papers: On some deterministic dictionaries supporting spar…
We study the computational problem of rigorously describing the asymptotic behaviour of topological dynamical systems up to a finite but arbitrarily small pre-specified error. More precisely, we consider the limit set of a typical orbit,…
The idea that many important classes of signals can be well-represented by linear combinations of a small set of atoms selected from a given dictionary has had dramatic impact on the theory and practice of signal processing. For practical…
We prove results about subshifts with linear (word) complexity, meaning that $\limsup \frac{p(n)}{n} < \infty$, where for every $n$, $p(n)$ is the number of $n$-letter words appearing in sequences in the subshift. Denoting this limsup by…
There is a generalized oscillator algebra associated with every class of orthogonal polynomials $\{\Psi_n(x)\}_{n=0}^{\infty}$, on the real line, satisfying a three term recurrence relation $x\Psi_n(x)=b_n\Psi_{n+1}(x)+b_{n-1}\Psi_{n-1}(x),…
Sklar's theorem is an important tool that connects bidimensional distribution functions with their marginals by means of a copula. When there is imprecision about the marginals, we can model the available information by means of p-boxes,…
Four constructions result from a desire to create enhancements to Cantor's infinite real set cardinality. Each continues to keep Cantor's cardinality formulation in place while providing new comparisons of arbitrary infinite sets. To…
Higher-order tensors appear in various areas of mechanics as well as physics, medicine or earth sciences. As these tensors are highly complex, most are not well understood. Thus, the analysis and the visualization process form a highly…
We define a class of languages of infinite words over infinite alphabets, and the corresponding automata. The automata used for recognition are a generalisation of deterministic Muller automata to the setting of nominal sets. Remarkably,…
We consider the fractional oscillator being a generalization of the conventional linear oscillator in the framework of fractional calculus. It is interpreted as an ensemble average of ordinary harmonic oscillators governed by stochastic…
This article analysis differential equations which represents damped and fractional oscillators. First, it is shown that prior to using physical quantities in fractional calculus, it is imperative that they are turned dimensionless.…
A regular sampling theory in a multiply generated unitary invariant subspace of a separable Hilbert space $\mathcal{H}$ is proposed. This subspace is associated to a unitary representation of a countable discrete abelian group $G$ on…
In this paper we consider a generalized version of bounded oscillation operators, involving new parameters in the definition, as well as considering the operators on vector-valued function spaces. With this definition we will capture some…
This paper provides fundamental limits on the sample complexity of estimating dictionaries for tensor data. The specific focus of this work is on $K$th-order tensor data and the case where the underlying dictionary can be expressed in terms…
Group-theoretical analysis of arbitrary polarization devices is performed, based on the theory of the Lorentz group. In effective "non-relativistic" Mueller case, described by 3-dimensional orthogonal matrices, results of the one…
We are now witnessing a rapid growth of a new part of group theory which has become known as "statistical group theory". A typical result in this area would say something like ``a random element (or a tuple of elements) of a group G has a…
We present three groups of noncanonical quantum oscillators. The position and the momentum operators of each of the groups generate basic Lie superalgebras, namely $sl(1/3)$, $osp(1/6)$ and $osp(3/2)$. The $sl(1/3)$-oscillators have finite…
We entirely classify definable sets up to definable bijections in $\mathbb{Z}$-groups, where the language is the one of ordered abelian groups. From this, we deduce, among others, a classification of definable families of bounded definable…
Recently, sparsity has become a key concept in various areas of applied mathematics, computer science, and electrical engineering. One application of this novel methodology is the separation of data, which is composed of two (or more)…
Given a set of vectors (the data) in a Hilbert space H, we prove the existence of an optimal collection of subspaces minimizing the sum of the square of the distances between each vector and its closest subspace in the collection. This…
In this paper, we deal with the classification complexity of continuous (Devaney) chaotic systems in dimensions $0,1$ and $\infty$ using the framework of invariant descriptive set theory. We identify the complexity in dimensions $0$ and…