اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدExact recursive calculation of circulant permanents: A band of different diagonals inside a uniform matrix
84
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence relations which is based on the permanents of the matrices with defects. The proposed system of linear recurrence equations with variable coefficients provides a powerful tool for the analysis of the circulant permanents, their fast, linear time computing and finding their asymptotics in a large-matrix-size limit. The latter problem is an open fundamental problem. Its solution would be tremendously important for a unified analysis of a wide range of the natures #P-hard problems, including problems in the physics of many-body systems, critical phenomena, quantum computing, quantum field theory, theory of chaos, fractals, theory of graphs, number theory, combinatorics, cryptography, etc.
قيم البحث
اقرأ أيضاً
For a classical system of noninteracting particles we establish recursive integral equations for the density of states on the microcanonical ensemble. The recursion can be either on the number of particles or on the dimension of the system. The solut
ion of the integral equations is particularly simple when the single-particle density of states in one dimension follows a power law. Otherwise it can be obtained using a Laplace transform method. Since the Laplace transform of the microcanonical density of states is the canonical partition function, it factorizes for a system of noninteracting particles and the solution of the problem is straightforward. The results are illustrated on several classical examples.
We demonstrate that the exact non-equilibrium steady state of the one-dimensional Heisenberg XXZ spin chain driven by boundary Lindblad operators can be constructed explicitly with a matrix product ansatz for the non-equilibrium density matrix where
the matrices satisfy a {it quadratic algebra}. This algebra turns out to be related to the quantum algebra $U_q[SU(2)]$. Coherent state techniques are introduced for the exact solution of the isotropic Heisenberg chain with and without quantum boundary fields and Lindblad terms that correspond to two different completely polarized boundary states. We show that this boundary twist leads to non-vanishing stationary currents of all spin components. Our results suggest that the matrix product ansatz can be extended to more general quantum systems kept far from equilibrium by Lindblad boundary terms.
The uniform recursive tree (URT) is one of the most important models and has been successfully applied to many fields. Here we study exactly the topological characteristics and spectral properties of the Laplacian matrix of a deterministic uniform re
cursive tree, which is a deterministic version of URT. Firstly, from the perspective of complex networks, we determine the main structural characteristics of the deterministic tree. The obtained vigorous results show that the network has an exponential degree distribution, small average path length, power-law distribution of node betweenness, and positive degree-degree correlations. Then we determine the complete Laplacian spectra (eigenvalues) and their corresponding eigenvectors of the considered graph. Interestingly, all the Laplacian eigenvalues are distinct.
Using the matrix product ansatz, we obtain solutions of the steady-state distribution of the two-species open one-dimensional zero range process. Our solution is based on a conventionally employed constraint on the hop rates, which eventually allows
us to simplify the constituent matrices of the ansatz. It is shown that the matrix at each site is given by the tensor product of two sets of matrices and the steady-state distribution assumes an inhomogeneous factorized form. Our method can be generalized to the cases of more than two species of particles.
The mutual information of a single-layer perceptron with $N$ Gaussian inputs and $P$ deterministic binary outputs is studied by numerical simulations. The relevant parameters of the problem are the ratio between the number of output and input units,
$alpha = P/N$, and those describing the two-point correlations between inputs. The main motivation of this work refers to the comparison between the replica computation of the mutual information and an analytical solution valid up to $alpha sim O(1)$. The most relevant results are: (1) the simulation supports the validity of the analytical prediction, and (2) it also verifies a previously proposed conjecture that the replica solution interpolates well between large and small values of $alpha$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
