Related papers: Understanding Christensen-Sinclair factorization v…
We study a reproducing kernel Hilbert space of functions defined on the positive integers and associated to the binomial coefficients. We introduce two transforms, which allow us to develop a related harmonic analysis in this Hilbert space.…
We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…
A finite semifield is a division algebra over a finite field where multiplication is not necessarily associative. We consider here the complexity of the multiplication in small semifields and finite field extensions. For this operation, the…
We characterize when a size-2 positive semidefinite (psd) factorization of a positive matrix of rank 3 and psd rank 2 is unique. The characterization is obtained using tools from rigidity theory. In the first step, we define…
In this paper we propose two proximal gradient algorithms for fractional programming problems in real Hilbert spaces, where the numerator is a proper, convex and lower semicontinuous function and the denominator is a smooth function, either…
We present an approach to defining Hilbert spaces of functions depending on infinitely many variables or parameters, with emphasis on a weighted tensor product construction based on stable space splittings, The construction has been used in…
Given a total sequence in a Hilbert space, we speak of an upper (resp. lower) semi-frame if only the upper (resp. lower) frame bound is valid. Equivalently, for an upper semi-frame, the frame operator is bounded, but has an unbounded…
We prove a theorem on algebraic osculation and we apply our result to the Computer Algebra problem of polynomial factorization. We consider X a smooth completion of the complex plane and D an effective divisor supported on the boundary of…
A conic program is the problem of optimizing a linear function over a closed convex cone intersected with an affine preimage of another cone. We analyse three constraint qualifications, namely a Closedness CQ, Slater CQ, and Boundedness CQ…
Frames play an important role in various practical problems related to signal and image processing. In this paper, we define computable frames in computable Hilbert spaces and obtain computable versions of some of their characterizations.…
Semidefinite Optimization has become a standard technique in the landscape of Mathematical Programming that has many applications in finite dimensional Quantum Information Theory. This paper presents a way for finite-dimensional relaxations…
We show that semi-infinite cohomology of a finite dimensional graded algebra (satisfying some additional requirements) are a particular case of a general categorical construction. The motivating example is provided by small quantum groups…
A finite-dimensional Hilbert space is usually described in terms of an orthonormal basis, but in certain approaches or applications a description in terms of a finite overcomplete system of vectors, called a finite tight frame, may offer…
In this work a linearly constrained minimization of a positive semidefinite quadratic functional is examined. Our results are concerning infinite dimensional real Hilbert spaces, with a singular positive operator related to the functional,…
We study the ternary quadratic problem (TQP), a quadratic optimization problem with linear constraints where the variables take values in $\{0, \pm 1\}$. While semidefinite programming (SDP) techniques are well established for $\{0,1\}$-…
We establish a duality for two factorization questions, one for general positive definite (p.d) kernels $K$, and the other for Gaussian processes, say $V$. The latter notion, for Gaussian processes is stated via Ito-integration. Our…
We introduce fusion, contragradient and braiding of Hilbert affine representations of a subfactor planar algebra $P$ (not necessarily having finite depth). We prove that if $N \subset M$ is a subfactor realization of $P$, then the Drinfeld…
We prove a factorization of completely bounded maps from a $C^*$-algebra $A$ (or an exact operator space $E\subset A$) to $\ell_2$ equipped with the operator space structure of $(C,R)_\theta$ ($0<\theta<1$) obtained by complex interpolation…
Proving program termination is typically done by finding a well-founded ranking function for the program states. Existing termination provers typically find ranking functions using either linear algebra or templates. As such they are often…
We consider Continuous Linear Programs over a continuous finite time horizon $T$, with linear cost coefficient functions, linear right hand side functions, and a constant coefficient matrix, as well as their symmetric dual. We search for…