Related papers: An unexpected application of minimization theory t…
In this note, we establish conditions under which the union of an increasing sequence of completely decomposable modules over domains are again completely decomposable. In our investigation, the condition of purity of modules is crucial. In…
Modular structure is pervasive in many complex networks of interactions observed in natural, social and technological sciences. Its study sheds light on the relation between the structure and function of complex systems. Generally speaking,…
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…
We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.
We give a characterization of decomposition theory in linear algebra.
Multiparameter persistence is a natural extension of the well-known persistent homology, which has attracted a lot of interest. However, there are major theoretical obstacles preventing the full development of this promising theory. In this…
Modularity is a general principle present in many fields. It offers attractive advantages, including, among others, ease of conceptualization, interpretability, scalability, module combinability, and module reusability. The deep learning…
Blind deconvolution and demixing is the problem of reconstructing convolved signals and kernels from the sum of their convolutions. This problem arises in many applications, such as blind MIMO. This work presents a separable approach to…
We study the indecomposable summands of the permutation module obtained by inducing the trivial $\mathbb{F}(S_a\wr S_n)$-module to the full symmetric group $S_{an}$ for any field $\mathbb{F}$ of odd prime characteristic $p$ such that…
We propose a novel method to conceptually decompose an existing annotation into separate levels, allowing the analysis of inter-annotators disagreement in each level separately. We suggest two distinct strategies in order to actualize this…
We establish a version of a semistable reduction theorem over a log point with a non-trivial nilpotent structure. In order to do this we extend the classical desingularization theories to non-reduced schemes with generically principal…
In this note we consider the question how the set of inversions of a permutation $\pi \in S_n$ can be partitioned into two subset, such that those are itself inversion sets of permutations. This is archived by exploiting a connection to a…
The notion of cosilting module was recently introduced as a generalization of the notion of cotilting module. In this paper, we give a characterization of (partial) cosilting modules in terms of two-term cosilting complexes. Moreover, we…
The main purpose of this paper is to apply the theory of vector lattices and the related abstract modular convergence to the context of Mellin-type kernels and (non)linear vector lattice-valued operators, following the construction of an…
In this paper, we describe a low-rank matrix completion method based on matrix decomposition. An incomplete matrix is decomposed into submatrices which are filled with a proposed trimming step and then are recombined to form a low-rank…
Over the past three decades, there have been several attempts to characterize modules over affine Lie superalgebras. One of the main issues in this regard is dealing with zero-level modules. In this paper, we study these modules and…
In this article we study the deformation of finite maps and show how to use this deformation theory to construct varieties with given invariants in a projective space. Among other things, we prove a criterion that determines when a finite…
Decomposing complex unitary evolution into a series of constituent components is a cornerstone of practical quantum information processing. While the decompostion of an $n\times n$ unitary into a series of $2\times2$ subunitaries is well…
The usage of elementary submodels is a simple but powerful method to prove theorems, or to simplify proofs in infinite combinatorics. First we introduce all the necessary concepts of logic, then we prove classical theorems using elementary…
Clustering attempts to partition data instances into several distinctive groups, while the similarities among data belonging to the common partition can be principally reserved. Furthermore, incomplete data frequently occurs in many…