Related papers: Understanding Christensen-Sinclair factorization v…

For any polynomial $P \in \mathbb{C}[X_1,X_2,...,X_n]$, we describe a $\mathbb{C}$-vector space $F(P)$ of solutions of a linear system of equations coming from some algebraic partial differential equations such that the dimension of $F(P)$…

Computer algebra systems are really good at factoring polynomials, i.e. writing f as a product of irreducible factors. It is relatively easy to verify that we have a factorisation, but verifying that these factors are irreducible is a much…

We begin the study of categorifications of Donaldson-Thomas invariants associated with Hilbert schemes of points on the three-dimensional affine space, which we call DT categories. The DT category is defined to be the category of matrix…

In this paper we consider the following problem: When are the preduals of two hyperfinite (=injective) factors $\M$ and $\N$ (on separable Hilbert spaces) cb-isomorphic (i.e., isomorphic as operator spaces)? We show that if $\M$ is…

We introduce and study a class $\mathcal{M}$ of generalized positive definite kernels of the form $K\colon X\times X\to L(\mathfrak{A},L(H))$, where $\mathfrak{A}$ is a unital $C^{*}$-algebra and $H$ a Hilbert space. These kernels encode…

In this note we study the $1+1$ dimensional Jackiw-Teitelboim gravity in Lorentzian signature, explicitly constructing the gauge-invariant classical phase space and the quantum Hilbert space and Hamiltonian. We also semiclassically compute…

In this paper we present a new semidefinite programming hierarchy for covering problems in compact metric spaces. Over the last years, these kind of hierarchies were developed primarily for geometric packing and for energy minimization…

The residual finite-dimensionality of a $\mathrm{C}^*$-algebra is known to be encoded in a topological property of its space of representations, stating that finite-dimensional representations should be dense therein. We extend this…

We give two new global and algorithmic constructions of the reproducing kernel Hilbert space associated to a positive definite kernel. We further present ageneral positive definite kernel setting using bilinear forms, and we provide new…

In our previous papers we used the Hilbert scheme of points on $C^2$ in order to construct a triply graded link homology and its $gl(m)$ version. Here we extend the $gl(m)$ construction to super-algebras $gl(m|k)$.

This work concerns the construction and characterization of product kernels for multivariate approximation from a finite set of discrete samples. To this end, we consider composing different component kernels, each acting on a…

Here we discuss a regularized version of the factorization method for positive operators acting on a Hilbert Space. The factorization method is a qualitative reconstruction method that has been used to solve many inverse shape problems. In…

This paper is a detailed study of finite-dimensional modules defined on bicomplex numbers. A number of results are proved on bicomplex square matrices, linear operators, orthogonal bases, self-adjoint operators and Hilbert spaces, including…

In this paper we construct a hierarchy of multivariate polynomial approximation kernels via semidefinite programming. We give details on the implementation of the semidefinite programs defining the kernels. Finally, we show how a symmetry…

The paper is dedicated to the study of strong duality for a problem of linear copositive programming. Based on the recently introduced concept of the set of normalized immobile indices, an extended dual problem is deduced. The dual problem…

We prove cocontinuity of the $\max$-tensor product of C*-categories and develop a framework to perform factorization homology in a C*-setting. In such context, we specialize some results of D. Ben-Zvi, A. Brochier and D. Jordan. As a…

Clustering consists of partitioning data objects into subsets called clusters according to some similarity criteria. This paper addresses a generalization called quasi-clustering that allows overlapping of clusters, and which we link to…

We propose a semiclassical version of Shor's quantum algorithm to factorize integer numbers, based on spin-1/2 SU(2) generalized coherent states. Surprisingly, we find evidences that the algorithm's success probability is not too severely…

We introduce an algorithm to piecewise dualise linear quivers into their mirror dual. The algorithm uses two basic duality moves and the properties of the $S$-wall which can all be derived by iterative applications of Seiberg-like…

Traditional formulations of geometric problems from the Schubert calculus, either in Plucker coordinates or in local coordinates provided by Schubert cells, yield systems of polynomials that are typically far from complete intersections and…