相关论文: Hidden Structure in the Solutions Set of the N Que…

We propose an unexpected twist to description of the geometry and topology of configurations of n straight lines considered as a whole 3D entity (because the lines are inseparably linked pairwise while having linking numbers 1/2 or -1/2)…

Finding hidden layers in complex networks is an important and a non-trivial problem in modern science. We explore the framework of quantum graphs to determine whether concealed parts of a multi-layer system exist and if so then what is…

Given any finite set of nonnegative integers, there exists a closed convex set whose facial dimension signature coincides with this set of integers, that is, the dimensions of its nonempty faces comprise exactly this set of integers. In…

In this work, new closed-form formulas for the matrix exponential are provided. Our method is direct and elementary, it gives tractable and manageable formulas not current in the extensive literature on this essential subject. Moreover,…

We report a simplification in the large N matrix mechanics of light-cone matrix field theories. The absence of pure creation or pure annihilation terms in the Hamiltonian formulation of these theories allows us to find their reduced large N…

We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…

Polynomials which afford nonnegative, real-rooted symmetric decompositions have been investigated recently in algebraic, enumerative and geometric combinatorics. Br\"and\'en and Solus have given sufficient conditions under which the image…

We present a mapping which associates pure N-qubit states with a polynomial. The roots of the polynomial characterize the state completely. Using the properties of the polynomial we construct a way to determine the separability and the…

We explore the connection between the area law for entanglement and geometry by representing the entanglement entropies corresponding to all $2^N$ bipartitions of an $N$-party pure quantum system by means of a (generalized) adjacency…

One matrix structure in the area of monotone Boolean functions is defined here. Some of its combinatorial, algebraic and algorithmic properties are derived. On the base of these properties, three algorithms are built. First of them…

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

We consider new polynomially solvable cases of the well-known Quadratic Assignment Problem involving coefficient matrices with a special diagonal structure. By combining the new special cases with polynomially solvable special cases known…

In this note devoted to some aspects of the inverse problem of representation theory the attention is concentrated on the interrelations between various algebraic structures (algebras with operators) unraveled by different solutions of the…

Quantum computers can potentially solve problems that are computationally intractable on a classical computer in polynomial time using quantum-mechanical effects such as superposition and entanglement. The N-Queens Problem is a notable…

This paper concerns matrix decompositions in which the factors are restricted to lie in a closed subvariety of a matrix group. Such decompositions are of relevance in control theory: given a target matrix in the group, can it be decomposed…

Sets of $d\times d$ matrices sharing a common invariant cone enjoy special properties, which are widely used in applications. However, finding this cone or even proving its existence/non-existence is hard. This problem is known to be…

In this paper, a linear univariate representation for the roots of a zero-dimensional polynomial equation system is presented, where the roots of the equation system are represented as linear combinations of roots of several univariate…

A new class of integrable mappings and chains is introduced. Corresponding $(1+2)$ integrable systems invariant with respect to such discrete transformations are presented in an explicit form. Their soliton-type solutions are constructed in…

We analyse the problem of solving Boolean equation systems through the use of structure graphs. The latter are obtained through an elegant set of Plotkin-style deduction rules. Our main contribution is that we show that equation systems…

For bivariate polynomials of degree $n\le 5$ we give fast numerical constructions of determinantal representations with $n\times n$ matrices. Unlike some other available constructions, our approach returns matrices of the smallest possible…