Related papers: A computing strategy and programs to resolve the G…

This paper aims at solving the Hermitian SDC problem, i.e., that of \textit{simultaneously diagonalizing via $*$-congruence} a collection of finitely many (not need pairwise commute) Hermitian matrices. Theoretically, we provide some…

We extend the BFSS matrix theory by means of Lie 3-algebra. The extended model possesses the same supersymmetry as the original BFSS matrix theory, and thus as the infinite momentum frame limit of M-theory. We study dynamics of the model by…

There are two well known types of algorithms for solving CSPs: local propagation and generating a basis of the solution space. For several years the focus of the CSP research has been on `hybrid' algorithms that somehow combine the two…

Many fundamental questions in theoretical computer science are naturally expressed as special cases of the following problem: Let $G$ be a complex reductive group, let $V$ be a $G$-module, and let $v,w$ be elements of $V$. Determine if $w$…

In 1963 [Ann. of Math. {\bf 78}, 267-288], Gerstenhaber invented a \emph{comp(osition)} calculus in the Hochschild complex of an associative algebra. In this paper, the first steps of the Gerstenhaber theory are exposed in an abstract (comp…

A semiclassical approach to the calculation of transport moments $M_m={\rm Tr}[(t^\dag t)^m]$, where $t$ is the transmission matrix, was developed in [M. Novaes, Europhys. Lett. 98, 20006 (2012)] for chaotic cavities with two leads and…

A recursive method is given for finding generating functions which enumerate rooted hypermaps by number of vertices, edges and faces for any given number of darts. It makes use of matrix-integral expressions arising from the study of…

Suppose $F$ is an infinite field and let $f \in F\{X_1, \dots,X_m\}$ be a noncommutative polynomial. Partially answering a query of Makar-Limanov, we show that there are numbers $d$ and $m'$ such that, if $F$ is closed under taking $d$th…

We give two algorithms for output-sparse matrix multiplication (OSMM), the problem of multiplying two $n \times n$ matrices $A, B$ when their product $AB$ is promised to have at most $O(n^{\delta})$ many non-zero entries for a given value…

Any simple Lie superalgebras over the complex field can be constructed from some triple systems. Examples of Lie superalgebras $D(2,1;\alpha)$, G(3) and F(4) are given by utilizing a general construction method based upon $(-1,-1)$ balanced…

We give explicit low-rank bilinear non-commutative schemes for multiplying structured $n \times n$ matrices with $2 \leq n \leq 5$, which serve as building blocks for recursive algorithms with improved multiplicative factors in asymptotic…

Let $\mathbb{F}_q$ be a finite field. Given two irreducible polynomials $f,g$ over $\mathbb{F}_q$, with $\mathrm{deg} f$ dividing $\mathrm{deg} g$, the finite field embedding problem asks to compute an explicit description of a field…

In this paper, we extend our previous work on the power series method for computing backstepping kernels. Our first contribution is the development of initial steps towards a MATLAB toolbox dedicated to backstepping kernel computation. This…

We construct a solution to pentagon equation with anticommuting variables living on two-dimensional faces of tetrahedra. In this solution, matrix coordinates are ascribed to tetrahedron vertices. As matrix multiplication is noncommutative,…

We give a quantum algorithm for solving a shifted multiplicative character problem over Z/nZ and finite fields. We show that the algorithm can be interpreted as a matrix factorization or as solving a deconvolution problem and give…

We show the failure of a matricial version of Grothendieck's theorem for operator spaces, thereby resolving a long-standing open question in the field. Moreover, by showing that such a counterexample can occur in the simplest context of…

It is a notorious open question whether integer programs (IPs), with an integer coefficient matrix $M$ whose subdeterminants are all bounded by a constant $\Delta$ in absolute value, can be solved in polynomial time. We answer this question…

A MATLAB program for computing differentiation matrices for arbitrary one-dimensional meshes is presented in this manuscript. The differentiation matrices for a mesh of N arbitrarily spaced points are formed from those obtained using…

This paper resolves an open problem raised by Ekhad and Zeilberger for computing $\omega(10000)$, which is related to Stern's triangle. While $\nu(n)$, defined as the sum of squared coefficients in $\prod_{i=0}^{n-1} (1 + x^{2^i} +…

A manifestly Lorentz-covariant calculus based on two matrix-coordinates and their associated derivatives is introduced. It allows formulating relativistic field theories in any even-dimensional spacetime. The construction extends a…