Anders Kock
We study algebraic properties of matrices whose rows are mutual neighbours, and are also neigbours of 0 ("neighbour" in the sense of a certain nilpotency condition). The intended application is in synthetic differential geometry. For a square matrix of this kind, the product of the diagonal entries equals the determinant, modulo a factor n!
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
A nonzero pattern is a matrix with entries in {0,*}. A pattern is potentially nilpotent if there is some nilpotent real matrix with nonzero entries in precisely the entries indicated by the pattern. We develop ways to construct some potentially nilpotent patterns, including some balanced tree patterns. We explore the index of some of the nilpotent matrices constructed,and observe that some of the balanced trees are spectrally arbitrary using the Nilpotent-Jacobian method. Inspired by an argument in [R. Pereira, Nilpotent matrices and spectrally arbitrary sign patterns. Electron. J. Linear Alge…
A theorem of Mina evaluates the determinant of a matrix with entries $D^j(f(x)^i)$. We note the important special case where the matrix entries are evaluated at $x=0$ and give a simple proof of it, and some applications. We then give a short proof of the general case.
Sums of two nilpotent quaternionic matrices
本文刻画了四元数除环上可表示为两个幂零矩阵之和的方阵，给出了简洁的充要条件，并讨论了n≥3时的特殊情况。
By using the quasi-determinant the construction of Gel'fand et al. leads to the inverse of a matrix with noncommuting entries. In this work we offer a new method that is more suitable for physical purposes and motivated by deformation quantization, where our constructed algorithm emulates the commutative case and in addition gives corrections coming from the noncommutativity of the entries. Furthermore, we provide an equivalence of the introduced algorithm and the construction via quasi-determinants.
We introduce a new notion of the determinant, called symmetrized determinant, for a square matrix with the entries in an associative algebra $Å$. The monomial expansion of the symmetrized determinant is obtained from the standard expansion of the commutative determinant by averaging the products of entries of the matrix in all possible orders. We show that for any fixed finite-dimensional associative algebra $Å$, the symmetrized determinant of an $n\times n$ matrix with the entries in $Å$ can be computed in polynomial in $n$ time (the degree of the polynomial is linear in the dimension of $Å$)…
Fix a field F. A zero-nonzero pattern A is said to be potentially nilpotent over F if there exists a matrix with entries in F with zero-nonzero pattern A that allows nilpotence. In this paper we initiate an investigation into which zero-nonzero patterns are potentially nilpotent over F, with a special emphasis on the case that F = Z_p is a finite field. As part of this investigation, we develop methods, using the tools of algebraic geometry and commutative algebra, to eliminate zero-nonzero patterns A as being potentially nilpotent over any field F. We then use these techniques to classify all…
Let K be a skew field, and K_0 be a subfield of the central subfield of K such that K has finite dimension q over K_0. Let V be a K_0-linear subspace of n by n nilpotent matrices with entries in K. We show that the dimension of V is bounded above by q n(n-1)/2, and that equality occurs if and only if V is similar to the space of all n by n strictly upper-triangular matrices over K. This generalizes famous theorems of Gerstenhaber and Serezhkin, which cover the special case K=K_0.
Under binary matrices we mean matrices whose entries take one of two values. In this paper, explicit formulae for calculating the determinant of some type of binary Toeplitz matrices are obtained. Examples of the application of the determinant of binary Toeplitz matrices for the enumeration of even and odd permutations of different types are given.
One of the aims of this paper is to provide a short survey on the Z2-graded, the symmetric and the left (right) generalizations of the classical determinant theory for square matrices with entries in an arbitrary (possibly non-commutative) ring. This will put us in a position to give a motivation for our main results. We use the preadjoint matrix to exhibit a general trace expression for the symmetric determinant. The symmetric version of the classical Newton trace formula is also presented in the 3x3 case.
We prove several evaluations of determinants of matrices, the entries of which are given by the recurrence $a_{i,j}=a_{i-1,j}+a_{i,j-1}$, or variations thereof. These evaluations were either conjectured or extend conjectures by Roland Bacher [J. Théorie Nombres Bordeaux 13 (2001), to appear; see http://arxiv.org/abs/math.CO/0109013].
We present new identities for determinants of matrices $(A_{i,j})$ with entries $A_{i,j}$ equal to $a_{i,j}$ or $a_{i,0}a_{0,j}-a_{i,j}$, where the $a_{i,j}$'s are indeterminates. We show that these identities are behind trace identities for $SL(2,\Bbb C)$ matrices found earlier by Magnus in his study of trace algebras.
We prove the existence of a common eigenvector for commutative, nilpotent and quasinilpotent semigroups of matrices with complex or real nonnegative entries both in the conventional and tropical linear algebra.
We investigate the least common multiple of all subdeterminants, lcmd(A x B), of a Kronecker product of matrices, of which one is an integral matrix A with two columns and the other is the incidence matrix of a complete graph with n vertices. We prove that this quantity is the least common multiple of lcmd(A) to the power n-1 and certain binomial functions of the entries of A.
Let K be a field and let M_n(K) denote the space of n x n matrices with entries in K. Let M be a subspace of M_n(K) of dimension d with the property that there are elements in M with non-zero determinant. Given a basis of M, we define the determinantal polynomial P_{M} of M with respect to the basis. It is a homogeneous polynomial of degree n in d indeterminates that gives the determinant of any element of M by evaluation in K^d. This paper investigates the interrelationship of M and P_{M}. We confine ourselves to finite fields K, where we can obtain useful information by applying the Lang-Wei…
Let $k$ be an algebraically closed field of any characteristic except 2, and let $G = \GL_n(k)$ be the general linear group, regarded as an algebraic group over $k$. Using an algebro-geometric argument and Dynkin-Kostant theory for $G$ we begin by obtaining a canonical form for nilpotent $\Ad(G)$-orbits in $\glł_n(k)$ which is symmetric with respect to the non-main diagonal (i.e. it is fixed by the map $f : (x_{i,j})\mapsto (x_{n+1-j,n+1-i})$), with entries in $\{0,1\}$. We then show how to modify this form slightly in order to satisfy a non-degenerate symmetric or skew-symmetric bilinear form…
A square matrix is $k$-Toeplitz if its diagonals are periodic sequences of period $k$. We find universal formulas for the determinant, the characteristic polynomial, some eigenvectors, and the entries of the inverse of any tridiagonal $k$-Toeplitz matrix (in particular, of any tridiagonal matrix) over any commutative unital ring, expressed in terms of the elementary operations of the ring. The results are proven using combinatorial identities and elementary linear algebra. We conduct a complexity analysis of algorithms based on our formulas, showing that they are efficient, and we compare our …
We describe a class of matrices whose determinants are trivial to compute. A nice example of such a matrix is given by considering the symmetric matrix with entries {i+j choose i} (mod 2) in {0,1}, 0 <= i,j < n the binomial coefficients modulo 2 represented by {0,1}. The determinant of the above matrix is then closely related to the Thue-Morse sequence counting digits modulo 2 of binary integers.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。