Related papers: Exploring the Varchenko Determinant of Partial Cub…
Factorizations over cones and their duals play central roles for many areas of mathematics and computer science. One of the reasons behind this is the ability to find a representation for various objects using a well-structured family of…
We study the limitations of deterministic programmability of quantum circuits, e.g., quantum computer. More precisely, we analyse the programming of quantum observables and channels via quantum multimeters. We show that the programming…
Opacity is a generic security property, that has been defined on (non probabilistic) transition systems and later on Markov chains with labels. For a secret predicate, given as a subset of runs, and a function describing the view of an…
This article studies moduli spaces of Bridgeland semistable objects in the Kuznetsov component of a cubic fourfold that don't admit a symplectic resolution, i.e., moduli spaces of objects with non-primitve Mukai vector v=mv_0 that is not of…
We introduce a generalization of the set of completely positive matrices that we call "pairwise completely positive" (PCP) matrices. These are pairs of matrices that share a joint decomposition so that one of them is necessarily positive…
Many fundamental and key objects in quantum mechanics are linear mappings between particular affine/linear spaces. This structure includes basic quantum elements such as states, measurements, channels, instruments, non-signalling channels…
This short note, in part of expository nature, points out several new or recent consequences of a quite nice decomposition for positive semi-definite matrices.
Quantum operations are the most widely used tool in the theory of quantum information processing, representing elementary transformations of quantum states that are composed to form complex quantum circuits. The class of quantum…
Positive semidefinite Hermitian matrices that are not fully specified can be completed provided their underlying graph is chordal. If the matrix is positive definite the completion can be uniquely characterized as the matrix that maximizes…
We survey partial geometric designs and investigate their concurrences of points. The concurrence matrix of a design, which encodes the concurrences of pairs of points, can be used in the classification of designs in some extent. An…
By using the quasi-determinant the construction of Gel'fand et al. leads to the inverse of a matrix with noncommuting entries. In this work we offer a new method that is more suitable for physical purposes and motivated by deformation…
In this paper, we establish the explicit lower bound estimates for the rank of universal quadratic forms in some certain families of real cubic fields under the condition of density one. The more general results that represent all multiples…
Over any partially ordered abelian group whose positive cone is closed in an appropriate sense and has finitely many faces, modules that satisfy a weak finiteness condition admit finite primary decompositions. This conclusion rests on the…
We classify the discriminantly separable polynomials of degree two in each of three variables, defined by a property that all the discriminants as polynomials of two variables are factorized as products of two polynomials of one variable…
A parametrization of density operators for bipartite quantum systems is proposed. It is based on the particular parametrization of the unitary group found recently by Jarlskog. It is expected that this parametrization will find interesting…
In his seminal 1983 paper, Jim Lawrence introduced lopsided sets and featured them as asymmetric counterparts of oriented matroids, both sharing the key property of strong elimination. Moreover, symmetry of faces holds in both structures as…
We give an explicit recipe for determining iterated local cohomology groups with support in ideals of minors of a generic matrix in characteristic zero, expressing them as direct sums of indecomposable D-modules. For non-square matrices…
This paper studies the problem of decomposing a low-rank positive-semidefinite matrix into symmetric factors with binary entries, either $\{\pm 1\}$ or $\{0,1\}$. This research answers fundamental questions about the existence and…
Blockwise determinantal ideals are those generated by the union of all the minors of specified sizes in certain blocks of a generic matrix, and they are the natural generalization of many existing determinantal ideals like the Schubert and…
We present several generalizations of Cauchy's determinant and Schur's Pfaffian by considering matrices whose entries involve some generalized Vandermonde determinants. Special cases of our formulae include previuos formulae due to S.Okada…