Related papers: Constructing Superregular Matrices
We consider the matrix model associated with pp-wave background and construct supersymmetric branes. In addition to the spherical membrane preserving 16 supersymmetries, one may construct rotating elliptic membranes preserving 8…
We have generalised the properties with the tensor product, of one 4x4 matrix which is a permutation matrix, and we call a tensor commutation matrix. Tensor commutation matrices can be constructed with or without calculus. A formula allows…
An explicit construction of theories of spinning particles, both massive and massless, is given with arbitrary extended supersymmetry on the world-line. As an application of our results, we give a universal description of 3D (and via…
The set of matrix tuples with invariant subspaces whose dimensions sum up to the dimension of the space, but which do not span the whole space form an algebraic hypersurface. We found the equation of this hypersurface. This generalizes…
We present a new method for constructing $D$-dimensional minimally superintegrable systems based on block coordinate separation of variables. We give two new families of superintegrable systems with $N$ ($N\leq D$) singular terms of the…
We systematically classify all possible poles of superconformal blocks as a function of the scaling dimension of intermediate operators, for all superconformal algebras in dimensions three and higher. This is done by working out the…
Over a decade ago, it was demonstrated that quantum computing has the potential to revolutionize numerical linear algebra by enabling algorithms with complexity superior to what is classically achievable, e.g., the seminal HHL algorithm for…
We give a precise definition of mutation of skew symmetrizable matrices over group rings and relate it to folding and mutation of quivers with symmetries. These matrices can have non-zero diagonal entries and we explain a mutation rule in…
This paper concerns non-overlapping codes, block codes motivated by synchronisation and DNA-based storage applications. Most existing constructions of these codes do not account for the restrictions posed by the physical properties of…
We investigate supersymmetric tubular configurations in the matrix theory. We construct a host of BPS configurations of eight supersymmetries. They can be regarded as cylindrical D2 branes carrying nonvanishing angular momentum. For the…
We analyze general structure of N-fold supersymmetry which provides a systematic framework to construct weakly quasi-solvable quantum mechanical systems. Main ingredients of our analysis are dimensional analysis and introduction of an…
For real application and theoretical investigation of ordinary hypergraphs and non-ordinary hypergraphs, researchers need to establish standard rules and feasible operating methods. We propose a visualization tool for investigating…
We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…
In this paper we investigate the possible supersymmetric extensions for the massive (bi)gravity theories in the lowest non-trivial order. For this purpose we construct the cubic interaction vertices for massive spin-2 and one or two massive…
Design matrices are sparse matrices in which the supports of different columns intersect in a few positions. Such matrices come up naturally when studying problems involving point sets with many collinear triples. In this work we consider…
We demonstrate formation of hierarchical structures in two-dimensional systems with multiple length scales in the inter-particle interaction. These include states such as clusters of clusters, concentric rings, clusters inside a ring, and…
Conference matrices are used to define complex structures on real vector spaces. Certain lattices in these spaces become modules for rings of quadratic integers. Multiplication of these lattices by non-principal ideals yields simple…
In this paper, we investigate the Krein space numerical range of $2$-by-$2$ block matrices, with diagonal blocks as scalar multiples of the identity. For these matrices, we specifically investigate the cases when the respective boundary…
We introduce a new family of strong linearizations of matrix polynomials---which we call "block Kronecker pencils"---and perform a backward stability analysis of complete polynomial eigenproblems. These problems are solved by applying any…
For positive semi-definite block-matrix $M,$ we say that $M$ is P.S.D. and we write $M=\begin{pmatrix} A \& X\\ {X^*} \& B\end{pmatrix} \in {\mathbb{M}}\_{n+m}^+$, with $A\in {\mathbb{M}}\_n^+$, $B \in {\mathbb{M}}\_m^+.$ The focus is on…