相关论文: Complexity test modules
We characterize Gorenstein modules over those local rings that admit a finite contracting endomorphism.
We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of…
Using linear functional-based duality of modules, we generalize the syndrome decoding algorithm of linear codes over finite fields to those over finite commutative rings. Moreover, If the ring is local the algorithm is simplified by…
Collapse models implement a progressive loss of quantum coherence when the mass and the complexity of quantum systems increase. We will review such models and the current attempts to test their predicted loss of quantum coherence.
Given a cycle module M with a ring structure we show that the cycle complex with coefficients in M of a smooth scheme of finite type over a field has a A-infinity algebra structure. In the case of Milnor K-theory this gives a homotopy model…
In this paper, we mainly focus on formal deformation theory of module homomorphisms. We first introduce the cohomology of module homomorphisms and study formal one-parameter deformation. We obtain some properties about obstructions. Then we…
In quantum chemistry, the price paid by all known efficient model chemistries is either the truncation of the Hilbert space or uncontrolled approximations. Theoretical computer science suggests that these restrictions are not mere…
People solve different problems and know that some of them are simple, some are complex and some insoluble. The main goal of this work is to develop a mathematical theory of algorithmic complexity for problems. This theory is aimed at…
We study problems related to indecomposability of modules over certain local finite dimensional trivial extension algebras. We do this by purely combinatorial methods. We introduce the concepts of graph of cyclic modules, of combinatorial…
We construct a minimal projective bimodule resolution for every finite dimensional quantum complete intersection of codimension two. Then we use this resolution to compute both the Hochschild cohomology and homology for such an algebra. In…
A notion of rigidity with respect to an arbitrary semidualizing complex C over a commutative noetherian ring R is introduced and studied. One of the main result characterizes C-rigid complexes. Specialized to the case when C is the relative…
We describe a method to evaluate multivariate polynomials over a finite field and discuss its multiplicative complexity.
The notion of cosilting module was recently introduced as a generalization of the concept of cotilting module. In this paper, it is introduced the notion of finitely cosilting module, i.e. a cosilting module with some finitness conditions,…
This note offers an unusual approach of studying a class of modules inasmuch as it is investigating a subclass of the category of modules over a valuation domain. This class is far from being a full subcategory, it is not even a category.…
Circuit complexity has been used as a tool to study various properties in condensed matter systems, in particular as a way to probe the phase diagram. However, compared with measures based on entanglement, complexity has been found lacking.…
A topological commutative ring is said to be rigid when for every set $X$, the topological dual of the $X$-fold topological product of the ring is isomorphic to the free module over $X$. Examples are fields with a ring topology, discrete…
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 interleaving distance is arguably the most prominent distance measure in topological data analysis. In this paper, we provide bounds on the computational complexity of determining the interleaving distance in several settings. We show…
These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…
Let $R$ be a finite ring and let $M, N$ be two finite left $R$-modules. We present two distinct deterministic algorithms that decide in polynomial time whether or not $M$ and $N$ are isomorphic, and if they are, exhibit an isomorphism. As…