English
Related papers

Related papers: Bilinear maps on the ring of strictly upper triang…

200 papers

It is known from the algebraic graph theory that if $L$ is the Laplacian matrix of some tree $G$ with a vertex degree sequence $\mathbf{d}=(d_1, ..., d_n)^\top$ and $D$ is its distance matrix, then…

Combinatorics · Mathematics 2021-01-25 Mikhail Goubko , Alexander Veremyev

Let $A,B$ be two rings and let $ X$ be an $ A-$module. An additive map $h: A\to B$ is called n-ring homomorphism if $h(\Pi^n_{i=1}a_i)=\Pi^n_{i=1}h(a_i),$ for all $a_1,a_2, ...,a_n \in {A}$. An additive map $D: A\to X$ is called $n$-ring…

Functional Analysis · Mathematics 2008-12-31 M. Eshaghi Gordji

The current paper is dedicated to the problem of finding the number of mutually non isomorphic bipartite graphs of the type $g=\langle R_g ,C_g ,E_g \rangle$ at given $n=|R_g |$ and $m=|C_g |$, where $R_g$ and $C_g$ are the two disjoint…

Discrete Mathematics · Computer Science 2016-04-12 Krasimir Yordzhev

We prove that if $F$ is a Lipschitz map from the set of all complex $n\times n$ matrices into itself with $F(0)=0$ such that given any $x$ and $y$ we have that $% F\left( x\right) -F\left( y\right) $ and $x-y$ have at least one common…

Operator Algebras · Mathematics 2016-02-15 Constantin Costara , Dušan Repovš

Let $M$ be a noncommutative 2-torsion free semiprime $\Gamma$-ring satisfying a certain assumption and let $S$ and $T$ be left centralizers on $M$. We prove the following results: \\(i) If $[S(x),T(x)]_{\alpha }\beta S(x)+S(x)\beta…

Rings and Algebras · Mathematics 2016-01-05 Md Fazlul Hoque , A C Paul

Fillmore Theorem says that if A is an nxn complex non-scalar matrix and {\gamma}_1,...,{\gamma}_{n} are complex numbers with {\gamma}_1+...+{\gamma}_{n}=trA, then there exists a matrix B similar to A with diagonal entries…

Spectral Theory · Mathematics 2018-04-17 Ana I. Julio , Ricardo L. Soto

Rotary maps (orientably regular maps) are highly symmetric graph embeddings on orientable surfaces. This paper classifies all rotary maps whose underlying graphs are Praeger-Xu graphs, denoted $\operatorname{C}(p,r,s)$, for any odd prime…

Combinatorics · Mathematics 2025-07-03 Zhaochen Ding , Zheng Guo , Luyi Liu

Let $f(u)$ and $g(v)$ be any two polynomials of degree $k$ and $\ell$ respectively ($k$ and $\ell$ are not both $1$), which split into distinct linear factors over $\mathbb{F}_{q}$. Let $\mathcal{R}=\mathbb{F}_{q}[u,v]/\langle…

Information Theory · Computer Science 2018-11-06 Mokshi Goyal , Madhu Raka

In this paper, we investigate the subset obtained by evaluations of a fixed multilinear polynomial on a given algebra. We provide an example of a multilinear polynomial, whose image is not a vector subspace; namely, the product of two…

Rings and Algebras · Mathematics 2019-04-23 Ednei A. Santulo , Felipe Y. Yasumura

Let $B_n$ (resp. $U_n$, $N_n$) be the set of $n\times n$ nonsingular (resp. unit, nilpotent) upper triangular matrices. We use a novel approach to explore the $B_n$-similarity orbits in $N_n$. The Belitski\u{\i}'s canonical form of $A\in…

Representation Theory · Mathematics 2020-02-25 Ming-Cheng Tsai , Meaza Bogale , Huajun Huang

Let L be a restricted Lie superalgebra with its enveloping algebra u(L) over a field F of characteristic p>2. A polynomial identity is called non-matrix if it is not satisfied by the algebra of 2\times 2 matrices over F. We characterize L…

Rings and Algebras · Mathematics 2010-06-21 Hamid Usefi

Positive bi-linear maps between matrix algebras play important roles to detect tri-partite entanglement by the duality between bi-linear maps and tri-tensor products. We exhibit indecomposable positive bi-linear maps between $2\times 2$…

Functional Analysis · Mathematics 2017-09-21 Seung-Hyeok Kye

Let $p$ be a polynomial in non-commutative variables $x_1,x_2,\ldots,x_n$ with constant term zero over an algebraically closed field $K$. The object of study in this paper is the image of this kind of polynomial over the algebra of upper…

Rings and Algebras · Mathematics 2023-12-04 Saikat Panja , Sachchidanand Prasad

We study rings $R$ for which whenever non-zero polynomials $f(x)$ and $g(x)$ satisfy $f(x)g(x)f(x)=0$, it implies that there is a non-zero element $r\in R$ such that $f(x)rf(x)=0$. We call such rings inner McCoy rings. We explore some…

Rings and Algebras · Mathematics 2024-02-27 Sharang Thimmaiah , Raisa DSouza

A linear map $\Phi$ between matrix spaces is called cross-positive if it is positive on orthogonal pairs $(U,V)$ of positive semidefinite matrices in the sense that $\langle U,V\rangle:=\text{Tr}(UV)=0$ implies $\langle…

Functional Analysis · Mathematics 2025-11-14 Igor Klep , Klemen Šivic , Aljaž Zalar

We determine the structure of linear maps on complex (real) square matrices sending unitary (orthogonal) matrices to multiples of unitary (orthogonal) matrices. The result is used to determine the linear preservers of matrix pairs…

Functional Analysis · Mathematics 2025-10-08 Bojan Kuzma , Chi-Kwong Li , Edward Poon

Motivated by satisfiability of constraints with function symbols, we consider numerical inequalities on non-negative integers. The constraints we consider are a conjunction of a linear system Ax = b and a conjunction of (non-)convex…

Logic in Computer Science · Computer Science 2022-10-21 Rodrigo Raya , Jad Hamza , Viktor Kunčak

A bilinear quadrature numerically evaluates a continuous bilinear map, such as the $L^2$ inner product, on continuous $f$ and $g$ belonging to known finite-dimensional function spaces. Such maps arise in Galerkin methods for differential…

Numerical Analysis · Mathematics 2015-09-29 Christopher A. Wong

Consider the algebra M(n,F) of n x n matrices over an infinite field F of arbitrary characteristic. An identity for M(n,F) with forms is such a polynomial in n x n generic matrices and in \sigma_k(x), 0<k\leq n, coefficients in the…

Rings and Algebras · Mathematics 2012-10-19 Artem A. Lopatin

We show that the product of an nx3 matrix and a 3x3 matrix over a commutative ring can be computed using 6n+3 multiplications. For two 3x3 matrices this gives us an algorithm using 21 multiplications. This is an improvement with respect to…

Computational Complexity · Computer Science 2020-07-28 Andreas Rosowski