English
Related papers

Related papers: Linear spanning sets for matrix spaces

200 papers

Let $(\Omega,\mathcal{F},P)$ be a probability space and $\mathcal{N}$ the class of those $F\in\mathcal{F}$ satisfying $P(F)\in\{0,1\}$. For each $\mathcal{G}\subset\mathcal{F}$, define $\overline{\mathcal{G}}=\sigma(\mathcal{G}\cup\mathcal…

Probability · Mathematics 2009-01-20 Patrizia Berti , Luca Pratelli , Pietro Rigo

We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

Number Theory · Mathematics 2024-09-05 Philipp Habegger , Alina Ostafe , Igor E. Shparlinski

We present certain existence criteria and parameterisations for an interpolation problem for completely positive maps that take given matrices from a finite set into prescribed matrices. Our approach uses density matrices associated to…

Operator Algebras · Mathematics 2013-09-03 Calin-Grigore Ambrozie , Aurelian Gheondea

For fields with more than $2$ elements, the classification of the vector spaces of matrices with rank at most $2$ is already known. In this work, we complete that classification for the field $\mathbb{F}_2$. We apply the results to obtain…

Rings and Algebras · Mathematics 2015-09-01 Clément de Seguins Pazzis

In Linear Algebra over finite fields, a characteristic-dependent linear rank inequality is a linear inequality that holds by ranks of subspaces of a vector space over a finite field of determined characteristic, and does not in general hold…

Information Theory · Computer Science 2019-05-28 Victor Peña , Humberto Sarria

In this paper, we present some checkable criteria for the spectral finiteness of a finite subset of the real $d\times d$ matrix space $\mathbb{R}^{d\times d}$, where $2\le d<\infty$.

Numerical Analysis · Mathematics 2012-06-12 Xiongping Dai

For every $m,n \in \mathbb{N}$ and every field $K$, let $M(m \times n, K)$ be the vector space of the $(m \times n)$-matrices over $K$ and let $S(n,K)$ be the vector space of the symmetric $(n \times n)$-matrices over $K$. We say that an…

Rings and Algebras · Mathematics 2024-12-03 Elena Rubei

Given a nonempty finite multiset $S$ of positive integers, we wish to find a partially ordered set $P$ of minimal cardinality such that the multiset of cardinalities of all maximal chains in $P$ equals $S$. This paper establishes upper and…

Combinatorics · Mathematics 2023-05-30 Todd Bichoupan

We find the cardinality of the value sets of polynomial maps associated with simple complex Lie algebras $B_2$ and $G_2$ over finite fields. We achieve this by using a characterization of their fixed points in terms of sums of roots of…

Number Theory · Mathematics 2017-07-19 Ömer Küçüksakallı

We study the maximal rank in affine subspaces of symmetric or alternating matrices, in terms of the matching numbers of certain associated graphs. Applications include simple proofs of upper bounds on the dimension of such subspaces in…

Combinatorics · Mathematics 2017-03-17 Roy Meshulam

Motivated by recent works on statistics of matrices over sets of number theoretic interest, we study matrices with entries from arbitrary finite subsets $\mathcal A$ of finite rank multiplicative groups infields of characteristic zero. We…

Number Theory · Mathematics 2025-02-12 Aaron Manning , Alina Ostafe , Igor E. Shparlinski

The complete eigenstructure, or structural data, of a rational matrix $R(s)$ is comprised by its invariant rational functions, both finite and at infinity, which in turn determine its finite and infinite pole and zero structures,…

Spectral Theory · Mathematics 2025-05-02 Itziar Baragaña , Froilán M. Dopico , Silvia Marcaida , Alicia Roca

We consider the notion of herdability, a set-based reachability condition, which asks whether the state of a system can be controlled to be element-wise larger than a non-negative threshold. First a number of foundational results on…

Systems and Control · Computer Science 2019-04-19 Sebastian F Ruf , Magnus Egerstedt , Jeff S. Shamma

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.

Combinatorics · Mathematics 2019-09-13 Lê Thành Dũng Nguyên

In this paper, we introduce a graph structure called linear dependence graph of a finite dimensional vector space over a finite field. Some basic properties of the graph like connectedness, completeness, planarity, clique number, chromatic…

Combinatorics · Mathematics 2017-03-31 A. K. Bhuniya , Sushobhan Maity

We consider the problem of finding the minimal number of points required to intersect all lines in an affine space over the finite field of order 3. We also consider the problem of finding the minimal number of points required to intersect…

Combinatorics · Mathematics 2007-05-23 Ara Aleksanyan , Mihran Papikian

Aharoni and Ziv conjectured that if $ M $ and $ N $ are finitary matroids on $ E $, then a certain ``Hall-like'' condition is sufficient to guarantee the existence of an $ M $-independent spanning set of $ N $. We show that their condition…

Combinatorics · Mathematics 2024-03-13 Attila Joó

This contribution presents two exponential stability criteria for linear systems with multiple pointwise and distributed delays. These results (necessary and sufficient conditions) are given in terms of the delay Lyapunov matrix and the…

Dynamical Systems · Mathematics 2022-09-15 Alejandro Castaño , Carlos Cuvas , Alexey Egorov , Sabine Mondié

Over the finite field with two elements, we present a method for obtaining explicit expressions for the number of rank i matrices of the form A above B, where A is persymmetric (A matrix [a(i,j)] is persymmetric if a(i,j) = a(r,s) for i+j =…

Number Theory · Mathematics 2007-11-09 Jorgen Cherly

For a real matrix $M$, we denote by $sp(M)$ the spectrum of $M$ and by $\left \vert M\right \vert $ its absolute value, that is the matrix obtained from $M$ by replacing each entry of $M$ by its absolute value. Let $A$ be a nonnegative real…

Combinatorics · Mathematics 2015-07-29 Kawtar Attas , Abderrahim Boussaïri , Mohamed Zaidi