Related papers: Bounded rank-one transformations
A fundamental algorithm for selecting ranks from a finite subset of an ordered set is Radix Selection. This algorithm requires the data to be given as strings of symbols over an ordered alphabet, e.g., binary expansions of real numbers. Its…
This work is a continuation of our previous works concerning linear canonical transformations and phase space representation of quantum theory. It is mainly focused on the description of an approach which allows to establish spinorial…
Let End(V) denote the ring of all linear transformations of an arbitrary k-vector space V over a field k. We define a subset X of End(V) to be "triangularizable" if V has a well-ordered basis such that X sends each vector in that basis to…
We introduce a theory for encoding and manipulating algebraic data on categories via $\textit{concentration structures}$, which are equivalence relations on morphisms that satisfy certain axioms. For any category with a concentration…
We study the class structure of finite-alphabet Markov chains with arbitrary memory length. To capture the structural constraints induced by prohibited transitions, we introduce the skeleton of a higher-order transition kernel, defined as a…
The Brunovsky canonical form provides sparse structural representations that are beneficial for computational optimal control, yet existing methods fail to compute it reliably. We propose a technique that produces Brunovsky transformations…
One measure of the complexity of a first-order theory, and similarly a type, is the complexity of the formulas required to axiomatize it. We say a theory is bounded if there is an axiomatization involving only $\forall_n$-formulas for some…
In this work we introduce a new and richer class of finite order Markov chain models and address the following model selection problem: find the Markov model with the minimal set of parameters (minimal Markov model) which is necessary to…
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,…
This paper is a continuation of the work by the same authors on the Cartan group equipped with the sub-Finsler $\ell_\infty$ norm. We start by giving a detailed presentation of the structure of bang-bang extremal trajectories. Then we prove…
We identify natural symmetries of each rigid higher braided category. Specifically, we construct a functorial action by the continuous group $\Omega \mathsf{O}(n)$ on each $\mathcal{E}_{n-1}$-monoidal $(g,d)$-category $\mathcal{R}$ in which…
The conservative sequence of a set $A$ under a transformation $T$ is the set of all $n \in \mathbb{Z}$ such that $T^n A \cap A \not = \varnothing$. By studying these sequences, we prove that given any countable collection of nonsingular…
We find conditions that guarantee that a decomposition of a generic third-order tensor in a minimal number of rank-$1$ tensors (canonical polyadic decomposition (CPD)) is unique up to permutation of rank-$1$ tensors. Then we consider the…
We characterize point transformations in quantum mechanics from the mathematical viewpoint. To conclude that the canonical variables given by each point transformation in quantum mechanics correctly describe the extended point…
From the datum of an integer partition and a classical Lie algebra, one can define a Markov chain on an associated multiplicative graph. For each classical family A, C, B, D, we thus obtain a sequence of Markov chain which is indexed by the…
We extend F.Pastjin's construction of uniform decomposable chains of finite rank to those of rank 'finite over a limit' and investigate infinite products and unions of such chains. We derive an extension of Pastjin's characterisation to…
The article is devoted to different aspects of the question "What can be done with a matrix by low rank perturbation?" It is proved that one can change a geometrically simple spectrum drastically by a rank 1 permutation, but the situation…
We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…
The feasibility of a classification-by-rank program for modular categories follows from the Rank-Finiteness Theorem. We develop arithmetic, representation theoretic and algebraic methods for classifying modular categories by rank. As an…
We establish pointwise ergodic theorems for operators of Radon type along subsets of prime numbers of the form $\big\{\{ \varphi_1(n)\} < \psi(n)\big\}$. We achieve this by proving $\ell^p(\mathbb{Z})$ boundedness of $r$-variations, where…