Related papers: Cholesky decomposition for symmetric matrices over…

We introduce a partition of (coweight) lattice points inside the dilated fundamental parallelepiped into those of partially closed simplices. This partition can be considered as a generalization and a lattice points interpretation of the…

In a recent paper we have suggested that the finite temperature density matrix can be computed efficiently by a combination of polynomial expansion and iterative inversion techniques. We present here significant improvements over this…

Some remarkable properties of the beta distribution are based on relations involving independence between beta random variables such that a parameter of one among them is the sum of the parameters of an other (see (1.1) et (1.2) below).…

We present a rigorous and functorial quantization scheme for affine field theories, i.e., field theories where local spaces of solutions are affine spaces. The target framework for the quantization is the general boundary formulation,…

Recently \REF\dk{Simon Dalley and Igor Klebanov,'Light Cone Quantization of the $c=2$ Matrix Model', PUPT-1333, hepth@xxx/920705} \refend Dalley and Klebanov proposed a light-cone quantized study of the $c=2$ matrix model, but which ignores…

We generalize the result of Gorini, Kossakowski, and Sudarshan [J. Math. Phys. 17:821, 1976] that every generator of a quantum-dynamical semigroup decomposes uniquely into a closed and a dissipative part, assuming the trace of both…

Sparse matrix factorization is a popular tool to obtain interpretable data decompositions, which are also effective to perform data completion or denoising. Its applicability to large datasets has been addressed with online and randomized…

The general linear group acts on the space of several linear maps on the vector space as the basis change. Similarly, we have the actions of the orthogonal and symplectic groups. Generators and identities for the corresponding polynomial…

Logarithms of determinants of large positive definite matrices appear ubiquitously in machine learning applications including Gaussian graphical and Gaussian process models, partition functions of discrete graphical models, minimum-volume…

Forman introduced discrete Morse theory as a tool for studying CW complexes by essentially collapsing them onto smaller, simpler-to-understand complexes of critical cells in [Fo]. Chari reformulated discrete Morse theory for regular cell…

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to…

We present an alternative method for computing primary decomposition of zero-dimensional ideals over finite fields. Based upon the further decomposition of the invariant subspace of the Frobenius map acting on the quotient algebra in the…

This article tries to generalize former works of Derksen, Weyman and Zelevinsky about skew-symmetric cluster algebras to the skew-symmetrizable case. We introduce the notion of group species with potentials and their decorated…

We present certain existence criteria and parameterisations for an interpolation problem for completely positive maps that take given matrices from a finite set into prescribed matrices. Our approach uses density matrices associated to…

Preface (A.Vershik) - about these texts (3.); I.Interpolation between inductive and projective limits of finite groups with applicatons to linear groups over finite fields; II.The characters of the groups of almost triangle matrices over…

We study factorization and dilation properties of Markov maps between von Neumann algebras equipped with normal faithful states, i.e., completely positive unital maps which preserve the given states and also intertwine their automorphism…

We provide more technical details about the HLIBCov package, which is using parallel hierarchical ($\H$-) matrices to identify unknown parameters of the covariance function (variance, smoothness, and covariance length). These parameters are…

Matrix factorization is an inference problem that has acquired importance due to its vast range of applications that go from dictionary learning to recommendation systems and machine learning with deep networks. The study of its fundamental…

We continue the study of the so-called thematic factorizations of admissible very badly approximable matrix functions. These factorizations were introduced by V.V. Peller and N.J. Young for studying superoptimal approximation by bounded…

Estimating large covariance matrices has been a longstanding important problem in many applications and has attracted increased attention over several decades. This paper deals with two methods based on pre-existing works to impose sparsity…