Related papers: On relative OR-complexity of Boolean matrices and …
Convenient parameterizations of matrices in terms of vectors transform (certain classes of) matrix equations into covariant (hence rotation-invariant) vector equations. Certain recently introduced such parameterizations are tersely…
We describe the recursive algorithmic procedure to compute the stabilizers of the group of complex orthogonal matrices with respect to the action of similarity on the set of all symmetric matrices. Futhermore, lower bounds for dimensions of…
Boolean Satisfiability (SAT) problems are expressed as mathematical formulas. This paper presents a matrix representation for these SAT problems. It shows how to use this matrix representation to get the full set of valid satisfying…
Hybrid logic with binders is an expressive specification language. Its satisfiability problem is undecidable in general. If frames are restricted to N or general linear orders, then satisfiability is known to be decidable, but of…
We find the exact formula for the number of distinct $n \times n$ square patterns which appear in a Robinson tiling made of one infinite order supertile.
We use supersymmetry to calculate exact spectral densities for a class of complex random matrix models having the form $M=S+LXR$, where $X$ is a random noise part $X$ and $S,L,R$ are fixed structure parts. This is a certain version of the…
We provide explicit presentations of members of a suite of R matrices arising from the (\dot{0}_m|\alpha) representations of the quantum superalgebras U_q[gl(m|1)]. Our algorithm constructs both trigonometric and quantum R matrices; all of…
We present in this paper some fundamental tools for developing matrix analysis over the complex quaternion algebra. As applications, we consider generalized inverses, eigenvalues and eigenvectors, similarity, determinants of complex…
We study the differential and metric structures of the set of real square roots of a non-singular real matrix, under the assumption that the matrix and its square roots are semi-simple, or symmetric, or orthogonal.
We compute the double complex of smooth complex-valued differential forms on projective bundles over and blow-ups of compact complex manifolds up to a suitable notion of quasi-isomorphism. This simultaneously yields formulas for 'all'…
We provide direct elementary proofs of several explicit expressions for Bernoulli numbers and Bernoulli polynomials. As a byproduct of our method of proof, we provide natural definitions for generalized Bernoulli numbers and polynomials of…
We study the computational complexity of satisfiability problems for classes of simple finite height (ortho)complemented modular lattices $L$. For single finite $L$, these problems are shown tobe $\mc{NP}$-complete; for $L$ of height at…
There exists an exact relationship between the quasi-exactly solvable problems of quantum mechanics and models of square and rectangular random complex matrices. This relationship enables one to reduce the problem of constructing…
We survey results on the topological complexity of classical configuration spaces of distinct ordered points in orientable surfaces and related spaces, including certain orbit configuration spaces and Eilenberg-Mac Lane spaces associated to…
Differential systems with a Fuchsian linear part are studied in regions including all the singularities in the complex plane of these equations. Such systems are not necessarily analytically equivalent to their linear part (they are not…
We introduce higher simplicial complexity of a simplicial complex $K$ and higher combinatorial complexity of a finite space $P$ (i.e. $P$ is a finite poset). We relate higher simplicial complexity with higher topological complexity of $|K|$…
We give one more proof of the fact that symplectic matrices over real and complex fields have determinant one. While this has already been proved many times, there has been lasting interest in finding an elementary proof. Our result is…
On the product of a complex manifold $X$ by a complex curve $S$ considered as a parameter space, we show a Riemann-Hilbert correspondence between regular holonomic relative $\mathcal D$-modules (resp. complexes) on the one hand and relative…
This is an overview of recent developments regarding the complexity of matrix multiplication, with an emphasis on the uses of algebraic geometry and representation theory in complexity theory.
We consider matrix orthogonal polynomials related to Bessel type matrices of weights that can be defined in terms of a given matrix Pearson equation. From a Riemann-Hilbert problem we derive first and second order differential relations for…