Related papers: Recursive parameterisation and invariant phases of…
Structured recursion schemes have been widely used in constructing, optimising, and reasoning about programs over inductive and coinductive datatypes. Their plain forms, catamorphisms and anamorphisms, are restricted in expressiveness. Thus…
This paper presents a unifying theory of Linear second order systems that allows time-varying and time invariant systems to be treated in the same way for the first time. In the process, a transformation is given that diagonalizes an…
This paper is dedicated to the problem of verification of matrices for unitary similarity. For the case of nonderogatory matrices, we have been able to present the new solution for this problem based on geometric approach. The main…
In this paper, we introduce novel fast matrix inversion algorithms that leverage triangular decomposition and recurrent formalism, incorporating Strassen's fast matrix multiplication. Our research places particular emphasis on triangular…
We develop several methods, based on the geometric relationship between the eigenspaces of a matrix and its adjoint, for determining whether a square matrix having distinct eigenvalues is unitarily equivalent to a complex symmetric matrix.…
Order parameters based on spherical harmonics and Fourier coefficients already play a significant role in condensed matter research in the context of systems of spherical or point particles. Here, we extend these types of order parameter to…
We present a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the predicate calculus as well as a formal induction principle. We introduce recursive systems generating…
Modern technology often generates data with complex structures in which both response and explanatory variables are matrix-valued. Existing methods in the literature are able to tackle matrix-valued predictors but are rather limited for…
The analysis of parametrised systems is a growing field in verification, but the analysis of parametrised probabilistic systems is still in its infancy. This is partly because it is much harder: while there are beautiful cut-off results for…
This paper presents a parametrization of a degenerate density matrix. The problem needs to be approached first with a diagonalized form (the spectral representation) to deal with degeneracy. Such a form is useful for this parametrization in…
We introduce transfer matrices to describe the motion of particles in the vicinity of the stable and unstable fixed points of longitudinal phase space and use them to analyze the transfer of bunches between radio-frequency systems operating…
It has been shown that for a certain special type of quantum graphs the random-matrix form factor can be recovered to at least third order in the scaled time \tau using periodic-orbit theory. Two types of contributing pairs of orbits were…
In this study, we introduce the concept of commutative quaternions and commutative quaternion matrices. Firstly, we give some properties of commutative quaternions and their Hamilton matrices. After that we investigate commutative…
We survey results on factorizations of non zero-divisors into atoms (irreducible elements) in noncommutative rings. The point of view in this survey is motivated by the commutative theory of non-unique factorizations. Topics covered include…
In this paper, we introduce and study sequential versions of several fibrewise homotopy invariants, including parametrized topological complexity, parametrized (subspace) homotopic distance. We investigate their basic properties, establish…
If the unitary quark- mixing matrix, $V$, is moduli symmetric then it depends on three real parameters. This means that there is a relation between the four parameters needed to parametrize a general $V$. It is shown that there exists a…
We give an overview of the existing algorithms to compute nonunique factorization invariants in finitely generated monoids.
Interferences in multi-path systems for single and multiple particles are theoretically analyzed. A holistic method is presented, which allows to construct the unitary transition matrix describing interferometers for any port number d and…
In this paper, we describe a reliable symbolic computational algorithm for inverting general cyclic heptadiagonal matrices by using parallel computing along with recursion. The algorithm is implementable to the Computer Algebra System(CAS)…
If $A$ is a tridiagonal matrix, then the equations $AX=I$ and $XA=I$ defining the inverse $X$ of $A$ are in fact the second order recurrence relations for the elements in each row and column of $X$. Thus, the recursive algorithms should be…