Related papers: A Universal Closed Form For Square Matrix Powers
This article discusses some important applications of the quadratic function with the aim of highlighting the importance of cuadr\'aticas.- forms are also intended to show how a simple function covers virtually all areas of knowledge are…
The problem of writing a totally positive element as a sum of squares has a long history in mathematics, going back to Bachet and Lagrange. While for some specific rings (like integers or polynomials over the rationals), there are known…
We consider the problem of determining which matrices are permutable to be supmodular. We show that for small dimensions any matrix is permutable by a universal permutation or by a pair of permutations, while for higher dimensions no…
We obtain closed-form expressions for all sums of the form \mbox{$\sum_{k = 1}^n {F_{mk}{}^4 }$} and \mbox{$\sum_{k = 1}^n {L_{mk}{}^4 }$} and their alternating versions, where $F_i$ and $L_i$ denote Fibonacci and Lucas numbers…
The problem of simultaneous decomposition of binary forms as sums of powers of linear forms is studied. For generic forms the minimal number of linear forms needed is found and the space parametrizing all the possible decompositions is…
Certain upper triangular matrices, termed as Parikh matrices, are often used in the combinatorial study of words. Given a word, the Parikh matrix of that word elegantly computes the number of occurrences of certain predefined subwords in…
In this study, we get a general expression for the entries of the sth power of even order pentadiagonal 2-Toeplitz matrices.
The classical quadratic formula and some of its lesser known variants for solving the quadratic equation are reviewed. Then, a new formula for the roots of a quadratic polynomial is presented.
We describe a way to approximate the matrix elements of a real power $\alpha$ of a positive (for $\alpha \ge 0$) or non-negative (for $\alpha \in \mathbb{R}$), infinite, bounded, sparse and Hermitian matrix $W$. The approximation uses only…
The matrix inversion is an interesting topic in algebra mathematics. However, to determine an inverse matrix from a given matrix is required many computation tools and time resource if the size of matrix is huge. In this paper, we have…
In this note explicit algorithms for calculating the exponentials of important structured 4 x 4 matrices are provided. These lead to closed form formulae for these exponentials. The techniques rely on one particular Clifford Algebra…
We establish closed-form expansions for the universal edge elimination polynomial of paths and cycles and their generating functions. This includes closed-form expansions for the bivariate matching polynomial, the bivariate chromatic…
The form factor of a quantum graph is a function measuring correlations within the spectrum of the graph. It can be expressed as a double sum over the periodic orbits on the graph. We propose a scheme which allows one to evaluate the…
Consider a rectangular matrix describing some type of communication or transportation between a set of origins and a set of destinations, or a classification of objects by two attributes. The problem is to infer the entries of the matrix…
This note presents a short, transparent proof of the theorem that every Euclidean quadratic form over a normed integral domain is an Aubry-Davenport-Cassels form. The theorem, as formulated in the note, allows besides quadratic terms also…
In this paper we compute the sum of the $k$-th powers over any finite commutative unital rings, thus generalizing known results for finite fields, the rings of integers modulo $n$ or the ring of Gaussian integers modulo $n$. As an…
We consider the problem of deciding if a set of quantum one-qudit gates $\mathcal{S}=\{U_1,\ldots,U_n\}$ is universal. We provide the compact form criteria leading to a simple algorithm that allows deciding universality of any given set of…
For any $n\ge 2$ and fixed $k\ge 1$, we give necessary and sufficient conditions for an arbitrary nonzero square matrix in the matrix ring $\mathbb{M}_n(\mathbb{F})$ to be written as a sum of an invertible matrix $U$ and a nilpotent matrix…
A real $n$-by-$n$ idempotent matrix $A$ with all entries having the same absolute value is called {\it absolutely flat}. We consider the possible ranks of such matrices and herein characterize the triples: size, constant, and rank for which…
In this note we introduce a representation of simple undirected graphs in terms of polynomials and obtain a unique code for a simple undirected graph.