Related papers: On relative OR-complexity of Boolean matrices and …
We prove an equivalence of categories from formal complex structures with formal holomorphic maps to homotopy algebras over a simple operad with its associated homotopy morphisms. We extend this equivalence to complex manifolds. A complex…
In this paper, we determine the complexity of the satisfiability problem for various logics obtained by adding numerical quantifiers, and other constructions, to the traditional syllogistic. In addition, we demonstrate the incompleteness of…
Convex polyhedra are the basis for several abstractions used in static analysis and computer-aided verification of complex and sometimes mission critical systems. For such applications, the identification of an appropriate…
We investigate invertible matrices over finite additively idempotent semirings. The main result provides a criterion for the invertibility of such matrices. We also give a construction of the inverse matrix and a formula for the number of…
We solve the difference equation with linear coefficients by the Momentenansatz to obtain explicit formulas for orthogonal polynomials.
A real symmetric n times n matrix is called copositive if the corresponding quadratic form is non-negative on the closed first orthant. If the matrix fails to be copositive there exists some non-negative certificate for which the quadratic…
Matrices over the ring of formal power series are considered. Normal forms with respect to various sub-groups of the two-sided transformations are constructed. The construction is based on the special property of the action: it induces a…
For given real or complex $m \times n$ data matrices $X$, $Y$, we investigate when there is a matrix $A$ such that $AX = Y$, and $A$ is invertible, Hermitian, positive (semi)definite, unitary, an orthogonal projection, a reflection, complex…
The structured pseudospectra of a matrix A are sets of complex numbers that are eigenvalues of matrices X which are near to A and have the same entries as A at a fixed set of places. The sum of multiplicities of the eigenvalues of X inside…
We derive exact matrix integral representations for different sums over partitions. The characteristic feature of all obtained matrix models is the presence of logarithmic (or, vice versa, exponential) terms in the potential. Our derivation…
Based on [1], we study the complexity of horizontality in each twistor space $\hat{E}_{\varepsilon}$ associated with an oriented vector bundle $E$ of rank $4$ with a positive-definite metric over the $2$-torus $T^2$, and obtain…
We give an explicit description of the poset of cells of Bergman complexes of Lattice Path Matroids and establish a criterion for its simpliciality, in terms of the shape of the bounding paths.
A P-matrix is a square matrix $X$ such that all principal submatrices of $X$ have positive determinant. Such matrices appear naturally in instances of the linear complementarity problem, where these are precisely the matrices for which the…
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the probabilistic quantum class BQP. 1. BQP is low for PP, i.e.,…
In this paper, we present some applications of quaternions and octonions. We present the real matrix representations for complex octonions and some of their properties which can be used in computations where these elements are involved.…
We study the structure of the algebra of polynomial invariants for the usual conjugation action of the complex special, SO_n, and general, O_n, orthogonal group on the space of traceless n by n complex matrices. (Note that these two…
Given a polytopal complex $X$, we examine the topological complement of its $k$-skeleton. We construct a long exact sequence relating the homologies of the skeleton complements and links of faces in $X$, and using this long exact sequence,…
We present a constructive SAT-based algorithm to determine the multiplicative complexity of a Boolean function, i.e., the smallest number of AND gates in any logic network that consists of 2-input AND gates, 2-input XOR gates, and…
We establish an explicit quasi-isomophism of complexes, which is homogeneous in graded situation, from a given Cech complex of modules of generalized fractions.
Special orthogonal matrices with rational elements form the group SO(n,Q), where Q is the field of rational numbers. A theorem describing the structure of an arbitrary matrix from this group is proved. This theorem yields an algorithm for…