Related papers: On some deterministic dictionaries supporting spar…
Occam's Razor tells us to pick the simplest model that fits our observations. In order to make sense of his process mathematically, we interpret it in the context of posets of functions. Our approach leads to some unusual new combinatorial…
This paper investigates a class of non-autonomous highly oscillatory ordinary differential equations characterized by a linear component inversely proportional to a small parameter $\varepsilon$, with purely imaginary eigenvalues, and an…
In computational physics it is standard to approximate continuum systems with discretised representations. Here we consider a specific discretisation of the continuum complex Hilbert space of quantum mechanics - a discretisation where…
We propose a generalized version of the Dantzig selector. We show that it satisfies sparsity oracle inequalities in prediction and estimation. We consider then the particular case of high-dimensional linear regression model selection with…
We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…
The structure of subspaces of a Hilbert space that are invariant under unitary representations of a discrete group is related to a notion of Hilbert modules endowed with inner products taking values in spaces of unbounded operators. A…
String models are designed to provide a covariant description of internal space-time structure of relativistic particles. The string is a limiting case of a series of massive beads like a pearl necklace. In the limit of infinite-number of…
In the Dirac bracket approach to dynamical systems with second class constraints observables are represented by elements of a quotient Dirac bracket algebra. We describe families of new realizations of this algebra through quotients of the…
Super-symmetric tensors - a higher-order extension of scatter matrices - are becoming increasingly popular in machine learning and computer vision for modelling data statistics, co-occurrences, or even as visual descriptors. However, the…
We propose a new definition of higher-order DisCoCat (categorical compositional distributional) models where the meaning of a word is not a diagram, but a diagram-valued higher-order function. Our models can be seen as a variant of Montague…
A parameterization of the density operator, a coherence vector representation, which uses a basis of orthogonal, traceless, Hermitian matrices is discussed. Using this parameterization we find the region of permissible vectors which…
In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…
A connection between representation of compact groups and some invariant ensembles of Hermitian matrices is described. We focus on two types of invariant ensembles which extend the Gaussian and the Laguerre Unitary ensembles. We study them…
Sparse data models, where data is assumed to be well represented as a linear combination of a few elements from a dictionary, have gained considerable attention in recent years, and their use has led to state-of-the-art results in many…
This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…
The operator algebras of a new family of relativistic geometric models of the relativistic oscillator are studied. It is shown that, generally, the operator of number of quanta and the pair of the shift operators of each model are the…
When implementing the DSmT, a difficulty may arise from the possible huge dimension of hyperpower sets, which are indeed free structures. However, it is possible to reduce the dimension of these structures by involving logical constraints.…
We enumerate the fibres of commutator word maps over p-groups of nilpotency class less than p with exponent p. We also give some examples and enumerate the fibre sizes of all word maps over p-groups of class 2 with exponent p.
Large Language Models are built on the so-called distributional semantic approach to linguistic meaning that has the distributional hypothesis at its core. The distributional hypothesis involves a holistic conception of word meaning: the…
We introduce data structures answering queries concerning the occurrences of patterns from a given dictionary $\mathcal{D}$ in fragments of a given string $T$ of length $n$. The dictionary is internal in the sense that each pattern in…