English
Related papers

Related papers: Principal Matrices of Numerical Semigroups

200 papers

The notion of `stable rank' of a matrix is central to the analysis of randomized matrix algorithms, covariance estimation, deep neural networks, and recommender systems. We compare the properties of the stable rank and intrinsic dimension…

Numerical Analysis · Mathematics 2024-12-20 Ilse C. F. Ipsen , Arvind K. Saibaba

The rank of a finite semigroup is the smallest number of elements required to generate the semigroup. A formula is given for the rank of an arbitrary (non necessarily regular) Rees matrix semigroup over a group. The formula is expressed in…

Group Theory · Mathematics 2014-06-09 Robert D. Gray

Let M be a p-by-q matrix with nonnegative entries. The positive semidefinite rank (psd rank) of M is the smallest integer k for which there exist positive semidefinite matrices $A_i, B_j$ of size $k \times k$ such that $M_{ij} =…

Optimization and Control · Mathematics 2015-09-16 Hamza Fawzi , João Gouveia , Pablo A. Parrilo , Richard Z. Robinson , Rekha R. Thomas

Since the work of Jennings (1955), it is well-known that any finitely generated torsion-free nilpotent group can be embedded into unitriangular integer matrices $UT_N(Z)$ for some $N$. In 2006, Nickel proposed an algorithm to calculate such…

Group Theory · Mathematics 2016-06-08 Funda Gul , Armin Weiß

We determine the generic complete eigenstructures for $n \times n$ complex symmetric matrix polynomials of odd grade $d$ and rank at most $r$. More precisely, we show that the set of $n \times n$ complex symmetric matrix polynomials of odd…

Numerical Analysis · Mathematics 2019-11-05 Fernando De Terán , Andrii Dmytryshyn , Froilán M. Dopico

Multiplicative matrix semigroups with constant spectral radius (c.s.r.) are studied and applied to several problems of algebra, combinatorics, functional equations, and dynamical systems. We show that all such semigroups are characterized…

Metric Geometry · Mathematics 2014-07-25 Vladimir Protasov , Andrey Voynov

The exponential of an NxN matrix can always be expressed as a matrix polynomial of order N-1. In particular, a general group element for the fundamental representation of SU(N) can be expressed as a matrix polynomial of order N-1 in a…

Representation Theory · Mathematics 2016-01-20 T. S. Van Kortryk

Let $R$ be a commutative ring with identity and $M$ a unitary $R$-module. The purpose of this paper is to introduce the concept of semi-$n$-submodules as an extension of semi $n$-ideals and $n$-submodules. A proper submodule $N$ of $M$ is…

Commutative Algebra · Mathematics 2025-09-11 Hani Khashan , Ece Yetkin Celikel

We determine the essential dimension of an arbitrary semisimple group of type $B$ of the form \[G=\big(\operatorname{\mathbf{Spin}}(2n_{1}+1)\times\cdots \times \operatorname{\mathbf{Spin}}(2n_{m}+1)\big)/\boldsymbol{\mu}\] over a field of…

Algebraic Geometry · Mathematics 2023-08-07 Sanghoon Baek , Yeongjong Kim

A real square matrix is Perron-like if it has a real eigenvalue $s$, called the principal eigenvalue of the matrix, and $\mbox{Re}\,\mu<s$ for any other eigenvalue $\mu$. Nonnegative matrices and symmetric ones are typical examples of this…

Numerical Analysis · Mathematics 2020-08-18 Desheng Li , Ruijing Wang

Maximally embedding dimension (MED) numerical semigroups are a wide and interesting family, with some remarkable algebraic and combinatorial properties. Associated to any numerical semigroup one can construct a MED closure, as it is well…

Combinatorics · Mathematics 2025-01-22 Jorge Jiménez Urroz , José M. Tornero

We characterize numerical semigroups $S$ with embedding dimension three attaining equality in the inequality $\max\Delta(S)+2\leq \operatorname{cat}(S)$, where $\Delta(S)$ denotes the Delta set of $S$ and $\operatorname{cat}(S)$ denotes the…

Number Theory · Mathematics 2024-10-25 Pedro A. García-Sánchez , Helena Martín-Cruz

In this paper, we introduce the notion of (strictly) semimonotone matrices of exact order $k$, where $0\leq k\leq n$, and explore their properties. We fully characterize the $3 \times 3$ (strictly) semimonotone matrices of exact order $2$,…

Optimization and Control · Mathematics 2026-03-03 Bharat Pratap Chauhan , Dipti Dubey

We give upper bounds on the essential dimension of (quasi-)simple algebraic groups over an algebraically closed field that hold in all characteristics. The results depend on showing that certain representations are generically free. In…

Group Theory · Mathematics 2016-07-26 Skip Garibaldi , Robert M. Guralnick

The class of quasiseparable matrices is defined by the property that any submatrix entirely below or above the main diagonal has small rank, namely below a bound called the order of quasiseparability. These matrices arise naturally in…

Symbolic Computation · Computer Science 2019-10-22 Clement Pernet , Arne Storjohann

A subspace of matrices over $\mathbb{F}_{q^e}^{m\times n}$ can be naturally embedded as a subspace of matrices in $\mathbb{F}_q^{em\times en}$ with the property that the rank of any of its matrix is a multiple of $e$. It is quite natural to…

Information Theory · Computer Science 2022-11-18 Olga Polverino , Paolo Santonastaso , John Sheekey , Ferdinando Zullo

We show that every principal submatrix of a square matrix $A$ with only entries in $\{0,1,-1\}$ has even rank if and only if $A$ is skew-symmetric up to multiplication of rows/columns by $-1$.

Combinatorics · Mathematics 2019-09-24 Robert Brijder

Let $ m , n \in \mathbb{N}$, $D$ be a division ring, and $M_{m \times n}(D)$ denote the bimodule of all $m \times n$ matrices with entries from $D$. First, we characterize one-sided submodules of $M_{m \times n}(D)$ in terms of left row…

Rings and Algebras · Mathematics 2015-08-04 M. Rahimi-Alangi , Bamdad R. Yahaghi

We determine sufficient conditions for certain classes of $(n+k) \times n$ matrices $E$ to have all order-$n$ minors to be nonzero. For a special class of $(n+1) \times n$ matrices $E,$ we give the formula for the order-$n$ minors. As an…

Functional Analysis · Mathematics 2020-08-12 Priyabrata Bag , Santanu Dey , Masaru Nagisa , Hiroyuki Osaka

The polynomial-time computability of the permanent over fields of characteristic 3 for k-semi-unitary matrices (i.e. square matrices such that the differences of their Gram matrices and the corresponding identity matrices are of rank k) in…

Computational Complexity · Computer Science 2020-11-04 Anna Knezevic , Greg Cohen , Marina Domanskaya