English
Related papers

Related papers: A New Determinantal Formula for Three Matrices

200 papers

Let $R$ be a commutative ring with identity and $S$ a multiplicatively closed subset of $R$. This paper aims to introduce the concept of $S$-$n$-ideals as a generalization of $n$-ideals. An ideal $I$ of $R$ disjoint with $S$ is called an…

Commutative Algebra · Mathematics 2021-07-05 Hani Khashan , Ece Yetkin Celikel

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…

Rings and Algebras · Mathematics 2014-07-16 Clément de Seguins Pazzis

We consider generalizations of the Vieta formula (relating the coefficients of an algebraic equation to the roots) to the case of equations whose coefficients are order-$k$ matrices. Specifically, we prove that if $X_1,\dots ,X_n$ are…

Rings and Algebras · Mathematics 2016-09-06 Dmitry Fuchs , Albert Schwarz

We propose the ternary generalization of the classical anti-commutativity and study the algebras whose generators are ternary anti-commutative. The integral over an algebra with an arbitrary number of generators N is defined and the formula…

High Energy Physics - Theory · Physics 2007-05-23 Viktor Abramov

In this paper, we provide some solvability conditions in terms of ranks for the existence of a general solution to a system of $k$ Sylvester-type quaternion matrix equations with $3k+1$ variables…

Rings and Algebras · Mathematics 2020-07-31 Qing-Wen Wang , Mengyan Xie

The algebras considered in this paper are commutative rings of which the additive group is a finite-dimensional vector space over the field of rational numbers. We present deterministic polynomial-time algorithms that, given such an…

Commutative Algebra · Mathematics 2016-10-05 H. W. Lenstra , A. Silverberg

Let $\A_0, \A_1, \ldots, \A_n$ be given square matrices of size $m$ with rational coefficients. The paper focuses on the exact computation of one point in each connected component of the real determinantal variety $\{\X \in\RR^n \: :\:…

Symbolic Computation · Computer Science 2014-12-19 Didier Henrion , Simone Naldi , Mohab Safey El Din

In this paper, we introduce a concept of $\mathfrak{X}$-element with respect to an $M$-closed set $\mathfrak{X}$ in multiplicative lattices and study properties of $\mathfrak{X}$-elements. For a particular $M$-closed subset $\mathfrak{X}$,…

Commutative Algebra · Mathematics 2021-01-19 Sachin Sarode , Vinayak Joshi

A matrix is called Bohemian if its entries are sampled from a finite set of integers. We determine the maximum absolute determinant of upper Hessenberg Bohemian Matrices for which the subdiagonal entries are fixed to be $1$ and upper…

Symbolic Computation · Computer Science 2020-05-12 Jonathan P. Keating , Ahmet Abdullah Keleş

The objective of this paper is to develop a general algebraic theory of supertropical matrix algebra, extending [11]. Our main results are as follows: * The tropical determinant (i.e., permanent) is multiplicative when all the determinants…

Commutative Algebra · Mathematics 2009-12-07 Zur Izhakian , Louis Rowen

After the language of module and theirs morphisms, this short course presents matricial calculus and determinants in a commutative ring as appliction of ``remarquable identities'' in the ring of polynomials with integer coefficients with…

History and Overview · Mathematics 2025-08-08 Alexis Marin

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…

Rings and Algebras · Mathematics 2017-02-21 Dmitry Efimov

The number of $n \times n$ matrices whose entries are either -1, 0, or 1, whose row- and column- sums are all 1, and such that in every row and every column the non-zero entries alternate in sign, is proved to be $[1!4! >...…

Combinatorics · Mathematics 2008-02-03 Doron Zeilberger

In this document, some structured operator approximation theoretical methods for system identification of nearly eventually periodic systems, are presented. Let $\mathbb{C}^{n\times m}$ denote the algebra of $n\times m$ complex matrices.…

Numerical Analysis · Mathematics 2020-01-31 Fredy Vides

We show that a unital ring is generated by its commutators as an ideal if and only if there exists a natural number $N$ such that every element is a sum of $N$ products of pairs of commutators. We show that one can take $N \leq 2$ for…

Rings and Algebras · Mathematics 2024-04-04 Eusebio Gardella , Hannes Thiel

We obtain the following results about the avoidance of ternary formulas. Up to renaming of the letters, the only infinite ternary words avoiding the formula $ABCAB.ABCBA.ACB.BAC$ (resp. $ABCA.BCAB.BCB.CBA$) have the same set of recurrent…

Discrete Mathematics · Computer Science 2018-09-26 Pascal Ochem , Matthieu Rosenfeld

By using Sulanke-Xin continued fractions method, Xin proposed a recursion system to solve the Somos 4 Hankel determinant conjecture. We find Xin's recursion system indeed give a sufficient condition for $(\alpha, \beta)$ Somos $4$…

Combinatorics · Mathematics 2023-06-16 Ying Wang , Zihao Zhang

Let $S = K[x_1, ..., x_n]$ denote the polynomial ring in $n$ variables over a field $K$ with each $\deg x_i = 1$. Let $\Delta$ be a simplicial complex on $[n] = \{1, ..., n \}$ and $I_\Delta \subset S$ its Stanley--Reisner ideal. We write…

Commutative Algebra · Mathematics 2008-02-12 Takayuki Hibi , Satoshi Murai

Pairs (A,B) of mutually annihilating operators AB=BA=0 on a finite dimensional vector space over an algebraically closed field were classified by Gelfand and Ponomarev [Russian Math. Surveys 23 (1968) 1-58] by method of linear relations.…

Representation Theory · Mathematics 2008-12-12 Vitalij M. Bondarenko , Tatiana G. Gerasimova , Vladimir V. Sergeichuk

Graham and Winkler derived a formula for the determinant of the distance matrix of a full-dimensional set of $n + 1$ points $\{ x_{0}, x_{1}, \ldots , x_{n} \}$ in the Hamming cube $H_{n} = ( \{ 0,1 \}^{n}, \ell_{1} )$. In this article we…

Functional Analysis · Mathematics 2020-08-03 Ian Doust , Gavin Robertson , Alan Stoneham , Anthony Weston
‹ Prev 1 8 9 10 Next ›