Related papers: Lineability criteria, with applications
We call a system super-linearizable if it admits finite-dimensional embedding as a linear system -- known as a finite-dimensional Koopman embedding; said otherwise, if its dynamics can be linearized by adding a finite set of observables. We…
A review of the state of the art of the comparison between any two different modes of convergence of sequences of measurable functions is carried out with focus on the algebraic structure of the families under analysis. As a complement of…
We define a relative property A for a countable group with respect to a finite family of subgroups. Many characterizations for relative property A are given. In particular a relative bounded cohomological characterization shows that if a…
Splines can be constructed by convolving the indicator function of a cell whose shifts tessellate $\R^k$. This paper presents simple, non-algebraic criteria that imply that, for regular shift-invariant tessellations, only a small subset of…
In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of…
We analyze identifiability as a possible explanation for the ubiquity of linear properties across language models, such as the vector difference between the representations of "easy" and "easiest" being parallel to that between "lucky" and…
Functions with uniform sublevel sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used in multicriteria optimization, decision theory, mathematical…
A topological space $X$ is called resolvable if it contains a dense subset with dense complement. Using only basic principles, we show that whenever the space $X$ has a resolving subset that can be written as an at most countably infinite…
The rankability of data is a recently proposed problem that considers the ability of a dataset, represented as a graph, to produce a meaningful ranking of the items it contains. To study this concept, a number of rankability measures have…
The paper studies 'good arrangements' (transversality properties) of collections of sets in a normed vector space near a given point in their intersection. We target primal (metric and slope) characterizations of transversality properties…
Certain types of bilinearly defined sets in $\mathbb{R}^n$ exhibit a higher degree of linearity than what is apparent by inspection.
The paper established sufficient conditions of predictability with degeneracy for the spectrum at $M$-periodically located isolated points on the unit circle. It is also shown that $m$-periodic subsequences of these sequences are also…
The sets of strongly supercyclic, weakly l-sequentially supercyclic, weakly sequentially supercyclic, and weakly supercyclic vectors for an arbitrary normed-space operator are all dense in the normed space, regardless the notion of…
Linear Geometry studies geometric properties which can be expressed via the notion of a line. All information about lines is encoded in a ternary relation called a line relation. A set endowed with a line relation is called a liner. So,…
The notion of lacunary infinite numerical sequence is introduced. It is shown that for an arbitrary linear difference operator L with coefficients belonging to the set R of infinite numerical sequences, a criterion (i.e., a necessary and…
A linear system of plane curves satisfying multiplicity conditions at points in general position is called special if the dimension is larger than the expected dimension. A (-1) curve is an irreducible curve with self intersection -1 and…
This paper is the second in a series by the author and collaborators devoted to the study of geometric and analytic properties of nonlinear Lebesgue spaces, that is, L^p spaces of mappings taking values in arbitrary metric spaces. The…
Neural networks are famously nonlinear. However, linearity is defined relative to a pair of vector spaces, $f:X \to Y$. Leveraging the algebraic concept of transport of structure, we propose a method to explicitly identify non-standard…
Elicitability is a property of $\mathbb{R}^k$-valued functionals defined on a set of distribution functions. These functionals represent statistical properties of a distribution, for instance its mean, variance, or median. They are called…
High dimensional data can have a surprising property: pairs of data points may be easily separated from each other, or even from arbitrary subsets, with high probability using just simple linear classifiers. However, this is more of a rule…