Related papers: The Number Behind the Simplest SIC-POVM
The particle in a box is a simple model that has a classical Hamiltonian $H=p^2$ (using $2m=1$), with a limited coordinate space, $-b<q<b$, where $0<b<\infty$. Using canonical quantization, this example has been fully studied thanks to its…
We classify the nilpotent Lie algebras of real dimension eight and minimal center that admit a complex structure. Furthermore, for every such nilpotent Lie algebra $\mathfrak{g}$, we describe the space of complex structures on…
Numerical analysts might be expected to pay close attention to a branch of complexity theory called information-based complexity theory (IBCT), which produces an abundance of impressive results about the quest for approximate solutions to…
Lower bounds for some explicit decision problems over the complex numbers are given.
We show that the Christensen-Sinclair factorization theorem, when the underlying Hilbert spaces are finite dimensional, is an instance of strong duality of semidefinite programming. This gives an elementary proof of the result and also…
In this document, some structured operator approximation theoretical methods for system identification of nearly eventually periodic systems, are presented. Let $\mathbb{C}^{n\times m}$ denote the algebra of $n\times m$ complex matrices.…
First, we construct a bijection between the set of $h$-vectors and the set of socle-vectors of artinian algebras. As a corollary, we find the minimum codimension that an artinian algebra with a given socle-vector can have. Then, we study…
Quantization of general relativity in terms of SL(2,C)-connections (i.e. in terms of the complex Ashtekar variables) is technically difficult because of the non-compactness of SL(2,C). The difficulties concern the construction of a…
Inspired by some problems in Quantum Information Theory, we present some results concerning decompositions of positive operators acting on finite dimensional Hilbert spaces. We focus on decompositions by families having geometrical symmetry…
A new kind of numbers called Hyper Space Complex Numbers and its algebras are defined and proved. It is with good properties as the classic Complex Numbers, such as expressed in coordinates, triangular and exponent forms and following the…
In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of…
Simple semitoric systems were classified about ten years ago in terms of a collection of invariants, essentially given by a convex polygon with some marked points corresponding to focus-focus singularities. Each marked point is endowed with…
The cevians passing through a point in a simplex create a cevian simplex, which is divided by these cevians into smaller simplices. We consider the problem about the maximum of the ratio of the sum of the volumes of some of these smaller…
We initiate the complexity theoretic study of the problem of computing the bits of (real) algebraic numbers. This extends the work of Yap on computing the bits of transcendental numbers like \pi, in Logspace. Our main result is that…
The Siegel-Jacobi space is a non-symmetric homogeneous space which is very important geometrically and arithmetically. In this short paper, we propose the basic problems in the geometry of the Siegel-Jacobi space.
We consider some bilinear recurrences that have applications in number theory. The explicit solution of a general three-term bilinear recurrence relation of fourth order is given in terms of the Weierstrass sigma function for an associated…
In this paper, we argue that holographic complexity should be a basis-dependent quantity. Computational complexity of a state is defined as a minimum number of gates required to obtain that state from the reference state. Due to this…
Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…
The MinRank problem is a simple linear algebra problem: given matrices with coefficients in a field, find a non trivial linear combination of the matrices that has a small rank. There are several algebraic modeling of the problem. The main…
The height of an algebraic number $\alpha$ is a measure of how arithmetically complicated $\alpha$ is. We say $\alpha$ is totally $p$-adic if the minimal polynomial of $\alpha$ splits completely over the field $\mathbb{Q}_p$ of $p$-adic…