Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 149 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 35 tok/s Pro
GPT-5 High 35 tok/s Pro
GPT-4o 92 tok/s Pro
Kimi K2 196 tok/s Pro
GPT OSS 120B 425 tok/s Pro
Claude Sonnet 4.5 35 tok/s Pro
2000 character limit reached

Irredundant Generating Sets for Matrix Algebras (2503.19387v2)

Published 25 Mar 2025 in math.RA

Abstract: Let $F$ be a field. We show that the largest irredundant generating sets for the algebra of $n\times n $ matrices over $F$ have $2n-1$ elements when $n>1$. (A result of Laffey states that the answer is $2n-2$ when $n>2$, but its proof contains an error.) We further give a classification of the largest irredundant generating sets when $n\in{2,3}$ and $F$ is algebraically closed. We use this description to compute the dimension of the variety of $(2n-1)$-tuples of $n\times n$ matrices which form an irredundant generating set when $n\in{2,3}$, and draw some consequences to Zariski-locally redundant generation of Azumaya algebras. In the course of proving the classification, we also determine the largest sets $S$ of subspaces of $F3$ with the property that every $V\in S$ admits a matrix stabilizing every subspace in $S-{V}$ and not stabilizing $V$.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.