Related papers: Computing Direct Sum Decompositions

Let k be a perfect field and A a finite dimensional k-algebra of finite global dimension (e.g. the path algebra of a finite quiver without oriented cycles). Making use of the recent theory of noncommutative motives, we prove that the value…

In this paper, we test and extend a proposal of Gu, Pei, and Zhang for an application of decomposition to three-dimensional theories with one-form symmetries and to quantum K theory. The theories themselves do not decompose, but, OPEs of…

We present a detailed description of the recent idea for a direct decomposition of Feynman integrals onto a basis of master integrals by projections, as well as a direct derivation of the differential equations satisfied by the master…

A famous result due to L. S. Levy provides a classification of all finitely generated indecomposable modules over Dedekind-like rings. This motivates us to outline an approach to the classification of indecomposable pseudo-absorbing primary…

Regev recently introduced a quantum factoring algorithm that may be perceived as a $d$-dimensional variation of Shor's factoring algorithm. In this work, we extend Regev's factoring algorithm to an algorithm for computing discrete…

Let $p$ be prime, and $n,m \in \mathbb{N}$. When $K/F$ is a cyclic extension of degree $p^n$, we determine the $\mathbb{Z}/p^m\mathbb{Z}[\text{Gal}(K/F)]$-module structure of $K^\times/K^{\times p^m}$. With at most one exception, each…

We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…

We overview numerous algorithms in computational $D$-module theory together with the theoretical background as well as the implementation in the computer algebra system \textsc{Singular}. We discuss new approaches to the computation of…

We give algorithms to compute decompositions of a given polynomial, or more generally mixed tensor, as sum of rank one tensors, and to establish whether such a decomposition is unique. In particular, we present methods to compute the…

In [10] the third author of this paper presented two conjectures on the additive decomposability of the sequence of ''smooth'' (or ''friable'') numbers. Elsholtz and Harper [4] proved (by using sieve methods) the second (less demanding)…

We study countable sums of two dimensional modules for the continuous complex functions on a compact metric space and show that it is possible to construct a spectral triple which gives the original metric back. This spectral triple will be…

We propose an algebraic framework generalizing several variants of Prony's method and explaining their relations. This includes Hankel and Toeplitz variants of Prony's method for the decomposition of multivariate exponential sums,…

In this paper, we describe an algorithm for computing the left, right, or 2-sided congruences of a finitely presented semigroup or monoid with finitely many classes, and an alternative algorithm when the finitely presented semigroup or…

We present a classification algorithm for isolated hypersurface singularities of corank 2 and modality 1 over the real numbers. For a singularity given by a polynomial over the rationals, the algorithm determines its right equivalence class…

This paper classifies irreducible, integrable highest weight modules for "current Kac-Moody Algebras" with finite dimensional weight spaces. We prove that these modules turn out to be modules of appropriate direct sums of finitely many…

Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…

We determine the Waring rank of the fundamental skew invariant of any complex reflection group whose highest degree is a regular number. This includes all irreducible real reflection groups.

The main goal of this paper is to introduce a framework for infinitesimal deformation problems, using new methods coming from operadic calculus. We construct an adjunction between infinitesimal deformation problems over some type of…

This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…

In the first part of this paper we present explicit formulas for primitive idempotents in arbitrary Frobenius algebras using the entries of representing matrices coming from projective indecomposable modules with respect to a certain choice…