English
Related papers

Related papers: A Generalized Closed Form For Triangular Matrix Po…

200 papers

A well-known result on Lie Theory states that every finite-dimensional complex solvable Lie algebra can be represented as a matrix Lie algebra, with upper-triangular square matrices as elements. However, this result does not specify which…

Representation Theory · Mathematics 2014-04-15 Manuel Ceballos , Juan Núñez , Ángel F. Tenorio

Power nonnegative matrices are defined as complex matrices having at least one nonnegative integer power. We exploit the possibility of deriving a Perron Frobenius-like theory for these matrices, obtaining three main results and drawing…

Numerical Analysis · Mathematics 2013-11-21 F. Tudisco , V. Cardinali , C. Di Fiore

After defining convex near-polygons, a formula enumerating the number of triangulations of such configurations is derived in terms of edge-polynomials. The paper describes also a transfer-matrix approach for computing quantities related to…

Combinatorics · Mathematics 2007-05-23 Roland Bacher

In this letter, we propose a general real-space method for the generation of nonparaxial accelerating beams with arbitrary predefined convex trajectories. Our results lead to closed-form expressions for the required phase at the input…

In \cite{Ka}, the authors obtained a method for deriving special matrices, whose powers are related to Fibonacci and Lucas numbers. In the study, it has been developed a method for deriving special matrices of $3\times 3$ dimensions, whose…

Combinatorics · Mathematics 2019-01-15 Gamaliel Cerda-Morales

Electronic structure methods that exploit nonorthogonal Slater determinants face the challenge of efficiently computing nonorthogonal matrix elements. In a recent publication, H. G. A. Burton, J. Chem. Phys. 154, 144109 (2021), I introduced…

Chemical Physics · Physics 2024-06-19 Hugh G. A. Burton

The purpose of this article is to study determinants of matrices which are known as generalized Pascal triangles (see [1]). We present a factorization by expressing such a matrix as a product of a unipotent lower triangular matrix, a…

Rings and Algebras · Mathematics 2017-05-16 A. R. Moghaddamfar , S. M. H. Pooya

We present the generalization of the entanglement of formation for three-party systems in a pure state. For three qubit system we derive out its explicit and closed expression which is a linear combination of the binary entropy functions…

Quantum Physics · Physics 2007-05-23 An Min Wang

Closed formulas for the multilinear rank of trifocal Grassmann tensors are obtained. An alternative process to the standard HOSVD is introduced for the computation of the core of trifocal Grassmann tensors. Both of these results are…

Algebraic Geometry · Mathematics 2023-12-05 Marina Bertolini , Gian Mario Besana , Gilberto Bini , Cristina Turrini

Matrix transformations in terms of triangular matrices is the easiest method of evaluating matrix-variate gamma and beta integrals in the real and complex cases. Here we give several procedures of explicit evaluation of gamma and beta…

Statistics Theory · Mathematics 2014-09-29 A. M. Mathai

A concise analytical formula is developed for the inverse of an invertible 3 x 3 matrix using a telescoping method, and is generalized to larger square matrices. The formula is confirmed using randomly generated matrices in Matlab

General Mathematics · Mathematics 2021-09-14 W Astar

The evaluation of iterated primitives of powers of logarithms is expressed in closed form. The expressions contain polynomials with coefficients given in terms of the harmonic numbers and their generalizations. The logconcavity of these…

Number Theory · Mathematics 2014-04-18 Luis A. Medina , Victor H. Moll , Eric S. Rowland

Power series in which the summand satisfies a linear recurrence relation with polynomial coefficients are shown to be the solution of a linear differential or algebraic equation. Solving the associated differential or algebraic equation…

General Mathematics · Mathematics 2026-01-19 Erik Talvila

We significantly strengthen results on the structure of matrix rings over finite fields and apply them to describe the structure of the so-called weakly $n$-torsion clean rings. Specifically, we establish that, for any field $F$ with either…

Rings and Algebras · Mathematics 2023-03-20 Adel N. Abyzov , Stephen D. Cohen , Peter V. Danchev , Daniel T. Tapkin

We give unique recovery guarantees for matrices of bounded rank that have undergone permutations of their entries. We even do this for a more general matrix structure that we call ladder matrices. We use methods and results of commutative…

Information Theory · Computer Science 2022-07-25 Manolis C. Tsakiris

An extension of two finite trigonometric series is studied to derive closed form formulae involving the Hurwitz-Lerch zeta function. The trigonometric series involves angles with a geometric series involving the powers of 3. These closed…

Number Theory · Mathematics 2025-05-22 Robert Reynolds

A general method for the reduction of coupled spherical harmonic products is presented. When the total angular coupling is zero, the reduction leads to an explicitly real expression in the scalar products within the unit vector arguments of…

Mathematical Physics · Physics 2023-02-28 D. R. Lehman , W. C. Parke

In a very recent paper "\emph{On eigenvalues and equivalent transformation of trigonometric matrices}" (D. Zhang, Z. Lin, and Y. Liu, LAA 436, 71--78 (2012)), the authors motivated and discussed a trigonometric matrix that arises in the…

Numerical Analysis · Mathematics 2012-05-01 Suvrit Sra

The $\imath$-divided powers (depending on a parity) form the $\imath$canonical basis for the split rank 1 $\imath$quantum group and they are a basic ingredient for $\imath$quantum groups of higher rank. We obtain closed formulae for the…

Quantum Algebra · Mathematics 2023-01-03 Xinhong Chen , Weiqiang Wang

We present a simple proof of the fact that the base (and independence) polytope of a rank $n$ regular matroid over $m$ elements has an extension complexity $O(mn)$.

Discrete Mathematics · Computer Science 2017-02-08 Rohit Gurjar , Nisheeth K. Vishnoi