Unique prime factorization for infinite tensor product factors
نویسندگان
چکیده
منابع مشابه
Local Algorithms for the Prime Factorization of Strong Product Graphs
The practical application of graph prime factorization algorithms is limited in practice by unavoidable noise in the data. A first step towards error-tolerant “approximate” prime factorization, is the development of local approaches that cover the graph by factorizable patches and then use this information to derive global factors. We present here a local, quasi-linear algorithm for the prime f...
متن کاملInfinite Tensor Product and Thermodynamical Limit
In the canonical approach to Lorentzian Quantum General Relativity in four spacetime dimensions an important step forward has been made by Ashtekar, Isham and Lewandowski some eight years ago through the introduction of a Hilbert space structure which was later proved to be a faithful representation of the canonical commutation and adjointness relations of the quantum field algebra of diffeomor...
متن کاملUnique Prime Cartesian Factorization of Graphs over Finite Fields
A fundamental result, due to Sabidussi and Vizing, states that every connected graph has a unique prime factorization relative to the Cartesian product; but disconnected graphs are not uniquely prime factorable. This paper describes a system of modular arithmetic on graphs under which both connected and disconnected graphs have unique prime Cartesian factorizations.
متن کاملStrong Products of Hypergraphs: Unique Prime Factorization Theorems and Algorithms
It is well-known that all finite connected graphs have a unique prime factor decomposition (PFD) with respect to the strong graph product which can be computed in polynomial time. Essential for the PFD computation is the construction of the so-called Cartesian skeleton of the graphs under investigation. In this contribution, we show that every connected thin hypergraph H has a unique prime fact...
متن کاملProbabilistic Tensor Factorization for Tensor Completion
Multi-way tensor datasets emerge naturally in a variety of domains, such as recommendation systems, bioinformatics, and retail data analysis. The data in these domains usually contains a large number of missing entries. Therefore, many applications in those domains aim at missing value prediction, which boils down to a tensor completion problem. While tensor factorization algorithms can be a po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 2019
ISSN: 0022-1236
DOI: 10.1016/j.jfa.2018.07.015