S-matrix bootstrap and non-invertible symmetries [PDF]
We initiate the S-matrix bootstrap analysis of theories with non-invertible symmetries in (1+1) dimensions. Our previous work [1] showed that crossing symmetry of S-matrices in such theories is modified, with modification characterized by the fusion ...
Christian Copetti+2 more
doaj +7 more sources
An Enhanced Numerical Iterative Method for Expanding the Attraction Basins When Computing Matrix Signs of Invertible Matrices [PDF]
The computation of the sign function of a matrix plays a crucial role in various mathematical applications. It provides a matrix-valued mapping that determines the sign of each eigenvalue of a nonsingular matrix.
Lei Shi+4 more
doaj +3 more sources
Two invertible networks for the matrix element method [PDF]
The matrix element method is widely considered the ultimate LHC inference tool for small event numbers. We show how a combination of two conditional generative neural networks encodes the QCD radiation and detector effects without any simplifying ...
Anja Butter, Theo Heimel, Till Martini, Sascha Peitzsch, Tilman Plehn
doaj +4 more sources
Matrix Mappings on the Domains of Invertible Matrices [PDF]
We focus on sequence spaces which are matrix domains of Banach sequence spaces. We show that the characterization of a random matrix operator , where and are matrix domains with invertible matrices and , can be reduced to the characterization of the ...
Muhammed Altun
doaj +3 more sources
Remarks on the Cayley Representation of Orthogonal Matrices and on Perturbing the Diagonal of a Matrix to Make it Invertible [PDF]
This note contains two remarks. The first remark concerns the extension of the well-known Cayley representation of rotation matrices by skew symmetric matrices to rotation matrices admitting -1 as an eigenvalue and then to all orthogonal matrices.
Gallier, Jean
core +3 more sources
Characterizations of the group invertibility of a matrix revisited
A square complex matrix AA is said to be group invertible if there exists a matrix XX such that AXA=AAXA=A, XAX=XXAX=X, and AX=XAAX=XA hold, and such a matrix XX is called the group inverse of AA.
Tian Yongge
doaj +2 more sources
An optimum partition for inverting a nonsingular matrix [PDF]
AbstractA new strategy for inverting a nonsingular matrix is evaluated in this paper. The essential concept of this strategy is to partition a nonsingular matrix into blocks, then to apply the author's decomposition to the block-based procedure. Since different partitions require different costs, finding an economical partition is necessary. This paper
Jenn‐Ching Luo
openalex +2 more sources
On the invertibility of a nearly singular matrix
AbstractLet z be a complex variable and let A and B be constant n × n matrices with complex elements. It is shown that A + zB is invertible for all z in a deleted neighborhood of zero if and only if there exist constant n × n matrices such that XA + YB = I and AX + BY = I.
C. E. Langenhop
openalex +3 more sources
Efficient recursion method for inverting an overlap matrix [PDF]
A new O(N) algorithm based on a recursion method, in which the computational effort is proportional to the number of atoms N, is presented for calculating the inverse of an overlap matrix which is needed in electronic structure calculations with the the non-orthogonal localized basis set. This efficient inverting method can be incorporated in several O(
Taisuke Ozaki
openalex +4 more sources
Stationarity and invertibility of a dynamic correlation matrix [PDF]
One of the most widely-used multivariate conditional volatility models is the dynamic conditional correlation (or DCC) specification. However, the underlying stochastic process to derive DCC has not yet been established, which has made problematic the derivation of asymptotic properties of the Quasi-Maximum Likelihood Estimators (QMLE).
Michael McAleer
openalex +6 more sources