Related papers: Some algorithms for semi-invariants of quivers

In this paper we classify all the quivers and corresponding dimension vectors having a smooth space of semisimple representation classes. The result is that these quiver settings can be reduced via some specific reduction steps to 3 simple…

We describe and prove correctness of two practical algorithms for finding indecomposable summands of finitely generated modules over a finitely generated k-algebra R. The first algorithm applies in the (multi)graded case, which enables the…

We present a hybrid algorithm for optimizing a convex, smooth function over the cone of positive semidefinite matrices. Our algorithm converges to the global optimal solution and can be used to solve general large-scale semidefinite…

In this paper we introduce a local-refinement procedure to investigate finite t-stabilities on a triangulated category, and show a direct sufficient condition for a finite t-stability to be finite finest. We classify all finite finest…

A tensor network is a diagram that specifies a way to "multiply" a collection of tensors together to produce another tensor (or matrix). Many existing algorithms for tensor problems (such as tensor decomposition and tensor PCA), although…

We introduce Support Decomposition Variational Inference (SDVI), a new variational inference (VI) approach for probabilistic programs with stochastic support. Existing approaches to this problem rely on designing a single global variational…

We consider the problem of decomposing a real-valued symmetric tensor as the sum of outer products of real-valued vectors. Algebraic methods exist for computing complex-valued decompositions of symmetric tensors, but here we focus on…

We expose (without proofs) a unified computational approach to integrable structures (including recursion, Hamiltonian, and symplectic operators) based on geometrical theory of partial differential equations. We adopt a coordinate based…

An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…

A sequential piecewise linear programming method is presented where bounded domains of non-convex functions are successively contracted about the solution of a piecewise linear program at each iteration of the algorithm. Although…

We revisit two NP-hard geometric partitioning problems - convex decomposition and surface approximation. Building on recent developments in geometric separators, we present quasi-polynomial time algorithms for these problems with improved…

In the last years many results in the area of semidefinite programming were obtained for invariant (finite dimensional, or infinite dimensional) semidefinite programs - SDPs which have symmetry. This was done for a variety of problems and…

For the antisymmetric tensors the paper examines a low-rank approximation which is represented via only three vectors. We describe a suitable low-rank format and propose an alternating least squares structure-preserving algorithm for…

A constructive method for decomposing finite dimensional representations of semisimple real Lie algebras is developed. The method is illustrated by an example. We also discuss an implementation of the algorithm in the language of the…

Invex programs are a special kind of non-convex problems which attain global minima at every stationary point. While classical first-order gradient descent methods can solve them, they converge very slowly. In this paper, we propose new…

This paper presents an algorithm to deform any Legendrian singularity to a nearby Legendrian subvariety with singularities of a simple combinatorial nature. Furthermore, the category of microlocal sheaves on the original Legendrian…

We present new results on the classical algorithm of variable elimination, which underlies many algorithms including for probabilistic inference. The results relate to exploiting functional dependencies, allowing one to perform inference…

We provide a semiorthogonal decomposition for the derived category of fibrations of quintic del Pezzo surfaces with rational Gorenstein singularities. There are three components, two of which are equivalent to the derived categories of the…

Let $(Q,\sigma)$ be a symmetric quiver, where $Q=(Q_0,Q_1)$ is a finite quiver without oriented cycles and $\sigma$ is a contravariant involution on $Q_0\sqcup Q_1$. The involution allows us to define a nondegenerate bilinear form $<,>$ on…

A promising area of applications for quantum computing is in linear algebra problems. In this work, we introduce two new quantum t-SVD (tensor-SVD) algorithms. The first algorithm is largely based on previous work that proposed a quantum…