Related papers: Algebraic Equations in State Condition
Criteria for an algebraic operator $T$ on a complex Hilbert space $\mathcal{H}$ to be unitary are established. The main one is written in terms of the convergence of sequences of the form $\{\|T^nh\|\}_{n=0}^{\infty}$ with $h\in…
The paper deals with the {\it infinitesimal Hilbert 16th problem}: to find an upper estimate of the number of zeros of an Abelian integral regarded as a function of a parameter. In more details, consider a real polynomial $ H$ of degree $…
While 3-SAT is NP-hard, 2-SAT is solvable in polynomial time. Austrin, Guruswami, and H\r{a}stad roved a result known as "$(2+\varepsilon)$-SAT is NP-hard" [FOCS'14/SICOMP'17]. They showed that the problem of distinguishing k-CNF formulas…
It is known that the partial entanglement/separability violates distributive rules with respect to the operations of taking convex hull and intersection. In this note, we give criteria for three qubit partially entangled states arising from…
We give a method for verifying, by a symbolic calculation, the stability or semistability with respect to a linearization of fixed, possibly small, degree $m$, of the Hilbert point of a scheme $X \in {\mathbb P}(V)$ having a suitably large…
Understanding the nature of multipartite entanglement is a central mission of quantum information theory. To this end, we investigate the question of tripartite entanglement convertibility. We find that there exists no easy criterion to…
The reduction criterion is a well known necessary condition for separable states, and states violating this condition are entangled and also 1-distillable. In this paper we introduce a new set of necessary conditions for separability of…
Number partitioning is an NP-complete problem of combinatorial optimization. A statistical mechanics analysis reveals the existence of a phase transition that separates the easy from the hard to solve instances and that reflects the…
We give necessary conditions for the mixing problem in bipartite case, which are independent of eigenvalues and based on algebraic-geometric invariants of the bipartite states. One implication of our results is that for some special…
Semi-linear elliptic boundary problems with non-linearities of product type are considered, in particular the stationary Navier--Stokes equations. Regularity and existence results are dealt with in the Besov and Triebel--Lizorkin spaces,…
Weighted independent domination is an NP-hard graph problem, which remains computationally intractable in many restricted graph classes. In particular, the problem is NP-hard in the classes of sat-graphs and chordal graphs. We strengthen…
We investigate the algebraic structure of a recently proposed integrable $t-J$ model with impurities. Three forms of the Bethe ansatz equations are presented corresponding to the three choices for the grading. We prove that the Bethe ansatz…
A graph $G$ is embeddable in $\mathbb{R}^d$ if vertices of $G$ can be assigned with points of $\mathbb{R}^d$ in such a way that all pairs of adjacent vertices are at the distance 1. We show that verifying embeddability of a given graph in…
The critical point between varieties A and B of algebras is defined as the least cardinality of the semilattice of compact congruences of a member of A but of no member of B, if it exists. The study of critical points gives rise to a whole…
We consider the problem of deciding whether a polygonal knot in 3-dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that it lies in a plane. We show that this problem, {\sc…
Under certain conditions, we give an estimate from above on the number of differential equations of order $r+1$ with prescribed regular singular points, prescribed exponents at singular points, and having a quasi-polynomial flag of…
Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of…
The hypercube 2-segmentation problem is a certain biclustering problem that was previously claimed to be NP-hard, but for which there does not appear to be a publicly available proof of NP-hardness. This manuscript provides such a proof.
Let $\mathcal{A}$ be an operator algebra on a Hilbert space. We say that an element $G\in {\mathcal{A}}$ is an all-derivable point of ${\mathcal{A}}$ if every derivable linear mapping $\phi$ at $G$ (i.e. $\phi(ST)=\phi(S)T+S\phi(T)$ for any…
Holant problem is a general framework to study the computational complexity of counting problems. We prove a complexity dichotomy theorem for Holant problems over Boolean domain with non-negative weights. It is the first complete Holant…