相关论文: Remarks on the Cross Norm Criterion for Separabili…

We discuss the discriminating power of separability criteria, which are based on the spectrum of a quantum state and its reductions. Common examples are entropic inequalities utilizing conditional Tsallis or Renyi entropies. We prove that…

We study the problem of whether all bipartite quantum states having a prescribed spectrum remain positive under the reduction map applied to one subsystem. We provide necessary and sufficient conditions, in the form of a family of linear…

Disagreement between two classifiers regarding the class membership of an observation in pattern recognition can be indicative of an anomaly and its nuance. As in general classifiers base their decision on class aposteriori probabilities,…

Measuring inconsistency is viewed as an important issue related to handling inconsistencies. Good measures are supposed to satisfy a set of rational properties. However, defining sound properties is sometimes problematic. In this paper, we…

Model selection is a cornerstone of statistical inference, where information criteria are widely employed to balance model fit and complexity. However, classical likelihood-based criteria are often highly sensitive to contamination,…

In this paper, based on a matrix norm, we first present a ball of separable unnormalized states around the identity matrix for the bipartite quantum system, which is larger than the separable ball in Frobenius norm. Then the proposed ball…

For a complexity class $C$ and language $L$, a constructive separation of $L \notin C$ gives an efficient algorithm (also called a refuter) to find counterexamples (bad inputs) for every $C$-algorithm attempting to decide $L$. We study the…

The task of finding a criterion allowing to distinguish a text from an arbitrary set of words is rather relevant in itself, for instance, in the aspect of development of means for internet-content indexing or separating signals and noise in…

A (weak chord) index is a function on the crossings of knot diagrams such that: 1) the index of a crossing does not change under Reidemeister moves; 2) crossings which can be paired by a second Reidemeister move have the same index. We show…

We show, assuming weak large cardinals, that in the context of games played in a proper class of moves, clopen determinacy is strictly weaker than open determinacy. The proof amounts to an analysis of a certain level of $L$ that exists…

A new approach to disintegration of measures is presented, allowing one to drop the usually taken separability assumption. The main tool is a result on fibers in the spectrum of algebra of essentially bounded functions established recently…

Separating codes have their applications in collusion-secure fingerprinting for generic digital data, while they are also related to the other structures including hash family, intersection code and group testing. In this paper we study…

Formal explainability guarantees the rigor of computed explanations, and so it is paramount in domains where rigor is critical, including those deemed high-risk. Unfortunately, since its inception formal explainability has been hampered by…

Recently, the authors Khalil, R., Al Horani, M., Yousef. A. and Sababheh, M., in " A new Denition Of Fractional Derivative, J. Comput. Appl. Math. 264. pp. 6570, 2014. " introduced a new simple well-behaved definition of the fractional…

This research seeks to benefit the software engineering society by proposing comparative separation, a novel group fairness notion to evaluate the fairness of machine learning software on comparative judgment test data. Fairness issues have…

We prove a theorem on distortion of cross ratio of four points under the mapping effected by a complex polynomial with restricted critical values. Its corollaries include inequalities involving the absolute value and certain coefficients of…

This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…

We give separability criteria for general multi-qubit states in terms of diagonal and anti-diagonal entries. We define two numbers which are obtained from diagonal and anti-diagonal entries, respectively, and compare them to get criteria.…

The note clarifies a gap in the proof of the minimum distance for Projective Reed-Muller Codes. The gap was identified by S.Ghorpade and R.Ludhani in a recent article. Here the original thoughts are explained and the gap closed.

In this article, we consider the polynomials of the form $f(x)=a_0+a_1x+a_2x^2+\cdots+a_nx^n\in \mathbb{Z}[x],$ where $|a_0|=|a_1|+\dots+|a_n|$ and $|a_0|$ is a prime. We show that these polynomials have a cyclotomic factor whenever…