Related papers: Irredundant Generating Sets for Matrix Algebras
The tropical Grassmannian ${\rm Trop}\, G(2,n)$ is known to be the moduli space of unrooted metric trees with $n$ leaves. A positive part can be defined for each of the $(n-1)!/2$ possible planar orderings, $\alpha$, and agrees with the…
Let ${\rm M}(V)={\rm M}(n,\mathbb{F}_q)$ denote the algebra of $n\times n$ matrices over $\mathbb{F}_q$, and let ${\rm M}(V)_U$ denote the (maximal reducible) subalgebra that normalizes a given $r$-dimensional subspace $U$ of…
Let F be a field. We investigate the greatest possible dimension t_n(F) for a vector space of n-by-n matrices with entries in F and in which every element is triangularizable over the ground field F. It is obvious that t_n(F) is greater…
Let $n>2r>0$ be integers. We consider families $\mathcal{F}$ of subsets of an $n$-element set, in which the union of any two members has size at most $2r$. One of our results states that for $n\geq 6r$ the number of members of size…
We consider the recursive equation ``x(n+1)=A(n)x(n)'' where x(n+1) and x(n) are column vectors of size k and where A(n) is an irreducible random matrix of size k x k. The matrix-vector multiplication in the (max,+) algebra is defined by…
Let $G$ be a linear algebraic group acting linearly on a vector space $V$, and let $k[V]^G$ be the corresponding algebra of invariant polynomial functions. A separating set $S \subseteq k[V]^G$ is a set of polynomials with the property that…
A theorem of O. Forster says that if $R$ is a noetherian ring of Krull dimension $d$, then any projective $R$-module of rank $n$ can be generated by $d+n$ elements. S. Chase and R. Swan subsequently showed that this bound is sharp: there…
We prove that $\det A\leq 6^\frac{n}{6}$ whenever $A\in\{0,1\}^{n\times n}$ contains at most $2n$ ones. We also prove an upper bound on the determinant of matrices with the $k$-consecutive ones property, a generalisation of the consecutive…
In this paper we study algebraic and asymptotic properties of generating sets of algebras over orders in number fields. Let $A$ be an associative algebra over an order $R$ in an algebraic number field. We assume that $A$ is a free…
Over a field of characteristic $0$, we construct a minimal set of generators of the defining ideals of closures of nilpotent conjugacy class in the set of $n \times n$ matrices. This modifies a conjecture of Weyman and provides a complete…
Let $\mathbf{A}$ be a finite nilpotent algebra in a congruence modular variety with finitely many fundamental operations. If $\mathbf{A}$ is of prime power order, then it is known that there is a polynomial $p$ such that for every $n \in…
Over a field of characteristic 0, the algebra of invariants of several $n\times n$ matrices under simultaneous conjugation by $GL_n$ is generated by traces of products of generic matrices. In this paper we have found, in terms of…
Given a set of matrices, it is often of interest to determine the algebra they generate. Here we exploit the concept of the Burnside graph of a set of matrices, and show how it may be used to deduce properties of the algebra they generate.…
We examine sets of lines in PG(d,F) meeting each hyperplane in a generator set of points. We prove that such a set has to contain at least 1.5d lines if the field F has more than 1.5d elements, and at least 2d-1 lines if the field F is…
This paper studies $B(r)$, the space of $r$-tuples of $2 \times 2$ complex matrices that generate $\operatorname{Mat}_{2 \times 2}(\mathbf C)$ as an algebra, considered up to change-of-basis. We show that $B(2)$ is homotopy equivalent to…
Subsets of a matrix algebra over a field that are invariant under conjugation and contain the linear span of each two of their commuting elements are described. They obviously include the subsets of diagonalizable and nilpotent matrices. In…
We say that a 0-1 matrix $N$ of size $a\times b$ can be found in a collection of sets $\mathcal{H}$ if we can find sets $H_{1}, H_{2}, \dots, H_{a}$ in $\mathcal{H}$ and elements $e_1, e_2, \dots, e_b$ in $\cup_{H \in \mathcal{H}} H$ such…
For every $n \in \mathbb{N}$ and every field $K$, let $N(n,K)$ be the set of the nilpotent $n \times n$ matrices over $K$ and let $D(n,K) $ be the set of the $n \times n$ matrices over $K$ which are diagonalizable over $K$. Moreover, let…
Finding the maximum number of maximal independent sets in an $n$-vertex graph $G$, $i(G)$, from a restricted class is an extensively studied problem. Let $kK_2$ denote the matching of size $k$, that is a graph with $2k$ vertices and $k$…
Let ${\rm Mat}_n(\mathbb{F})$ denote the set of square $n\times n$ matrices over a field $\mathbb{F}$ of characteristic different from two. The permanental rank ${\rm prk}\,(A)$ of a matrix $A \in{\rm Mat}_{n}(\mathbb{F})$ is the size of…