Related papers: Matrix equation representation of the convolution …
We address a linear fractional differential equation and develop effective solution methods using algorithms for inversion of triangular Toeplitz matrices and the recently proposed QTT format. The inverses of such matrices can be computed…
In this paper, we give the complete structures of the equivalence canonical form of four matrices over an arbitrary division ring. As applications, we derive some practical necessary and sufficient conditions for the solvability to some…
The set of morphisms mapping any Sturmian sequence to a Sturmian sequence forms together with composition the so-called monoid of Sturm. For this monoid, we defne a faithful representation by $(3\times 3)$-matrices with integer entries. We…
We consider stochastic equations for the class of formal mappings. Existence and uniqueness of solution, as well as evolution property are proved.
We propose an efficient algorithm for computing a common eigenvector of a finite set of square matrices. As an immediate consequence we obtain an algorithm for determining whether the matrices admit a simultaneous triangulation, and, if so,…
In this paper we present a general scheme to generate constructive solutions to the Riemann--Hilbert problem via middle convolution and illustrate this approach for a Fuchsian system with four singular points.
In the stable general linear group over an arbitrary field, we prove that every element with determinant $\pm 1$ is the product of three involutions, and of no less in general. We also obtain several results of the same flavor, with…
Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising applications in database theory and machine learning, where…
We give fundamental solutions of arbitrarily sized matrix Fuchsian linear systems, in the case where the coefficients $B^{(i)}$ of the systems are matrix solutions of the Schlesinger system that are upper triangular, and whose eigenvalues…
In this note we provide a full conjugacy and subdifferential calculus for convex convex-composite functions in finite-dimensional space. Our approach, based on infimal convolution and cone-convexity, is straightforward and yields the…
We view a conic optimization problem that has a unique solution as a map from its data to its solution. If sufficient regularity conditions hold at a solution point, namely that the implicit function theorem applies to the normalized…
In this paper, we study convolutional codes with a specific cyclic structure. By definition, these codes are left ideals in a certain skew polynomial ring. Using that the skew polynomial ring is isomorphic to a matrix ring we can describe…
In this paper, we study the determination of Hamiltonian from a given equations of motion. It can be cast into a problem of matrix factorization after reinterpretation of the system as first-order evolutionary equations in the phase space…
We develop several efficient algorithms for the classical \emph{Matrix Scaling} problem, which is used in many diverse areas, from preconditioning linear systems to approximation of the permanent. On an input $n\times n$ matrix $A$, this…
We study the convolution function $$ C[f(x)] := \int_1^x f(y)f({x\over y}) {{\rm d} y\over y} $$ when $f(x)$ is a suitable number-theoretic error term. Asymptotics and upper bounds for $C[f(x)]$ are derived from mean square bounds for…
We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic sets when convexity is present. In particular, we show that under convexity, the hierarchy of semidefinite relaxations for…
In this paper, we introduce a new and direct approach to study the solvability of systems of equations generated by bilinear forms. More precisely, let $B (\cdot, \cdot)$ be a non-degenerate bilinear form and $E$ be a set in…
Convolution sums are introduced and special instances of the cyclic convolution on finite sets is examined in more detail. The distributions that emerge are multidimensional generalizations of the Catalan and Narayana numbers. This work…
Let $m$ be any integer $\geq 3$. We consider the polynomial equation $$X^n + a_{n-1}\cdot X^{n-1} + \dots + a_1 \cdot X + a_0 \cdot I = O,$$ over $(m \times m)$-matrices $X$ with the real entries, where $I$ is the identity matrix, $O$ is…
Solving the 4-d Einstein equations as evolution in time requires solving equations of two types: the four elliptic initial data (constraint) equations, followed by the six second order evolution equations. Analytically the constraint…