Related papers: Linear Combinations of Unordered Data Vectors
Let $R$ be an associative ring with unity $1$ and consider $k\in \mathbb{N}$ such that $1+1+..+1=k$ is invertible. Denote by $\omega$ an arbitrary kth root of unity in $R$ and let $UT^{(k)}_{\infty}(R)$ be the group of upper triangular…
When n is odd, consider the finite general linear and unitary groups of rank n, extended by the inverse transpose automorphism. There are elements in the extended groups which square to a regular unipotent element, and we evaluate the…
In a large class of statistical inverse problems it is necessary to suppose that the transformation that is inverted is known. Although, in many applications, it is unrealistic to make this assumption, the problem is often insoluble without…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…
The program Reverse Mathematics (RM for short) seeks to identify the axioms necessary to prove theorems of ordinary mathematics, usually working in the language of second-order arithmetic $L_{2}$. A major theme in RM is therefore the study…
Recently, decision trees (DT) have been used as an explainable representation of controllers (a.k.a. strategies, policies, schedulers). Although they are often very efficient and produce small and understandable controllers for discrete…
We study generic representations of general linear groups over a finite ring R with coefficients in a field k in which the cardinality of R is invertible, that is functors from finitely-generated projective R-modules to k-vector spaces. We…
The primary purpose of this paper is to investigate the question of invertibility of the sum of operators. The setting is bounded and unbounded linear operators. Some interesting examples and consequences are given. As an illustrative…
The logarithmic representation of infinitesimal generators is generalized to the cases when the evolution operator is unbounded. The generalized result is applicable to the representation of infinitesimal generators of unbounded evolution…
We study the joint distribution of the number of occurrences of members of a collection of nonoverlapping motifs in digital data. We deal with finite and countably infinite collections. For infinite collections, the setting requires that we…
Let F be a finite extension of Qp and G be GL(2,F). When V is the tensor product of three admissible, irreducible, finite dimensional representations of G, the space of G-invariant linear forms has dimension at most one. When a non zero…
We study linear-time temporal logics interpreted over data words with multiple attributes. We restrict the atomic formulas to equalities of attribute values in successive positions and to repetitions of attribute values in the future or…
A vector composition of a vector $\mathbf{\ell}$ is a matrix $\mathbf{A}$ whose rows sum to $\mathbf{\ell}$. We define a weighted vector composition as a vector composition in which the column values of $\mathbf{A}$ may appear in different…
We consider generalized inverses of linear operators on arbitrary vector spaces and study the question when their product in reverse order is again a generalized inverse. This problem is equivalent to the question when the product of two…
We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…
In the monotone integer dualization problem, we are given two sets of vectors in an integer box such that no vector in the first set is dominated by a vector in the second. The question is to check if the two sets of vectors cover the…
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
Scientific computations or measurements may result in huge volumes of data. Often these can be thought of representing a real-valued function on a high-dimensional domain, and can be conceptually arranged in the format of a tensor of high…
A character of a finite group having degree $n$ takes values which may be expressed as sums of $n$ or fewer roots of unity. In this note, we prove a result which describes the irreducible constituents of generalized characters on abelian…