English
Related papers

Related papers: Multiplicative derivations on rank-$s$ matrices fo…

200 papers

Over algebraically closed fields of characteristic p>2, prolongations of the simple finite dimensional Lie algebras and Lie superalgebras with Cartan matrix are studied for certain simplest gradings of these algebras. Several new simple Lie…

Representation Theory · Mathematics 2009-06-24 Sofiane Bouarroudj , Pavel Grozman , Dimitry Leites

Let $n>m$, and let $A$ be an $(m\times n)$-matrix of full rank. Then obviously the estimate $\|Ax\|\leq\|A\|\|x\|$ holds for the euclidean norm of $x$ and $Ax$ and the spectral norm as the assigned matrix norm. We study the sets of all $x$…

Rings and Algebras · Mathematics 2022-03-16 Harry Yserentant

Let $k$ be a natural number and $s$ be real. In the 1-dimensional case, the $k$-th order derivatives of the functions $\lvert x\rvert^s$ and $\log \lvert x\rvert$ are multiples of $\lvert x\rvert^{s-k}$ and $\lvert x\rvert^{-k}$,…

Classical Analysis and ODEs · Mathematics 2016-06-21 Kei Morii , Tokushi Sato , Yoshihiro Sawano

In this work we investigate the derivations of $n-$dimensional complex evolution algebras, depending on the rank of the appropriate matrices. For evolution algebra with non-singular matrices we prove that the space of derivations is zero.…

Commutative Algebra · Mathematics 2018-05-01 L. M. Camacho , J. R. Gómez , B. A. Omirov , R. M. Turdibaev

Let V be a linear subspace of M_{n,p}(K) with codimension lesser than n, where K is an arbitrary field and n >=p. In a recent work of the author, it was proven that V is always spanned by its rank p matrices unless n=p=2 and K is isomorphic…

Rings and Algebras · Mathematics 2011-03-23 Clément de Seguins Pazzis

Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified value. This generalizes the problem of finding a nearest…

Symbolic Computation · Computer Science 2017-12-13 Mark Giesbrecht , Joseph Haraldson , George Labahn

The nonnegative integer rank of a matrix is a variant of the classical nonnegative rank, introduced in the 1980s, where factorizations are required to have integer entries. While computing nonnegative integer rank is generally very hard, we…

Combinatorics · Mathematics 2026-02-27 João Gouveia , Amy Wiebe

This paper is motivated by basic complexity and probability questions about permanents of random matrices over finite fields, and in particular, about properties separating the permanent and the determinant. Fix $q = p^m$ some power of an…

Computational Complexity · Computer Science 2025-12-05 Fatemeh Ghasemi , Gal Gross , Swastik Kopparty

Let $n$ and $p$ be non-negative integers with $n \geq p$, and $S$ be a linear subspace of the space of all $n$ by $p$ matrices with entries in a field $\mathbb{K}$. A classical theorem of Flanders states that $S$ contains a matrix with rank…

Rings and Algebras · Mathematics 2015-07-20 Clément de Seguins Pazzis

We prove that any multi-variate Hasse-Schmidt derivation can be decomposed in terms of substitution maps and uni-variate Hasse-Schmidt derivations. As a consequence we prove that the bracket of two $m$-integrable derivations is also…

Algebraic Geometry · Mathematics 2021-07-20 Luis Narváez-Macarro , María de la Paz Tirado Hernández

Given a nonnegative matrix M with rational entries, we consider two quantities: the usual positive semidefinite (psd) rank, where the matrix is factored through the cone of real symmetric psd matrices, and the rational-restricted psd rank,…

Optimization and Control · Mathematics 2014-04-21 João Gouveia , Hamza Fawzi , Richard Z. Robinson

Robust low-rank matrix estimation is a topic of increasing interest, with promising applications in a variety of fields, from computer vision to data mining and recommender systems. Recent theoretical results establish the ability of such…

Information Theory · Computer Science 2011-09-29 Ignacio Ramírez , Guillermo Sapiro

The aim of this work is to study some lattice diagram polynomials $\Delta_D(X,Y)$. We recall that $M_D$ denotes the space of all partial derivatives of $\Delta_D$. In this paper, we want to study the space $M^k_{i,j}(X,Y)$ which is the sum…

Combinatorics · Mathematics 2007-11-07 Jean-Christophe Aval

For a polynomial $P$ of degree $n$ and an $m$-tuple $\Lambda=(\lambda_1,\dots,\lambda_m)$ of distinct complex numbers, the dope matrix of $P$ with respect to $\Lambda$ is $D_P(\Lambda)=(\delta_{ij})_{i\in [1,m],j\in[0,n]}$, where…

Combinatorics · Mathematics 2022-12-13 Noga Alon , Noah Kravitz , Kevin O'Bryant

An $L$-matrix is a matrix whose off-diagonal entries belong to a set $L$, and whose diagonal is zero. Let $N(r,L)$ be the maximum size of a square $L$-matrix of rank at most $r$. Many applications of linear algebra in extremal combinatorics…

Commutative Algebra · Mathematics 2016-08-22 Boris Bukh

Let $K$ be a number field, let $A$ be a finite-dimensional $K$-algebra, let $\mathrm{J}(A)$ denote the Jacobson radical of $A$, and let $\Lambda$ be an $\mathcal{O}_{K}$-order in $A$. Suppose that each simple component of the semisimple…

Number Theory · Mathematics 2022-09-01 Werner Bley , Tommy Hofmann , Henri Johnston

A transversal matroid $M$ of rank $r$ on $[n]$ can be associated to a family of binary matrices corresponding to different presentations of $M$. We describe those matrices which arise from unique maximal presentations of size $r$- giving a…

Combinatorics · Mathematics 2019-09-11 Austin Alderete

Let $M$ and $N$ be matroids such that $N$ is the image of $M$ under a rank-preserving weak map. Generalizing results of Lucas, we prove that, for $x$ and $y$ positive, $T(M;x,y)\geq T(N;x,y)$ if and only if $x+y\geq xy$ or $M\cong N$. We…

Combinatorics · Mathematics 2025-06-24 Christine Cho , James Oxley

Let $S_{n}$ denote the space of all $n \times n$ real symmetric matrices. For n=2 or n>2 we characterize maps F from $S_{n}$ to $S_{m}$ which preserve adjacency, i.e. if rank(A-B)=1, then rank(F(A)-F(B))=1.

Rings and Algebras · Mathematics 2007-11-16 Peter Legiša

We study the problem of determining a matrix whose $k$th multiplicative compound is a prescribed matrix~$M$. The cardinality of the set of matrices whose $k$th multiplicative compound equals~$M$ is characterized in terms of $\rank(M)$. On…

Rings and Algebras · Mathematics 2026-05-28 Debojyoti Dey , Ron Ofir , Christian Grussler