Related papers: Understanding Christensen-Sinclair factorization v…
In this paper we define a pair of faithful functors that map isomorphic and isotopic finite-dimensional algebras over finite fields to isomorphic graphs. These functors reduce the cost of computation that is usually required to determine…
Solving semiparametric models can be computationally challenging because the dimension of parameter space may grow large with increasing sample size. Classical Newton's method becomes quite slow and unstable with intensive calculation of…
We work out the factorization of the 3d superconformal index for N = 2 $U(N_c)$ gauge theory withone adjoint chiral multiplet as well as $N_f$ fundamental, $N_a$ anti-fundamental chiral multiplets. Using the factorization,one can prove the…
We consider Continuous Linear Programs over a continuous finite time horizon $T$, with linear cost coefficient functions and linear right hand side functions and a constant coefficient matrix, where we search for optimal solutions in the…
In this paper we combine the theory of reproducing kernel Hilbert spaces with the field of collocation methods to solve boundary value problems with special emphasis on reproducing property of kernels. From the reproducing property of…
We study unital operator spaces endowed with a partially defined product. We give a matrix-norm characterization of such products that allows for a representation theorem where the partial product is realized as composition of operators on…
In this paper we provide purely model-theoretic (algebraic) characterisations for classes definable in second-order logic and for pseudo-elementary classes (including PC and PC_{\Delta} classes). Classical results of this flavour include…
We study representations of positive definite kernels $K$ in a general setting, but with view to applications to harmonic analysis, to metric geometry, and to realizations of certain stochastic processes. Our initial results are stated for…
When solving large scale semidefinite programs that admit a low-rank solution, an efficient heuristic is the Burer-Monteiro factorization: instead of optimizing over the full matrix, one optimizes over its low-rank factors. This reduces the…
We introduce the notion of a continuous biframe in a Hilbert space which is a generalization of discrete biframe in Hilbert space. Representation theorem for this type of generalized frame is verified and some characterizations of this…
We give an introduction to the realisation theory for infinite-dimensional systems. That is, we show that for any function $G$, analytic and bounded in the right half of the complex plane, there exists operators $A,B,C$ such that…
This is a continuation of the study of the theory of quantum stochastic dilation of completely positive semigroups on a von Neumann or $C^*$ algebra, here with unbounded generators. The additional assumption of symmetry with respect to a…
In this paper, we conjecture an extension of the Hilbert basis theorem and the finite generation of invariants to commutative algebras in symmetric finite tensor categories over fields of positive characteristic. We prove the conjecture in…
We show that the Hilbert space with basis indexed by infinite permutations and the cohomology ring of the infinite flag variety can be seen as representations of the Heisenberg algebra, which are isomorphic using the back-stable Schubert…
The Central Limit Theorem (CLT) establishes that sufficiently large sequences of independent and identically distributed random variables converge in probability to a normal distribution. This makes the CLT a fundamental building block of…
We consider frames in a finite-dimensional Hilbert space where frames are exactly the spanning sets of the vector space. A factor poset of a frame is defined to be a collection of subsets of $I$, the index set of our vectors, ordered by…
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of semidefinite relaxations within constraint programming. In…
We present a systematic study of the family of positive definite (p.d.) kernels with the use of their associated feature maps and feature spaces. For a fixed set $X$, generalizing Loewner, we make precise the corresponding partially ordered…
We give algorithms to factorize large integers in the duality computer. We provide three duality algorithms for factorization based on a naive factorization method, the Shor algorithm in quantum computing, and the Fermat's method in…
In the context of finite tensor products of Hilbert spaces, we prove that similarity of a tensor product of operator semigroups to a contraction semigroup is equivalent to the corresponding similarity for each factor, after an appropriate…