Related papers: Block diagonalizing ultrametric matrices
We present a recursive way to partition hypergraphs which creates and exploits hypergraph geometry and is suitable for many-core parallel architectures. Such partitionings are then used to bring sparse matrices in a recursive Bordered Block…
We examine unification of gauge couplings in four dimensional renormalizable gauge theories inspired by the latticized (deconstructed) SM or MSSM in five dimensions. The models are based on replicated gauge groups, spontaneously broken to…
The randomized Kaczmarz method is an iterative algorithm that solves overdetermined systems of linear equations. Recently, the method was extended to systems of equalities and inequalities by Leventhal and Lewis. Even more recently, Needell…
Firstly, we give a partial solution to the isomorphism problem for uniserial modules of finite length with the help of the morphisms between these modules over an arbitrary ring. Later, under suitable assumptions on the lattice of the…
Tensor diagonalization means transforming a given tensor to an exactly or nearly diagonal form through multiplying the tensor by non-orthogonal invertible matrices along selected dimensions of the tensor. It is generalization of approximate…
The PMNS matrix displays an obvious symmetry, but not exact. There are several textures proposed in literature, which possess various symmetry patterns and seem to originate from different physics scenarios at high energy scales. To be…
Ultrametric matrices have a rich structure that is not apparent from their definition. Notably, the subclass of strictly ultrametric matrices are covariance matrices of certain weighted rooted binary trees. In applications, these matrices…
We consider the problem of determining which matrices are permutable to be supmodular. We show that for small dimensions any matrix is permutable by a universal permutation or by a pair of permutations, while for higher dimensions no…
Random matrix models based on an integral over supermatrices are proposed as a natural extension of bosonic matrix models. The subtle nature of superspace integration allows these models to have very different properties from the analogous…
A sequence of large invertible matrices given by a small random perturbation around a fixed diagonal and positive matrix induces a random dynamics on a high-dimensional sphere. For a certain class of rotationally invariant random…
Using parafermionic field theoretical methods, the fundamentals of 2d fractional supersymmetry ${\bf Q}^{K} =P$ are set up. Known difficulties induced by methods based on the $U_{q}(sl(2))$ quantum group representations and non commutative…
A basic problem in linear particle optics is to find a symplectic transformation that brings the (symmetric) beam matrix to a special diagonal form, called normal form. The conventional way to do this involves an eigenvalue-decomposition of…
Matrix models have wide applications in nuclear theory, condensed matter theory and quantum field theory. I discuss supersymmetric extensions of matrix models and their applications to branched polymers, the meander problem, and…
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…
We parallelize density-matrix renormalization group to directly extend it to 2-dimensional ($n$-leg) quantum lattice models. The parallelization is made mainly on the exact diagonalization for the superblock Hamiltonian since the part…
This paper studies the problem of reconstructing binary matrices that are only accessible through few evaluations of their discrete X-rays. Such question is prominently motivated by the demand in material science for developing a tool for…
Under the assumption that all the gauge groups in supersymmetric theories unify at the fundamental scale, the numbers and the mass scales of messenger quarks and leptons, as well as the beta-function coefficient of the sector for dynamical…
In this paper, we give a complete self-contained proof that the rigidity matrix of a symmetric bar and joint framework (as well as its transpose) can be transformed into a block-diagonalized form using techniques from group representation…
The paper considers the convergence of the complex block Jacobi diagonalization methods under the large set of the generalized serial pivot strategies. The global convergence of the block methods for Hermitian, normal and $J$-Hermitian…
The problem of diagonalizing hermitian matrices of continuous fiunctions was studied by Grove and Pederson in 1984. While diagonalization is not possible in general, in the presence of differentiability conditions we are able to obtain…