English
Related papers

Related papers: Computing Direct Sum Decompositions

200 papers

Let $\mathbf{A}$ be a finite algebra generating a finitely decidable variety and having nontrivial strongly solvable radical $\tau$. We provide an improved bound on the number of variables in which a term can be sensitive to changes within…

Logic · Mathematics 2013-11-13 Matthew Smedberg

We investigate when the filtration induced by Beilinson's spectral sequence splits non-canonically into a direct sum decomposition. We conclude that for any vector bundle $\mathcal{E}$ on a projective space over an algebraically closed…

Algebraic Geometry · Mathematics 2024-02-13 Feliks Rączka

Let $R$ be the homogeneous coordinate ring of the Grassmannian $\mathbb{G}=\operatorname{Gr}(2,n)$ defined over an algebraically closed field of characteristic $p>0$. In this paper we give a completely characteristic free description of the…

Algebraic Geometry · Mathematics 2017-06-19 Theo Raedschelders , Špela Špenko , Michel Van den Bergh

This is a review/announcement of results concerning the connection between certain exactly solvable two-dimensional models of statistical mechanics, namely loop models, and the equivariant $K$-theory of the cotangent bundle of the…

Algebraic Geometry · Mathematics 2018-07-16 Paul Zinn-Justin

We describe recent work on preprojective algebras and moduli spaces of their representations. We give an analogue of Kac's Theorem, characterizing the dimension types of indecomposable coherent sheaves over weighted projective lines in…

Rings and Algebras · Mathematics 2007-05-23 William Crawley-Boevey

This paper presents a novel algorithm for constructing a sum-of-squares (SOS) decomposition for positive semi-definite polynomials with rational coefficients. Unlike previous methods that typically yield SOS decompositions with…

Symbolic Computation · Computer Science 2025-10-06 Zhenbing Zeng , Yong Huang , Lu Yang , Yongsheng Rao

We compute the complexity, z-complexity, and support varieties of the (thick) Kac modules for the Lie superalgebras of type P. We also show the complexity and the z-complexity have geometric interpretations in terms of support and…

Representation Theory · Mathematics 2020-08-12 Brian D. Boe , Jonathan R. Kujawa

The theory of support varieties gives a rich supply of examples of thick subcategories of the stable module category of a finite group algebra. We study direct sum decompositions of such categories. We give examples where there are finer…

Representation Theory · Mathematics 2013-11-05 Jon F. Carlson , Jeremy Rickard

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

Commutative Algebra · Mathematics 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler

Let $k$ be an algebraically closed field of characteristic $0$ or $p>2$. Let $\mathcal{G}$ be an affine supergroup scheme over $k$. We classify the indecomposable exact module categories over the tensor category ${\rm sCoh}_{\rm…

Quantum Algebra · Mathematics 2021-01-26 Shlomo Gelaki

A module $M$ is {called} stable if it has no nonzero projective direct summand. For a ring $ R $, we study conditions under which $R$-modules from certain classes decompose as a direct sum of a projective submodule and a stable submodule.…

Commutative Algebra · Mathematics 2026-04-03 Gulizar Gunay , Engin Mermut

We prove some basic results about irreducible components of varieties of modules for an arbitrary finitely generated associative algebra. Our work generalizes results of Kac and Schofield on representations of quivers, but our methods are…

Algebraic Geometry · Mathematics 2007-05-23 William Crawley-Boevey , Jan Schröer

Let K be an algebraically closed field. For a graded K-Algebra R, we write cmdef R:=dim R -depth R. We show that for each reductive group G (over K) which is not linearly reductive, there exists a faithful G-module V such that cmdef…

Commutative Algebra · Mathematics 2007-11-30 Martin Kohls

We present in this paper a general algorithm for solving first-order formulas in particular theories called "decomposable theories". First of all, using special quantifiers, we give a formal characterization of decomposable theories and…

Logic in Computer Science · Computer Science 2007-05-23 Khalil Djelloul

We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…

Symbolic Computation · Computer Science 2023-06-12 Christian Eder , Pierre Lairez , Rafael Mohr , Mohab Safey El Din

We primarily investigate congruences modulo $p$ for finite sums of the form $\sum_k\binom{rk}{k}x^k/k$ over the ranges $0<k<p$ and $0<k<p/r$, where $p$ is a prime larger than the positive integer $r$. Here $x$ is an indeterminate, thus…

Number Theory · Mathematics 2026-03-18 Sandro Mattarei , Roberto Tauraso

Triangular decomposition is a classic, widely used and well-developed way to represent algebraic varieties with many applications. In particular, there exist sharp degree bounds for a single triangular set in terms of intrinsic data of the…

Algebraic Geometry · Mathematics 2018-06-08 Gleb Pogudin , Agnes Szanto

We characterize the class of persistence modules indexed over $\mathbb{R}^2$ that are decomposable into summands whose support have the shape of a {\em block}---i.e. a horizontal band, a vertical band, an upper-right quadrant, or a…

Representation Theory · Mathematics 2019-11-28 Jérémy Cochoy , Steve Oudot

We study the problem of decomposing a non-negative polynomial as an exact sum of squares (SOS) in the case where the associated semidefinite program is feasible but not strictly feasible (for example if the polynomial has real zeros).…

Algebraic Geometry · Mathematics 2018-10-11 Santiago Laplagne

We consider the problem of computing exact sums of squares (SOS) decompositions for certain classes of non-negative multivariate polynomials, relying on semidefinite programming (SDP) solvers. We provide a hybrid numeric-symbolic algorithm…

Symbolic Computation · Computer Science 2026-02-24 Victor Magron , Mohab Safey El Din