English
Related papers

Related papers: Some algebraic identities for the alpha-permanent

200 papers

We compute two parametric determinants in which rows and columns are indexed by compositions, where in one determinant the entries are products of binomial coefficients, while in the other the entries are products of powers. These results…

Combinatorics · Mathematics 2007-05-23 J. M. Brunat , C. Krattenthaler , A. Lascoux , A. Montes

In the article, a notion "logarithmically absolutely monotonic function" is introduced, an inclusion that a logarithmically absolutely monotonic function is also absolutely monotonic is revealed, the logarithmically complete monotonicity…

Classical Analysis and ODEs · Mathematics 2010-08-20 Feng Qi , Bai-Ni Guo

Let $H$ be a positive semi-definite matrix partitioned in $\beta\times \beta$ Hermitian blocks, $H=[A_{s,t}]$, $1\le s,t,\le \beta$. Then, for all symmetric norms, {equation*} \| H \| \le \| \sum_{s=1}^{\beta} A_{s,s} \|. {equation*} The…

Functional Analysis · Mathematics 2012-09-11 Jean-Christophe Bourin , Eun-Young Lee , Minghua Lin

We show that certain weighted average of the alpha-determinant of a $kn$ by $kn$ matrix of the form $A\otimes1_{1,k}$, the Kronecker product of a $kn$ by $n$ matrix $A$ and $1$ by $k$ all one matrix $1_{1,k}$, over permutations of $kn$…

Representation Theory · Mathematics 2014-03-18 Kazufumi Kimoto

On the set of mappings of the given set, we define the product of mappings. If A is associative algebra, then we consider the set of matrices, whose elements are linear mappings of algebra A. In algebra of matrices of linear mappings we…

General Mathematics · Mathematics 2010-01-28 Aleks Kleyn

Aiming to provide weak as possible axiomatic assumptions in which one can develop basic linear algebra, we give a uniform and integral version of the short propositional proofs for the determinant identities demonstrated over $GF(2)$ in…

Computational Complexity · Computer Science 2018-11-13 Iddo Tzameret , Stephen A. Cook

We give an elementary proof of a Caratheodory-type result on the invertibility of a sum of matrices, due first to Facchini and Barioli. The proof yields a polynomial identity, expressing the determinant of a large sum of matrices in terms…

Rings and Algebras · Mathematics 2016-04-21 Justin Chen

Persistent homology was shown by Carlsson and Zomorodian to be homology of graded chain complexes with coefficients in the graded ring $\kk[t]$. As such, the behavior of persistence modules -- graded modules over $\kk[t]$ is an important…

Computational Geometry · Computer Science 2013-02-18 Primoz Skraba , Mikael Vejdemo-Johansson

The article considers arrowhead and diagonal-plus-rank-one matrices in F^(nxn) where F in R,C or H. H is a non-commutative field of quaternions. We give unified formulas for fast matrix-vector multiplications, determinants, and inverses for…

Numerical Analysis · Mathematics 2022-12-22 Nevena Jakovcevic Stor , Ivan Slapnicar

Let $\xi$ be an algebraic number and let $\alpha,\beta\in \mathbb Q[\xi]$. An explicit formula for the coordinates of the product $\alpha\beta$ is given in terms of the coordinates of $\alpha$ and $\beta$ and the companion matrix of the…

Rings and Algebras · Mathematics 2010-08-13 Natalio H. Guersenzvaig , Fernando Szechtman

The principal minors of a symmetric $n{\times}n$-matrix form a vector of length $2^n$. We characterize these vectors in terms of algebraic equations derived from the $ 2{\times}2{\times}2$-hyperdeterminant.

Rings and Algebras · Mathematics 2007-10-13 Olga Holtz , Bernd Sturmfels

Many iterative algorithms in optimization, computational geometry, computer algebra, and other areas of computer science require repeated computation of some algebraic expression whose input changes slightly from one iteration to the next.…

Computational Complexity · Computer Science 2024-01-24 Emile Anand , Jan van den Brand , Mehrdad Ghadiri , Daniel Zhang

For operators generated by a certain class of infinite band matrices with matrix elements we establish a characterization of the resolvent set in terms of polynomial solutions of the underlying higher order finite difference equations. This…

Spectral Theory · Mathematics 2014-12-24 Andrey Osipov

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…

Rings and Algebras · Mathematics 2023-01-04 Jose Brox , Helena Albuquerque

The (-\beta)-integers are natural generalisations of the \beta-integers, and thus of the integers, for negative real bases. They can be described by infinite words which are fixed points of anti-morphisms. We show that they are not…

Formal Languages and Automata Theory · Computer Science 2011-08-19 Wolfgang Steiner

The existence of linear differential resolvents for z^alpha for any root z of an ordinary polynomial with coefficients in a given ordinary differential field has been established, where alpha is an indeterminate constant with respect to the…

Rings and Algebras · Mathematics 2008-03-18 John Michael Nahay

Given two finite sequences of positive integers $\alpha$ and $\beta$, we associate a square free monomial ideal $I_{\alpha,\beta}$ in a ring of polynomials $S$, and we recursively compute the algebraic invariants of $S/I_{\alpha,\beta}$.…

Commutative Algebra · Mathematics 2018-05-28 Mircea Cimpoeas

We call the solution of a kind of second order homogeneous partial differential equation as real kernel alpha-harmonic mappings. In this paper, the representation theorem, the Lipschitz continuity, the univalency and the related problems of…

Complex Variables · Mathematics 2024-01-22 Bo-Yong Long , Qi-Han Wang

Subsets of a matrix algebra over a field that are invariant under conjugation and contain the linear span of each two of their commuting elements are described. They obviously include the subsets of diagonalizable and nilpotent matrices. In…

Rings and Algebras · Mathematics 2022-05-13 O. G. Styrt

We study the arithmetic circuit complexity of some well-known family of polynomials through the lens of parameterized complexity. Our main focus is on the construction of explicit algebraic branching programs (ABP) for determinant and…

Computational Complexity · Computer Science 2019-08-23 V. Arvind , Abhranil Chatterjee , Rajit Datta , Partha Mukhopadhyay