Related papers: Comparing complexities of pairs of modules

Semiring complexity is the version of arithmetic circuit complexity that allows only two operations: addition and multiplication. We show that when the number of variables is fixed, the semiring complexity of a Schur polynomial $s_\lambda$…

This work clarifies the relationship between the openness of the regular locus of a commutative Noetherian ring R and the existence of generators for the category of finitely generated R-modules, the corresponding bounded derived category,…

We develop a theory of complexity for numerical computations that takes into account the condition of the input data and allows for roundoff in the computations. We follow the lines of the theory developed by Blum, Shub, and Smale for…

Let ${\mathcal W}_n$ be the Lie algebra of polynomial vector fields. We classify simple weight ${\mathcal W}_n$-modules $M$ with finite weight multiplicities. We prove that every such nontrivial module $M$ is either a tensor module or the…

We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…

We introduce a criterion for the completeness of ring approximations of modular cohomology rings of finite non prime power groups, and discuss how this criterion performs in practical computations, compared with other criteria.

This article starts a computational study of congruences of modular forms and modular Galois representations modulo prime powers. Algorithms are described that compute the maximum integer modulo which two monic coprime integral polynomials…

While many papers have proposed implementations of ternary adders and ternary multipliers, no comparisons have generally been done with the corresponding binary ones. We compare the implementations of binary and ternary adders and…

We consider the complexity of two questions on polynomials given by arithmetic circuits: testing whether a monomial is present and counting the number of monomials. We show that these problems are complete for subclasses of the counting…

Complex polynomial optimization has recently gained more and more attention in both theory and practice. In this paper, we study the optimization of a real-valued general conjugate complex form over various popular constraint sets including…

Let $S={\Bbb K}[x_1,\dots,x_n]$ denote a polynomial ring over a field $\Bbb K$. Given a monomial ideal $I$ and a finitely generated multigraded $M$ over $S$, we follow Herzog's method to construct a multigraded free $S$-resolution of $M/IM$…

Detecting community structure is fundamental to clarify the link between structure and function in complex networks and is used for practical applications in many disciplines. A successful method relies on the optimization of a quantity…

We derive upper bounds on the complexity of ReLU neural networks approximating the solution of a linear system given the matrix and the right-hand side. We focus on matrices which are symmetric positive definite and sparse, as they appear…

Compositionality is a key strategy for addressing combinatorial complexity and the curse of dimensionality. Recent work has shown that compositional solutions can be learned and offer substantial gains across a variety of domains, including…

Avramov and Buchweitz proved that for finitely generated modules $M$ and $N$ over a complete intersection local ring $R$, $\Ext^i_R(M,N)=0$ for all $i\gg 0$ implies $\Ext^i_R(N,M)=0$ for all $i\gg 0$. In this note we give some…

Let R be a commutative noetherian ring. In this paper, we study specialization-closed subsets of Spec R. More precisely, we first characterize the specialization-closed subsets in terms of various closure properties of subcategories of…

We provide a framework connecting several well known theories related to the linearity of graded modules over graded algebras. In the first part, we pay a particular attention to the tensor products of graded bimodules over graded algebras.…

Let $M$ denote a finitely generated module over a Noetherian ring $R$. For an ideal $I \subset R$ there is a study of the endomorphisms of the local cohomology module $H^g_I(M), g = \operatorname{grade} (I,M),$ and related results. Another…

We give a new algorithm for merging sorted lists of monomials. Together with a projection technique we obtain a new complexity bound for the BM-algorithm.

We investigate finiteness conditions on modules of bounded projective dimension and their connection with generalized notions of coherence. For a ring $R$, we consider the class $\mathsf{FP}_n^{\le d}(R)$ of finitely $n$-presented modules…