English
Related papers

Related papers: On Separation of Variables

200 papers

The essential variables in a finite function $f$ are defined as variables which occur in $f$ and weigh with the values of that function. The number of essential variables is an important measure of complexity for discrete functions. When…

Computational Complexity · Computer Science 2015-01-05 Sl. Shtrakov , I. Damyanov

The main result of this paper shows a totally new necessary and sufficient condition to determine both real and complex zeros of derivative of all entire and meromorphic functions of one complex variable in the extended complex plane. By…

Complex Variables · Mathematics 2022-04-01 ZhaoKun Ma , Lande Ma

In mathematical economics, the used functions are, in general, considered to be quasiconcave. Moreover, they are, in many cases, separable of nature. It is known that a local maximum of a quasiconcave function is not, in general, a global…

Optimization and Control · Mathematics 2021-01-14 Mohammed Berdi , Mohammed Amine Abouchouar , Abdelhak Hassouni

In this paper, we give out some effective criterions which can be used to judge the separability of multipartite pure states. We obtain the relationship between separability and Schmidt decomposable of multipartite pure states in Theorem1.…

Quantum Physics · Physics 2007-05-23 Zongwen Yu , Su Hu

We show that a polynomial equation of degree less than 5 and with real parameters can be solved by regarding the variable in which the polynomial depends as a complex variable. For do it so, we only have to separate the real and imaginary…

General Mathematics · Mathematics 2012-01-05 Ricardo S. Vieira

We show that all density operators of 2$\times N$--dimensional quantum systems that remain invariant after partial transposition with respect to the first system are separable. Based on this criterion, we derive a sufficient separability…

Quantum Physics · Physics 2007-05-23 M. Lewenstein , J. I. Cirac , S. Karnas

In 1954 it was proved if f is infinitely differentiable in the interval I and some derivative (of order depending on x) vanishes at each x, then f is a polynomial. Later it was generalized for multi-variable case. In this paper we give an…

Analysis of PDEs · Mathematics 2014-07-23 V. E. S. Szabo

We derive necessary conditions in terms of the variances of position and momentum linear combinations for all kinds of separability of a multi-party multi-mode continuous-variable state. Their violations can be sufficient for genuine…

Quantum Physics · Physics 2009-11-07 Peter van Loock , Akira Furusawa

We give necessary and sufficient conditions under which a density matrix acting on a two-fold tensor product space is separable. Our conditions are given in terms of quantum conditional information transmission.

Quantum Physics · Physics 2016-09-08 Robert R. Tucci

Using a generalization of forward elimination, it is proved that functions $f_1,...,f_n:X\to\mathbb{A}$, where $\mathbb{A}$ is a field, are linearly independent if and only if there exists a nonsingular matrix $[f_i(x_j)]$ of size $n$,…

History and Overview · Mathematics 2009-05-22 Iouri V. Romanovski

We reconsider density matrices of graphs as defined in [quant-ph/0406165]. The density matrix of a graph is the combinatorial laplacian of the graph normalized to have unit trace. We describe a simple combinatorial condition (the "degree…

Let F be a homogeneous real polynomial of even degree in any number of variables. We consider the problem of giving explicit conditions on the coefficients so that F is positive definite or positive semi-definite. In this note we produce a…

Algebraic Geometry · Mathematics 2007-05-23 Fernando Cukierman

It is shown that separation conditions (separation curves) are fundamental objects of separability theory. They are used for the classification of certain clases of separable systems, for the proof of bi-Hamiltonian property and finally…

Exactly Solvable and Integrable Systems · Physics 2009-02-04 Maciej Blaszak

The classical decision problem, as it is understood today, is the quest for a delineation between the decidable and the undecidable parts of first-order logic based on elegant syntactic criteria. In this paper, we treat the concept of…

Logic in Computer Science · Computer Science 2019-11-27 Marco Voigt

Simple necessary and sufficient conditions for a $n$-tuple of noncommutative polynomials to be a cyclic gradient are given and similarly for a noncommutative polynomial to have a vanishing cyclic gradient. Connections with free probability…

Rings and Algebras · Mathematics 2007-05-23 Dan Voiculescu

Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…

Mathematical Physics · Physics 2011-09-27 H. Azad , A. Laradji , M. T. Mustafa

For fragments L of first-order logic (FO) with counting quantifiers, we consider the definability problem, which asks whether a given L-formula can be equivalently expressed by a formula in some fragment of L without counting, and the more…

Logic in Computer Science · Computer Science 2025-08-18 Louwe Kuijer , Tony Tan , Frank Wolter , Michael Zakharyaschev

How to handle division in systems that compute with logical formulas involving what would otherwise be polynomial constraints over the real numbers is a surprisingly difficult question. This paper argues that existing approaches from both…

Symbolic Computation · Computer Science 2024-12-03 Christopher W. Brown

The problem of identifiability of finite mixtures of finite product measures is studied. A mixture model with $K$ mixture components and $L$ observed variables is considered, where each variable takes its value in a finite set with…

Statistics Theory · Mathematics 2018-07-17 Behrooz Tahmasebi , Seyed Abolfazl Motahari , Mohammad Ali Maddah-Ali

We prove general results about separation and weak$^\#$-convergence of boundedly finite measures on separable metric spaces and Souslin spaces. More precisely, we consider an algebra of bounded real-valued, or more generally a $*$-algebra…

Probability · Mathematics 2016-09-12 Wolfgang Löhr , Thomas Rippl