Related papers: The Iris function and the matrix permanent
The determinant of an $N \times N$ circulant matrix $M = {\rm CIRC}[x_0, x_1, ..., x_{N-1}$] can be expanded in the form det$ ~M= \sum C_{a_0 a_1 ...a_{N-1}} x_{a_0} x_{a_1}...x_{a_{N-1}}$. By using the generating function of a restricted,…
The book is devoted to investigation of arithmetic of the matrix rings over certain classes of commutative finitely generated principal ideals domains. We mainly concentrate on constructing of the matrix factorization theory. We reveal a…
This paper studies a general class of Iterated Function Systems (IFS). No contractivity assumptions are made, other than the existence of some compact attractor. The possibility of escape to infinity is considered. Our present approach is…
The rigidity of a matrix A for target rank r is the minimum number of entries of A that must be changed to ensure that the rank of the altered matrix is at most r. Since its introduction by Valiant (1977), rigidity and similar…
We continue the analysis in [3] of matrix convex functions of a fixed order defined in a real interval by differential methods as opposed to the characterization in terms of divided differences given by Kraus [5]. We amend and improve some…
We implement an efficient method of computation of two dimensional Fourier-type integrals based on approximation of the integrand by Gaussian radial basis functions, which constitute a standard tool in approximation theory. As a result, we…
Linear algebra's main concerns are sets of vectors, linear functions, subspaces, linear systems, matrices and concepts about those, such as whether the solution of linear system exists or is unique; a set of vectors is linearly independent…
We study the moments of equilibrium measures for iterated function systems (IFSs) and draw connections to operator theory. Our main object of study is the infinite matrix which encodes all the moment data of a Borel measure on R^d or C. To…
We introduce symmetric arithmetic circuits, i.e. arithmetic circuits with a natural symmetry restriction. In the context of circuits computing polynomials defined on a matrix of variables, such as the determinant or the permanent, the…
We present a closed form expression for the information matrix associated with the Wiener model identification problem under the assumption that the input signal is a stationary Gaussian process. This expression holds under quite generic…
In this manuscript, the authors derive closed formula for definite integrals of combinations of powers and logarithmic functions of complicated arguments and express these integrals in terms of the Hurwitz zeta. These derivations are then…
Expressions involving the product of the permanent with the (n-1)th power of the determinant of a matrix of indeterminates, and of (0,1)-matrices, are shown to be related to two conjectures that extend the Alon-Tarsi Latin square conjecture…
The connection between matrix integrals and links is used to define matrix models which count alternating tangles in which each closed loop is weighted with a factor n, i.e. may be regarded as decorated with n possible colors. For n=2, the…
We provide a systematic formula, in terms of integer partitions, that generates perturbation theory explicitly at an arbitrary order. Our approach naturally includes an infinite number of perturbations and uses a single matrix equation that…
A Riordan array is defined by its production matrix. In this paper, we explore the notion of the second production matrix of a Riordan array, characterizing the matrix that is generated by it. We indicate how this procedure can be…
We obtain an asymptotic formula for the number of integer $2\times 2$ matrices that have determinant $\Delta$ and whose absolute values of the entries are at most $H$. The result holds uniformly for a large range of $\Delta$ with respect to…
Studies of density matrices for random quantum states lead naturally to the fixed trace Laguerre ensemble in random matrix theory. Previous studies have uncovered explicit rational function formulas for moments of purity statistic (trace of…
An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.
Iterative refinement (IR) is a popular scheme for solving a linear system of equations based on gradually improving the accuracy of an initial approximation. Originally developed to improve upon the accuracy of Gaussian elimination,…
Weingarten functions provide a tool for computing Haar measure matrix integrals of polynomials in the matrix entries. An important property of Weingarten functions, is their particularly simple large $N$ limits. In 2017 Benoit Collins and…