Related papers: Unitary loops and factorization
Fracture functions and their evolution equations are reviewed. Some phenomenological applications are briefly discussed.
In light of recent data science trends, new interest has fallen in alternative matrix factorizations. By this, we mean various ways of factorizing particular data matrices so that the factors have special properties and reveal insights into…
In this paper, we obtain a general expression for the entries of the r. (r is integer) power of a certain n-square complex tridiagonal matrix. In addition, we get the complex factorizations of Fibonacci polynomials, Fibonacci and Pell…
We introduce extriangulated factorization systems in extriangulated categories and show that there exists a bijection between $s$-torsion pairs and extriangulated factorization systems. We also consider the gluing of $s$-torsion pairs and…
The purpose of this text is to provide an accessible introduction to a set of recently developed algorithms for factorizing matrices. These new algorithms attain high practical speed by reducing the dimensionality of intermediate…
In this work, we present an algorithm for the diagonalization of the Integration-by-Parts (IBP) equations. Diagonalized IBP equations are indispensable for reducing loop integrals with high numerator powers to master integrals and for…
A complete classification of unimodular valuations on the set of lattice polygons with values in the spaces of polynomials and formal power series, respectively, is established. The valuations are classified in terms of their behaviour with…
We start with elementary algebraic theory of factorization of linear ordinary differential equations developed in the period 1880-1930. After exposing these classical results we sketch more sophisticated algorithmic approaches developed in…
A unified approach to parametrization of the mixing matrix for $N$ generations is developed. This approach not only has a clear geometrical underpinning but also has the advantage of being economical and recursive and leads in a natural way…
Following the works by Lin et al. (Circuits Syst. Signal Process. 20(6): 601-618, 2001) and Liu et al. (Circuits Syst. Signal Process. 30(3): 553-566, 2011), we investigate how to factorize a class of multivariate polynomial matrices. The…
Many applications in scientific computing and data science require the computation of a rank-revealing factorization of a large matrix. In many of these instances the classical algorithms for computing the singular value decomposition are…
In this paper we develop further and refine the method of differential equations for computing Feynman integrals. In particular, we show that an additional iterative structure emerges for finite loop integrals. As a concrete non-trivial…
In [2] a new factorization for infinite Hessenberg banded matrices was introduced. In this note we prove that this kind of factorization can also be used for finite matrices. In addition, a new method for solving banded linear systems is…
This chapter amalgamates some foundational developments and calculations in factorization homology.
The article shows how the factorization of an arbitrary Lorentz transformation is performed. That is, representation of an arbitrary Lorentz transformation as a sequence of spatial rotation and boost or boost and spatial rotation. Relations…
In this paper we use the equivariant version of factorization homology constructed using the parametrized higher category theory and show that it can be used to describe the results used in the series of papers.
In this paper, we introduce novel characterizations of the classical concept of majorization in terms of upper triangular (resp., lower triangular) row-stochastic matrices, and in terms of sequences of linear transforms on vectors. We used…
A Code loop on a binary linear code that is doubly even with a factor set is shown to be a central loop, conjugacy closed loop, Burn loop and extra loop. General forms of the identities that define the factor set of a code are deduced.
We prove that any symplectic matrix can be factored into no more than 5 unit triangular symplectic matrices, moreover, 5 is the optimal number. This result improves the existing triangular factorization of symplectic matrices which gives…
This is a study of inner-outer factorization for analytic matrix-valued functions focusing on representations of the factors in terms of multiplicative integrals. Included is a brief introduction to the theory of multiplicative integrals…