English
Related papers

Related papers: A characterization theorem for matrix variances

200 papers

In this paper, we provide an algebraic condition on any $2n \times 2n$ real symmetric positive definite matrix which is necessary and sufficient for the matrix to be diagonalized by an orthosymplectic matrix in the sense of Williamson's…

Functional Analysis · Mathematics 2024-03-22 Hemant K. Mishra

Necessary and sufficient conditions are given for the existence of extended Schmidt decompositions, with more than two subspaces.

Quantum Physics · Physics 2009-10-28 Asher Peres

We study determinantal varieties from conditional independence models with hidden variables, focusing on their irreducible decompositions, dimensions, degrees, and Gr\"obner bases. Each variety encodes a collection of matroids, whose flats…

Combinatorics · Mathematics 2026-01-22 Per Alexandersson , Yulia Alexandr , Emiliano Liwski , Fatemeh Mohammadi , Pardis Semnani

The aim of this paper is to prove all well-known metrization theorems using partitions of unity. To accomplish this, we first discuss sufficient and necessary conditions for existence of $\mathcal{U}$-small partitions of unity (partitions…

General Topology · Mathematics 2013-11-18 Kyle Austin , Jerzy Dydak

This paper studies linear time-invariant descriptor systems which are not necessarily regular. We introduce the notion of partial detectability and characterize this concept by means of a simple rank criterion involving the system…

Optimization and Control · Mathematics 2023-01-25 Juhi Jaiswal , Thomas Berger , Nutan Kumar Tomar

We study the normal form of multipartite density matrices. It is shown that the correlation matrix (CM) separability criterion can be improved from the normal form we obtained under filtering transformations. Based on CM criterion the…

Quantum Physics · Physics 2015-05-13 Ming Li , Shao-Ming Fei , Zhi-Xi Wang

A classical theorem by Ritt states that all the complete decomposition chains of a univariate polynomial satisfying a certain tameness condition have the same length. In this paper we present our conclusions about the generalization of…

Symbolic Computation · Computer Science 2008-04-10 Jaime Gutierrez , David Sevilla

For any unitary matrix there exists a ZXZ decomposition, according to a theorem by Idel and Wolf. For any even-dimensional unitary matrix there exists a block-ZXZ decomposition, according to a theorem by F\"uhr and Rzeszotnik. We conjecture…

Quantum Physics · Physics 2021-12-02 Alexis De Vos , Martin Idel , Stijn De Baerdemacker

This paper studies the problem of decomposing a low-rank matrix into a factor with binary entries, either from $\{\pm 1\}$ or from $\{0,1\}$, and an unconstrained factor. The research answers fundamental questions about the existence and…

Data Structures and Algorithms · Computer Science 2019-08-01 Richard Kueng , Joel A. Tropp

Suppose we are given the conditional probability of one variable given some other variables.Normally the full joint distribution over the conditioning variablesis required to determine the probability of the conditioned variable.Under what…

Artificial Intelligence · Computer Science 2013-01-14 Avi Pfeffer

This paper allows one to obtain a criterion for the existence of a projectively invariant measure formulated in terms of combinatorial properties of a group (amenability of some canonical quotient group). Such necessary and sufficient…

Group Theory · Mathematics 2012-11-27 Leva Beklaryan

We establish necessary and sufficient conditions for the existence of a decomposition of a complete multigraph into edge-disjoint cycles of specified lengths, or into edge-disjoint cycles of specified lengths and a perfect matching.

Combinatorics · Mathematics 2015-08-05 Darryn Bryant , Daniel Horsley , Barbara Maenhaut , Benjamin R. Smith

Employing a recently proposed separability criterion we develop analytical lower bounds for the concurrence and for the entanglement of formation of bipartite quantum systems. The separability criterion is based on a nondecomposable…

Quantum Physics · Physics 2007-05-23 Heinz-Peter Breuer

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…

Algebraic Geometry · Mathematics 2020-05-29 Jan Draisma

An important measure of bipartite entanglement is the entanglement of formation, which is defined as the minimum average pure state entanglement of all decompositions realizing a given state. A decomposition which achieves this minimum is…

Quantum Physics · Physics 2007-05-23 Tobias Prager

The change of variable theorem is proved under the sole hypothesis of differentiability of the transformation. Specifically, it is shown under this hypothesis that the transformed integral equals the given one over every measurable subset…

Classical Analysis and ODEs · Mathematics 2007-05-23 Isidore Fleischer

In an earlier paper, we discussed the probability that the determinant of a matrix undergoes the least change upon perturbation of one of its elements, provided that most or all of the elements of the matrix are chosen at random and that…

Discrete Mathematics · Computer Science 2008-05-15 Genta Ito

This paper is concerned with the stabilization problem of singular fractional order systems with order $\alpha\in(0,2)$. In addition to the sufficient and necessary condition for observer based control, a sufficient and necessary condition…

Dynamical Systems · Mathematics 2020-03-30 Yiheng Wei , Jiachang Wang , Tianyu Liu , Yong Wang

A theory $T$ is said to be relatively decidable if for every model of $T$, one can compute the elementary diagram of that model from its atomic diagram together with $T$. We verify a conjecture of Chubb, Miller, and Solomon by showing that…

Logic · Mathematics 2026-04-21 Matthew Harrison-Trainor , Liam Tan

We shall characterize the structure of invertible substitutions on three-letter alphabet. We show that any invertible substitution, after some cyclic operation, can be written as a finite product of permutations and Fibonacci's…

Group Theory · Mathematics 2007-05-23 B. Tan , Z. -X. Wen , Y. -P. Zhang
‹ Prev 1 4 5 6 7 8 10 Next ›