Related papers: Recursive parameterisation and invariant phases of…
In this paper we provide an analytical procedure which leads to a system of $(n-2)^2$ polynomial equations whose solutions give the parameterisation of the complex $n\times n$ Hadamard matrices. It is shown that in general the Hadamard…
Let $R$ be an associative ring with identity and let $N$ be a nil ideal of $R$. It is shown that units of $R/N$ can be lifted to units in $R$. Under some mild conditions on the ring, a procedure is given to determine those lifted units in a…
A matrix approach to continuous iteration is proposed for general formal series. It leads, in particular, to an order{to{order iteration of the exponential function, and consequently to an algorithmic approach to tetration. Lower{order…
We introduce the theoretical framework we use to study the bewildering variety of phases in condensed--matter physics. We emphasize the importance of the breaking of symmetries, and develop the idea of an order parameter through several…
Reconfiguration paths express sequences of successive reconfiguration operations within a component-based approach allowing dynamic reconfigurations. We use constructs from regular expressions-pin particular, alternatives-to introduce…
We show, that the standard model of phase transition can be unified with the gradient model of phase transitions using the description in terms of the gradient of order parameter. The generalization of the gradient theory of phase…
We introduce a novel approach that employs techniques from noncommutative Poisson geometry to comprehend the algebra of invariants of two $n\times n$ matrices. We entirely solve the open problem of computing the algebra of invariants of two…
The problem of matrix factorization motivated by diffraction or elasticity is studied. A powerful tool for analyzing its solutions is introduced, namely analytical continuation formulae are derived. Necessary condition for commutative…
Composed ensembles of random unitary matrices are defined via products of matrices, each pertaining to a given canonical circular ensemble of Dyson. We investigate statistical properties of spectra of some composed ensembles and demonstrate…
In the following short paper we list some useful results concerning determinants and inverses of matrices. First we show, how to calculate determinants of $d \times d$ matrices, if their traces are known. As a next step $4 \times 4$…
We use differentiable programming and gradient descent to find unitary matrices that can be used in the period finding algorithm to extract period information from the state of a quantum computer post application of the oracle. The standard…
It is shown that the simplest multiplicative random complex matrix model generalizes the large-N phase structure found in the unitary case: A perturbative regime is joined to a nonperturbative regime at a point of nonanalyticity.
In this paper we obtained several properties that the characteristic polynomials of the unit-primitive matrix satisfy. In addition, using these properties we have shown that the recurrence relation given as in the formula (1) is true. In…
The iterative method of Sinkhorn allows, starting from an arbitrary real matrix with non-negative entries, to find a so-called 'scaled matrix' which is doubly stochastic, i.e. a matrix with all entries in the interval (0, 1) and with all…
We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. We study rate of convergence of recursive estimation procedures for the general…
We study processes with unstable particles in intermediate time-like states. It is shown that the amplitudes squared of such processes factor exactly in the framework of the model of unstable particles with continuous masses. Decay widths…
We propose a recursive method that makes use of the basic principle of unitarity to calculate the Landau singularities of n-point scattering amplitudes directly in kinematic space. For a vast class of Feynman diagrams, the method enables…
The classical sparse parameter identification methods are usually based on the iterative basis selection such as greedy algorithms, or the numerical optimization of regularized cost functions such as LASSO and Bayesian posterior probability…
A recursion formula is derived which allows to evaluate invariant integrals over the orthogonal group O(N), where the integrand is an arbitrary finite monomial in the matrix elements of the group. The value of such an integral is…
New approach to systems of polynomial recursions is developed based on the Carleman linearization procedure. The article is divided into two main sections: firstly, we focus on the case of uni-variable depth-one polynomial recurrences.…