Related papers: Exponential sums and rank of persymmetric matrices…
Helmke et al. have recently given a formula for the number of reachable pairs of matrices over a finite field. We give a new and elementary proof of the same formula by solving the equivalent problem of determining the number of so called…
We obtain new uniform upper bounds for the (non necessarily symmetric) tensor rank of the multiplication in the extensions of the finite fields $\F_q$ for any prime or prime power $q\geq2$; moreover these uniform bounds lead to new…
Using the diagrammatic approach to integrals over Gaussian random matrices, we find a representation for polynomial Lie group integrals as infinite sums over certain maps on surfaces. The maps involved satisfy a specific condition: they…
Let $A$ and $B$ designate $n\times n$ matrices with coefficients in a field $F$. In this paper, we completely answer the following question: For $A$ fixed, what are the possible characteristic polynomials of $A+B$, where $B$ ranges over…
A {\it symmetric companion matrix} is a matrix of the form $A +A^T$ where $A$ is a companion matrix all of whose entries are in $\{0,1\}$ and $A^T$ is the transpose of $A.$ In this paper, we find the total number of primitive and the total…
Let $\mathbb{F}$ be a field, and $n \geq p \geq r>0$ be integers. In a recent article, Rubei has determined, when $\mathbb{F}$ is the field of real numbers, the greatest possible dimension for an affine subspace of $n$--by--$p$ matrices…
An $r$-matrix is a matrix with symbols in $\{0,1,\ldots,r-1\}$. A matrix is simple if it has no repeated columns. Let ${\cal F}$ be a finite set of $r$-matrices. Let $\hbox{forb}(m,r,{\cal F})$ denote the maximum number of columns possible…
An $L$-matrix is a matrix whose off-diagonal entries belong to a set $L$, and whose diagonal is zero. Let $N(r,L)$ be the maximum size of a square $L$-matrix of rank at most $r$. Many applications of linear algebra in extremal combinatorics…
Random linear systems over the Galois Field modulo 2 have an interest in connection with problems ranging from computational optimization to complex networks. They are often approached using random matrices with Poisson-distributed or…
We consider the set of $n\times n$ matrices with rational entries having numerator and denominator of size at most $H$ and obtain upper and lower bounds on the number of such matrices of a given rank and then apply them to count such…
In this paper, we discuss the adjacency matrices of finite undirected simple graphs over a finite prime field $\mathbb{F}_p$. We apply symmetric (row and column) elementary transformations to the adjacency matrix over $\mathbb{F}_p$ in…
A presentation of numerical range for rectangular matrices is undertaken in this paper, introducing two different definitions and elaborating basic properties. Then we are extended to the treatment of rank-k numerical range.
Generalising the concept of a complete permutation polynomial over a finite field, we define completness to level $k$ for $k\ge1$ in fields of odd characteristic. We construct two families of polynomials that satisfy the condition of high…
Let s,t,m,n be positive integers such that sm=tn. Let M(m,s;n,t) be the number of m x n matrices over {0,1,2,...} with each row summing to s and each column summing to t. Equivalently, M(m,s;n,t) counts 2-way contingency tables of order m x…
It can be shown that any symmetric $(0,1)$-matrix $A$ with $\tr A = 0$ can be interpreted as the adjacency matrix of a simple, finite graph. The square of an adjacency matrix $A^2=(s_{ij})$ has the property that $s_{ij}$ represents the…
In this paper we consider the decomposition of positive semidefinite matrices as a sum of rank one matrices. We introduce and investigate the properties of various measures of optimality of such decompositions. For some classes of positive…
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. In this paper we: establish general facts about rank decompositions of tensors, describe potential ways to search for new matrix…
Let $(A,B)$ be a pair of skew-symmetric matrices over a field of characteristic not 2. Its regularization decomposition is a direct sum \[ (\underline{\underline A},\underline{\underline B})\oplus (A_1,B_1)\oplus\dots\oplus(A_t,B_t) \] that…
In this note, we presented a new decomposition of elements of finite fields of even order and illustrated that it is an effective tool in evaluation of some specific exponential sums over finite fields, the explicit value of some…
We obtain the formula computing the number of isomorphic classes of element systems with characters over finite commutative group $G$.