中文
相关论文

相关论文: Explicit Description of Centralizers for a Matrix

200 篇论文

This article is devoted to the study of the centralizer and the clifforder of a matrix over a field $\mathbb{F}$ of characteristic zero, as well as the quasi-commutative relations between matrices over the complex field $\mathbb{C}$. We…

综合数学 · 数学 2025-10-21 Hechun Zhang , Chengyi Zhu

It is known that that the centralizer of a matrix over a finite field depends, up to conjugacy, only on the type of the matrix, in the sense defined by J. A. Green. In this paper an analogue of the type invariant is defined that in general…

群论 · 数学 2013-10-22 John R. Britnell , Mark Wildon

Let $M=(E,{\cal I})$ be a matroid. A {\em $k$-truncation} of $M$ is a matroid {$M'=(E,{\cal I}')$} such that for any $A\subseteq E$, $A\in {\cal I}'$ if and only if $|A|\leq k$ and $A\in {\cal I}$. Given a linear representation of $M$ we…

数据结构与算法 · 计算机科学 2014-04-18 Daniel Lokshtanov , Pranabendu Misra , Fahad Panolan , Saket Saurabh

For a field $R$ of characteristic $p\ge 0$ and a matrix $c$ in the full $n\times n$ matrix algebra $M_n(R)$ over $R$, let $S_n(c,R)$ be the centralizer algebra of $c$ in $M_n(R)$. We show that $S_n(c,R)$ is a Frobenius-finite,…

表示论 · 数学 2022-07-11 Changchang Xi , Jinbi Zhang

Although a good portion of elementary linear algebra concerns itself with matrices over a field such as $\mathbb{R}$ or $\mathbb{C}$, many combinatorial problems naturally surface when we instead work with matrices over a finite field. As…

组合数学 · 数学 2024-12-17 Catherine Falvey , Heewon Hah , William Sheppard , Brian Sittinger , Rico Vicente

Denote by $M_n(K)$ the algebra of $n$ by $n$ matrices with entries in the field $K$. A theorem of Albert and Muckenhoupt states that every trace zero matrix of $M_n(K)$ can be expressed as $AB-BA$ for some pair $(A,B)$ of matrices of…

环与代数 · 数学 2014-07-16 Clément de Seguins Pazzis

For each of the classical Lie algebras $g(n)=o(2n+1), sp(2n), o(2n)$ of type B, C, D we consider the centralizer of the subalgebra $g(n-m)$ in the universal enveloping algebra $U(g(n))$. We show that the $n$th centralizer algebra can be…

q-alg · 数学 2008-03-02 Alexander Molev , Grigori Olshanski

Binary matrix factorisation is an essential tool for identifying discrete patterns in binary data. In this paper we consider the rank-k binary matrix factorisation problem (k-BMF) under Boolean arithmetic: we are given an n x m binary…

最优化与控制 · 数学 2021-08-05 Reka A. Kovacs , Oktay Gunluk , Raphael A. Hauser

Let $N_n(F)$ denote the ring of strictly upper triangular matrices with entries in a field $F$ of characteristic zero and center $Z(N_n(F))$. We characterize the $2$-power commuting maps over $N_n(F)$, maps satisfying the identity…

环与代数 · 数学 2025-11-21 Jordan Bounds

We study the problem of constructing explicit families of matrices which cannot be expressed as a product of a few sparse matrices. In addition to being a natural mathematical question on its own, this problem appears in various…

计算复杂性 · 计算机科学 2019-04-03 Mrinal Kumar , Ben Lee Volk

Working over an algebraically closed field $k$ of any characteristic, we determine the matrix factorizations for the --- suitably graded --- triangle singularities $f=x^a+y^b+z^c$ of domestic type, that is, we assume that $(a,b,c)$ are…

表示论 · 数学 2015-07-29 Dawid Edmund Kędzierski , Helmut Lenzing , Hagen Meltzer

Let $M(n)$ denote the number of distinct entries in the $n \times n$ multiplication table. The function $M(n)$ has been studied by Erd\H{o}s, Tenenbaum, Ford, and others, but the asymptotic behaviour of $M(n)$ as $n \to \infty$ is not known…

数论 · 数学 2021-10-20 Richard Brent , Carl Pomerance , David Purdum , Jonathan Webster

In this paper we give an explicit solution to the rank constrained matrix approximation in Frobenius norm, which is a generalization of the classical approximation of an m by n matrix A by a matrix of rank k at most.

最优化与控制 · 数学 2007-05-23 Shmuel Friedland , Anatoli Torokhti

Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…

符号计算 · 计算机科学 2014-09-22 Wei Zhou , George Labahn

In the paper we present a new, uniform and comprehensive description of centralizers of the maximal regular subgroups in compact simple Lie groups of all types and ranks. The centralizer is either a direct product of finite cyclic groups, a…

数学物理 · 物理学 2011-10-03 M. Larouche , F. W. Lemire , J. Patera

We study the growth of the central polynomials for the algebras $G$ and $M_k(F)$, the infinite dimensional Grassmann algebra and the $k\times k$ matrices over a field $F$ of characteristic zero. In particular it follows that $M_k(F)$…

表示论 · 数学 2015-04-28 Amitai Regev

The maximal dimension of commutative subspaces of $M_n(\mathbb{C})$ is known. So is the structure of such a subspace when the maximal dimension is achieved. We consider extensions of these results and ask the following natural questions: If…

环与代数 · 数学 2023-08-07 Matjaž Omladič , Heydar Radjavi , Klemen Šivic

We show that the centralizer of a nonscalar element in the coproduct $k\langle X\rangle *k[Y]$ of a free associative algebra and a polynomial algebra over a given field is commutative. For $k\langle X \rangle$ this is part of Bergman's…

环与代数 · 数学 2026-04-16 Jakob Jurij Snoj

A matrix space of size $m\times n$ is a linear subspace of the linear space of $m\times n$ matrices over a field $\mathbb{F}$. The rank of a matrix space is defined as the maximal rank over matrices in this space. A matrix space…

环与代数 · 数学 2017-03-02 Yinan Li , Youming Qiao

We find a basis for the $G$-graded identities of the $n\times n$ matrix algebra $M_n(K)$ over an infinite field $K$ of characteristic $p>0$ with an elementary grading such that the neutral component corresponds to the diagonal of $M_n(K)$.

环与代数 · 数学 2014-07-08 Diogo Diniz Pereira da Silva e Silva