Related papers: Characterizing the generalized complementarity pol…
The tubal tensor framework provides a clean and effective algebraic setting for tensor computations, supporting matrix-mimetic features like Singular Value Decomposition and Eckart-Young-like optimality results. Underlying the tubal tensor…
I introduce a new notion, that extends the mutually unbiased bases (MUB) conditons to more than two bases. These, I call the nUB conditions, and the corresponding bases $n$-fold unbiased. They naturally appear while optimizing generic…
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. We deal with the connectivity of the graphs of cubical polytopes. We first establish that, for any $d\ge 3$, the graph of a cubical $d$-polytope…
In this paper, we show that every pair of absolutely compatible Hilbert space effects are coexistent and exhibit a partial orthogonality property. We introduce the notion of partially ortho-coexistence. We generalize absolute compatibility…
The theory of positive maps plays a central role in operator algebras and functional analysis, and has countless applications in quantum information science. The theory was originally developed for operators acting on complex Hilbert…
We argue that in the Generalized Uncertainty Principle (GUP) model, the parameter $\beta_0$ whose square root, multiplied by Planck length $\ell_p$, approximates the minimum measurable distance, varies with energy scales. Since minimal…
In this paper we study the rank of polytopes contained in the 0-1 cube with respect to $t$-branch split cuts and $t$-dimensional lattice cuts for a fixed positive integer $t$. These inequalities are the same as split cuts when $t=1$ and…
This paper deals mainly with some aspects of the adjointable operators on Hilbert $C^*$-modules. A new tool called the generalized polar decomposition for each adjointable operator is introduced and clarified. As an application, the general…
Partial Isometries are important constructs that help give nontrivial solutions once a simple solution is known. We generalize this notion to Extended Partial Isometries and include operators which have right inverses but no left inverses…
We present a systematic method to introduce free parameters in sets of mutually unbiased bases. In particular, we demonstrate that any set of m real mutually unbiased bases in dimension N>2 admits the introduction of (m-1)N/2 free…
According to Euler's relation any polytope P has as many faces of even dimension as it has faces of odd dimension. As a generalization of this fact one can compare the number of faces whose dimension is congruent to i modulo m with the…
Let $M$ denote a two-dimensional Moore space (so $H_2(M; \Z) = 0$), with fundamental group $G$. The $M$-cellular spaces are those one can build from $M$ by using wedges, push-outs, and telescopes (and hence all pointed homotopy colimits).…
Limit and Pseudotopological spaces are two generalizations of topological spaces which are defined by indicating what filters converge under some axioms. In this article, we introduce covering spaces and set forth some necessary conditions…
In a quantum system having a finite number $N$ of orthogonal states, two orthonormal bases $\{a_i\}$ and $\{b_j\}$ are called mutually unbiased if all inner products $<a_i|b_j>$ have the same modulus $1/\sqrt{N}$. This concept appears in…
A complete set of mutually unbiased bases in a Hilbert space of dimension $d$ defines a set of $d+1$ orthogonal measurements. Relative to such a set, we define a "MUB-balanced state" to be a pure state for which the list of probabilities of…
For any given finite group, Schulte and Williams (2015) establish the existence of a convex polytope whose combinatorial automorphisms form a group isomorphic to the given group. We provide here a shorter proof for a stronger result: the…
For a $d$-dimensional polytope with $v$ vertices, $d+1\le v\le2d$, we calculate precisely the minimum possible number of $m$-dimensional faces, when $m=1$ or $m\ge0.62d$. This confirms a conjecture of Gr\"unbaum, for these values of $m$.…
A matroid base polytope is a polytope in which each vertex has 0,1 coordinates and each edge is parallel to a difference of two coordinate vectors. Matroid base polytopes are described combinatorially by integral submodular functions on a…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
We provide a partial solution to the problem of constructing mutually unbiased bases (MUBs) and symmetric informationally complete POVMs (SIC-POVMs) in non-prime-power dimensions. An algebraic description of a SIC-POVM in dimension six is…