Related papers: Comparing complexities of pairs of modules

Techniques for the evaluation of complex polynomials with one and two variables are introduced. Polynomials arise in may areas such as control systems, image and signal processing, coding theory, electrical networks, etc., and their…

Let $\mathfrak{g}=\mathfrak{g}_{\bar{0}}\oplus \mathfrak{g}_{\bar{1}}$ be a classical Lie superalgebra and $\mathcal{F}$ be the category of finite dimensional $\mathfrak{g}$-supermodules which are completely reducible over the reductive Lie…

A relationship between nilpotency and primeness in a module is investigated. Reduced modules are expressed as sums of prime modules. It is shown that presence of nilpotent module elements inhibits a module from possessing good structural…

In this paper, we compare $(n,m)$-purities for different pairs of positive integers $(n,m)$. When $R$ is a commutative ring, these purities are not equivalent if $R$ doesn't satisfy the following property: there exists a positive integer…

The radius of regularity sometimes spelled as the radius of nonsingularity is a measure providing the distance of a given matrix to the nearest singular one. Despite its possible application strength this measure is still far from being…

The article focuses on three different notions of polynomiality for maps of modules. In addition to the polynomial maps studied by Eilenberg and Mac Lane and the strict polynomial maps ("lois polynomes") considered by Roby, we introduce…

We provide a computational complexity lens to understand the power of machine learning models, particularly their ability to model complex systems. Machine learning models are often trained on data drawn from sampleable or more complex…

We use reproducing kernel methods to study various rigidity problems. The methods and setting allow us to also consider the non-positive case.

This article studies the equation $[A,B]^k = {\rm Id}_n$ for matrices over $\mathbb{C}$, characterizing the pairs $(k,n)$ for which solutions exist via a classical result of Lam and Leung on sums of roots of unity. The problem is next…

Let $(R,\m)$ and $(S,\n)$ be commutative Noetherian local rings, and let $\phi:R\to S$ be a flat local homomorphism such that $\m S = \n$ and the induced map on residue fields $R/\m \to S/\n$ is an isomorphism. Given a finitely generated…

The linear complexity is a measure for the unpredictability of a sequence over a finite field and thus for its suitability in cryptography. In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion…

The rigidity degree of a generator-cogenerator determines the dominant dimension of its endomorphism algebra, and is closely related to a recently introduced homological dimension -- rigidity dimension. In this paper, we give explicit…

We study pairs of finitely generated modules over a principal ideal domain and their corresponding matrix representations. We introduce equivalence relations for such pairs and determine invariants and canonical forms.

Modular structure is ubiquitous in real-world complex networks, and its detection is important because it gives insights in the structure-functionality Modular structure is ubiquitous in real-world complex networks, and its detection is…

We investigate purities determined by classes of finitely presented modules including the correspondence between purities for left and right modules. We show some cases where purities determined by matrices of given sizes are different.…

Several algorithms have been proposed to compute partitions of networks into communities that score high on a graph clustering index called modularity. While publications on these algorithms typically contain experimental evaluations to…

Let R be a local Cohen-Macaulay ring with canonical module \omega_R. We investigate the following question of Huneke: If the sequence of Betti numbers \{\beta_i^R(\omega_R)\} has polynomial growth, must R be Gorenstein? This question is…

We prove a double-exponential upper bound on the degree and on the complexity of constructing a Janet basis of a $D$-module. This generalizes a well known bound on the complexity of a Gr\"obner basis of a module over the algebra of…

We study structured optimization problems with polynomial objective function and polynomial equality constraints. The structure comes from a multi-grading on the polynomial ring in several variables. For fixed multi-degrees we determine the…

We make an experimental comparison of methods for computing the numerical radius of an $n\times n$ complex matrix, based on two well-known characterizations, the first a nonconvex optimization problem in one real variable and the second a…