Related papers: Irredundant Generating Sets for Matrix Algebras

Let $G$ be a finite almost simple group. It is well known that $G$ can be generated by 3 elements, and in previous work we showed that 6 generators suffice for all maximal subgroups of $G$. In this paper we consider subgroups at the next…

An $n\times n$ matrix $M$ is called a \textit{fooling-set matrix of size $n$} if its diagonal entries are nonzero and $M_{k,\ell} M_{\ell,k} = 0$ for every $k\ne \ell$. Dietzfelbinger, Hromkovi{\v{c}}, and Schnitger (1996) showed that $n…

Let $S$ be a set of $n\times n$ matrices over a field $\mathbb{F}$. We show that the $\mathbb{F}$-linear span of the words in $S$ of length at most $$2n\log_2n+4n$$ is the full $\mathbb{F}$-algebra generated by $S$. This improves on the…

A subset of vertices is a {\it maximum independent set} if no two of the vertices are adjacent and the subset has maximum cardinality. A subset of vertices is called a {\it maximum dissociation set} if it induces a subgraph with vertex…

An element of a finitely generated non-Abelian free group F(X) is said to be filling if that element has positive translation length in every very small action of F(X) on an $\mathbb{R}$-tree. We give a proof that the set of filling…

We show that the inverse limit of the graded algebras of local unitary invariant polynomials of finite dimensional k-partite quantum systems is free, and give an algebraically independent generating set. The number of degree 2d invariants…

The linear spaces that are fixed by a given nilpotent $n \times n$ matrix form a subvariety of the Grassmannian. We classify these varieties for small $n$. Mutiah, Weekes and Yacobi conjectured that their radical ideals are generated by…

We prove that the algebraic set of pairs of matrices with a diagonal commutator over a field of positive prime characteristic, its irreducible components, and their intersection are $F$-pure when the size of matrices is equal to 3.…

Let $S(n)$ be the infinite-type surface with infinite genus and $n \in \mathbb{N}$ ends, all of which are accumulated by genus. The mapping class group of this surface, $\mod(S(n))$, is a Polish group that is not countably generated, but it…

We consider a minimizing variant of the well-known \emph{No-Three-In-Line Problem}, the \emph{Geometric Dominating Set Problem}: What is the smallest number of points in an $n\times n$~grid such that every grid point lies on a common line…

A family of subsets of the set {1,2,...,n} is said to be unbalanced if the convex hull of its characteristic vectors misses the diagonal in the n-cube.The purpose of this article is to develop the combinatorics of maximal unbalanced…

We study the minimal homogeneous generating sets of the Eulerian ideal associated with a simple graph and its maximal generating degree. We show that the Eulerian ideal is a lattice ideal and use this to give a characterization of binomials…

The purpose of this short problem paper is to raise an extremal question on set systems which seems to be natural and appealing. Our question is: which set systems of a given size maximise the number of $(n+1)$-element chains in the power…

Let $M_n(\mathbb{F})$ be the algebra of $n \times n$ matrices and let $\mathcal S$ be a generating set of $M_n(\mathbb{F})$ as an $\mathbb{F}$-algebra. The length of a finite generating set $\mathcal S$ of $M_n(\mathbb{F})$ is the smallest…

A subset S of a finite group G invariably generates G if G = <hsg(s) j s 2 Si > for each choice of g(s) 2 G; s 2 S. We give a tight upper bound on the minimal size of an invariable generating set for an arbitrary finite group G. In response…

There are several results in the literature concerning $p$-groups $G$ with a maximal elementary abelian normal subgroup of rank $k$ due to Thompson, Mann and others. Following an idea of Sambale we obtain bounds for the number of generators…

We consider the variety of Filippov ($n$-Lie) algebra structures on an $(n+1)$-dimensional vector space. The group $GL_n(K)$ acts on it, and we study the orbit closures with respect to the Zariski topology. This leads to the definition of…

A method for generating irreducible polynomials of degree n over the finite field GF(2) is proposed. The irreducible polynomials are found by solving a system of equations that brings the information on the internal properties of the…

Let T(X) be the semigroup of full transformations on a finite set X with n elements. We prove that every subsemilattice of T(X) has at most 2^{n-1} elements and that there are precisely n subsemilattices of size exactly 2^{n-1}, each…

In this article, we show the existence of large sets $\operatorname{LS}_2[3](2,k,v)$ for infinitely many values of $k$ and $v$. The exact condition is $v \geq 8$ and $0 \leq k \leq v$ such that for the remainders $\bar{v}$ and $\bar{k}$ of…