Related papers: Covering Numbers in Linear Algebra
The covering type of a space $X$ is defined as the minimal cardinality of a good cover of a space that is homotopy equivalent to $X$. We derive estimates for the covering type of $X$ in terms of other invariants of $X$, namely the ranks of…
This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…
A classical problem in the literature seeks the minimal number of proper subgroups whose union is a given finite group. A different question, with applications to error-correcting codes and graph colorings, involves covering vector spaces…
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…
Covering theory is an important tool in representation theory of algebras, however, the results and the proofs are scattered in the literature. We give an introduction to covering theory at a level as elementary as possible.
We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…
A $\textit{covering system}$ is a collection of integer congruences such that every integer satisfies at least one congruence in the collection. A covering system is called $\textit{distinct}$ if all of its moduli are distinct. An expansive…
We provide a computational definition of the notions of vector space and bilinear functions. We use this result to introduce a minimal language combining higher-order computation and linear algebra. This language extends the Lambda-calculus…
We give short and simple proofs of what seem to be folklore results: * the maximum cardinality of the intersection of a lattice cube with an affine subspace; * the minimum number of affine subspaces needed to cover a lattice cube.
We study the cardinal invariants of measure and category after adding one random real. In particular, we show that the number of measure zero subsets of the plane which are necessary to cover graphs of all continuous functions maybe large…
The set of matrix tuples with invariant subspaces whose dimensions sum up to the dimension of the space, but which do not span the whole space form an algebraic hypersurface. We found the equation of this hypersurface. This generalizes…
Let $A$ be a simple algebra over a field $F$. Under a mild cardinality assumption on $F$, we determine the greatest possible dimension for an $F$-affine subspace of $A$ that is included in the group of units $A^\times$, and we describe the…
We introduce the notion of the "covering type" of a space, which is more subtle that the notion of Lusternik Schnirelman category. It measures the complexity of a space which arises from coverings by contractible subspaces whose non-empty…
We study a generalization of additive bases into a planar setting. A planar additive basis is a set of non-negative integer pairs whose vector sumset covers a given rectangle. Such bases find applications in active sensor arrays used in,…
The covering number of an associative ring $R$ is the minimal number of proper subrings whose union is $R$. We establish a strategy to classify unital rings of a given finite covering number, and obtain a classification of unital rings…
Linear algebra is usually defined over a field such as the reals or complex numbers. It is possible to extend this to skew fields such as the quaternions. However, to the authors' knowledge there is no commonly accepted notation of linear…
Let $r$ and $n$ be positive integers such that $r<n$, and $\mathbb{K}$ be an arbitrary field. We determine the maximal dimension for an affine subspace of $n$ by $n$ symmetric (or alternating) matrices with entries in $\mathbb{K}$ and with…
Sufficient conditions are obtained for the existence of a vector with a one-dimensional or simple three-dimensional stationary subalgebra for an irreducible compact linear Lie algebra.
We compute the number of equivalence classes of nonperiodic covering cycles of given length in a non oriented connected graph. A covering cycle is a closed path that traverses each edge of the graph at least once. A special case is the…
We present here algorithms for efficient computation of linear algebra problems over finite fields.