Making factorizations compositive
نویسنده
چکیده
The main aim of this paper is to obtain compositive cone factorizations from non-compositive ones by itereration. This is possible if and only if certain colimits of (possibly large) chains exist. In particular, we show that (strong-epi, mono) factorizations of cones exist if and only if joint coequalizers and colimits of chains of regular epimorphisms exist.
منابع مشابه
Research on System Integration Alliance of Urban Rail Transit Safety Monitoring
Fulfilling system integrated requirement of unitive resource management is the key issue of urban rail transit safety monitoring system. To solve this problem, firstly, this paper analyses the value chain of information flow. Then, it proposes alliance structure model and assesses method of compositive safety system. A model is also established for choosing system alliance with the aid of DEA a...
متن کاملAbstract: Data warehouse technology transforms the operational data store to general and compositive information
Data warehouse technology transforms the operational data store to general and compositive information. It also provides effective way for analysis and statistic to the mass data, and helps to do the decision-making. The paper introduces the data warehouse and the online analysis process. According to the power management information system, the paper analyzes the power-oriented multidimensiona...
متن کاملScalable Boolean Tensor Factorizations using Random Walks
Tensors are becoming increasingly common in data mining, and consequently, tensor factorizations are becoming more and more important tools for data miners. When the data is binary, it is natural to ask if we can factorize it into binary factors while simultaneously making sure that the reconstructed tensor is still binary. Such factorizations, called Boolean tensor factorizations, can provide ...
متن کاملPartitionable graphs arising from near-factorizations of finite groups
In 1979, two constructions for making partitionable graphs were introduced in (by Chv2 atal et al. (Ann. Discrete Math. 21 (1984) 197)). The graphs produced by the second construction are called CGPW graphs. A near-factorization (A; B) of a %nite group is roughly speaking a non-trivial factorization of G minus one element into two subsets A and B. Every CGPW graph with n vertices turns out to b...
متن کاملRiordan group approaches in matrix factorizations
In this paper, we consider an arbitrary binary polynomial sequence {A_n} and then give a lower triangular matrix representation of this sequence. As main result, we obtain a factorization of the innite generalized Pascal matrix in terms of this new matrix, using a Riordan group approach. Further some interesting results and applications are derived.
متن کامل