English
Related papers

Related papers: Minimal generating sets for matrix monoids

200 papers

In this paper, we study the minimum rank among positive semidefinite matrices with a given graph of at most seven vertices (msr) by giving vector representations.

Combinatorics · Mathematics 2012-07-25 Xinyun Zhu

We study the problem of determining a minimal set of generators for the polynomial algebra $\mathbb F_2[x_1,x_2,...,x_k]$ as a module over the mod-2 Steenrod algebra $\mathcal{A}$. In this paper, we give an explicit answer in terms of the…

Algebraic Topology · Mathematics 2024-12-31 Nguyen Sum

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…

Rings and Algebras · Mathematics 2010-01-19 Rostyslav V. Kravchenko , Marcin Mazur , Bogdan V. Petrenko

A minimum storage regenerating (MSR) subspace family of $\mathbb{F}_q^{2m}$ is a set $\mathcal{S}$ of $m$-spaces in $\mathbb{F}_q^{2m}$ such that for any $m$-space $S$ in $\mathcal{S}$ there exists an element in $\mathrm{PGL}(2m, q)$ which…

Combinatorics · Mathematics 2023-10-25 Ferdinand Ihringer

In this article, we study the normal generation of the mapping class group. We first show that a mapping class is a normal generator if its restriction on the invariant subsurface normally generates the (pure) mapping class group of the…

Geometric Topology · Mathematics 2023-10-10 Hyungryul Baik , Dongryul M. Kim , Chenxi Wu

We consider real orthogonal $n\times n$ matrices whose diagonal entries are zero and off-diagonal entries nonzero, which we refer to as $\mathrm{OMZD}(n)$. We show that there exists an $\mathrm{OMZD}(n)$ if and only if $n\neq 1,\ 3$, and…

Combinatorics · Mathematics 2019-06-11 Robert F. Bailey , Robert Craigen

Let $R=K[x_{1},x_{2},\cdots, x_{m}]$ where $K$ is a field. In this paper, we give some properties of $n$-matrix factorizations of polynomials in $R$. We also derive some results giving some lower bounds on the number of $n$-matrix factors…

Rings and Algebras · Mathematics 2025-02-11 Yves Fomatati

We explore the structure of the cohomology ring of the moduli space of stable 1-dimensional sheaves on $\mathbb{P}^2$ of any degree. We obtain a minimal set of tautological generators, which implies an optimal generation result for both the…

Algebraic Geometry · Mathematics 2022-09-22 Weite Pi , Junliang Shen

The classification of all the minimal 1-saturating sets in PG(v, 2) for 2 <= v <= 5, and the classification of the smallest and of the second smallest minimal 1-saturating sets in PG(6, 2) are presented. These results have been found using…

Combinatorics · Mathematics 2018-02-13 Alexander A. Davydov , Stefano Marcugini , Fernanda Pambianco

We provide an algorithm that computes a set of generators for any complete ideal in a smooth complex surface. More interestingly, these generators admit a presentation as monomials in a set of maximal contact elements associated to the…

Algebraic Geometry · Mathematics 2017-10-31 Maria Alberich-Carramiñana , Josep Alvarez Montaner , Guillem Blanco

Let $\KX =K\langle X_1,\ldots ,X_n\rangle$ be the free algebra generated by $X=\{ X_1,\ldots ,X_n\}$ over a field $K$. It is shown that with respect to any weighted $\mathbb{N}$-gradation attached to $\KX$, minimal homogeneous generating…

Rings and Algebras · Mathematics 2015-06-22 Huishi Li

Let $G =<S>$ be a solvable permutation group of the symmetric group $S_n$ given as input by the generating set $S$. We give a deterministic polynomial-time algorithm that computes an \emph{expanding generating set} of size $\tilde{O}(n^2)$…

Computational Complexity · Computer Science 2012-01-17 V. Arvind , Partha Mukhopadhyay , Prajakta Nimbhorkar , Yadu Vasudev

A boolean matrix is blocky if its $1$-entries form a collection of 1-monochromatic submatrices that are disjoint in both rows and columns. Blocky matrices are precisely the set of boolean matrices with $\gamma_2$ factorization norm at most…

Classical Analysis and ODEs · Mathematics 2025-07-16 Marcel K. Goh , Hamed Hatami

For a given undirected graph $G$, an \emph{ordered} subset $S = {s_1,s_2,...,s_k} \subseteq V$ of vertices is a resolving set for the graph if the vertices of the graph are distinguishable by their vector of distances to the vertices in…

Discrete Mathematics · Computer Science 2015-12-11 Ashwin Ganesan

The phylogenetic semigroup on a graph generalizes the Jukes-Cantor binary model on a tree. Minimal generating sets of phylogenetic semigroups have been described for trivalent trees by Buczy\'nska and Wi\'sniewski, and for trivalent graphs…

Combinatorics · Mathematics 2013-04-03 Kaie Kubjas

We provide a complete classification of matrix semirings $\mathbf{M}_n(S)$ over two-element additively idempotent semirings $S$ with respect to the finite basis property.Our main theorem shows that for every integer $n \geq 2$,the semiring…

Rings and Algebras · Mathematics 2026-02-10 Jun Jiao , Miaomiao Ren

The multiplicative semigroup $M_n(F)$ of $n\times n$ matrices over a field $F$ is well understood, in particular, it is a regular semigroup. This paper considers semigroups of the form $M_n(S)$, where $S$ is a semiring, and the…

Rings and Algebras · Mathematics 2019-07-30 Victoria Gould , Marianne Johnson , Munazza Naz

We give generators and relations for the graded rings of Hermitian modular forms of degree two over the rings of integers in $\mathbb{Q}(\sqrt{-7})$ and $\mathbb{Q}(\sqrt{-11})$. In both cases we prove that the subrings of symmetric modular…

Number Theory · Mathematics 2020-01-14 Brandon Williams

We present a protocol for the Boolean matrix product of two $n\times b$ Boolean matrices on the congested clique designed for the situation when the rows of the first matrix or the columns of the second matrix are highly clustered in the…

Data Structures and Algorithms · Computer Science 2024-05-28 Andrzej Lingas

Minimal linear codes are in one-to-one correspondence with special types of blocking sets of projective spaces over a finite field, which are called strong or cutting blocking sets. In this paper we prove an upper bound on the minimal…

Combinatorics · Mathematics 2021-05-18 Tamás Héger , Zoltán Lóránt Nagy
‹ Prev 1 8 9 10 Next ›