Related papers: Complexity test modules
The complexity and curvature of a module, introduced by Avramov, measure the growth of Betti and Bass numbers of a module, and distinguish the modules of infinite homological dimension. The notion of complexity was extended by…
We study how the complexity of modular circuits computing AND depends on the depth of the circuits and the prime factorization of the modulus they use. In particular our construction of subexponential circuits of depth 2 for AND helps us to…
We investigate measures of complexity of function classes based on continuity moduli of Gaussian and Rademacher processes. For Gaussian processes, we obtain bounds on the continuity modulus on the convex hull of a function class in terms of…
Firstly, we give a partial solution to the isomorphism problem for uniserial modules of finite length with the help of the morphisms between these modules over an arbitrary ring. Later, under suitable assumptions on the lattice of the…
Persistent homology was shown by Carlsson and Zomorodian to be homology of graded chain complexes with coefficients in the graded ring $\kk[t]$. As such, the behavior of persistence modules -- graded modules over $\kk[t]$ is an important…
It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…
For a commutative noetherian ring A, we compare the support of a complex of A-modules with the support of its cohomology. This leads to a classification of all full subcategories of A-modules which are thick (that is, closed under taking…
This thesis is comprised of three chapters. The first chapter deals with bounded complexes of Gorenstein projective and Gorenstein injective modules. Deploying methods of relative homological algebra, we approximate such complexes with…
We examine the topological characteristic cohomology classes of complexified vector bundles. In particular, all the classes coming from the real vector bundles underlying the complexification are determined.
`What more than its truth do we know if we have a proof of a theorem in a given formal system?' We examine Kreisel's question in the particular context of program termination proofs, with an eye to deriving complexity bounds on program…
Nanostructured surfaces usually exhibit complicated morphologies that cannot be described in terms of Euclidean geometry. Simultaneously, they do not constitute fully random noise fields to be characterized by simple stochastics and…
We study complexes of finite complete intersection dimension in the derived category of a local ring. Given such a complex, we prove that the thick subcategory it generates contains complexes of all possible complexities. In particular, we…
An efficient evaluation method is described for polynomials in finite fields. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is large enough. Applications to the syndrome computation…
By definition, transverse intersections are stable under infinitesimal perturbations. Using persistent homology, we extend this notion to a measure. Given a space of perturbations, we assign to each homology class of the intersection its…
We define a notion of complexity for modules over infinite groups. We show that if $M$ is a module over the group ring $kG$, and $M$ has complexity $\leq f$ (where $f$ is some complexity function) over some set of finite index subgroups of…
We compute support of formal cohomology modules in a serial of non-trivial cases. Applications are given. For example, we compute injective dimension of certain local cohomology modules in terms of dimension of their's support.
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…
Depth is a complexity measure for natural systems of the kind studied in statistical physics and is defined in terms of computational complexity. Depth quantifies the length of the shortest parallel computation required to construct a…
We explore the implications of the finiteness of homological dimensions for Ext modules, focusing on projective dimension, injective dimension, and their Gorenstein counterpart. In this direction, we establish several finiteness criteria…
Results on the finiteness of induced crossed modules are proved both algebraically and topologically. Using the Van Kampen type theorem for the fundamental crossed module, applications are given to the 2-types of mapping cones of…