Related papers: Factorization and complex couplings in SYK and in …
Mott noted a one-to-one correspondence between saturated multiplicatively closed subsets of a domain D and directed convex subgroups of the group of divisibility D. With this, we construct a functor between inclusions into saturated…
We propose a specific class of matrices which participate in factorization problems that turn to be equivalent to constant and entwining (non-constant) pentagon, reverse-pentagon or Yang-Baxter maps, expressed in non-commutative variables.…
In this paper, we formally introduce the concept of a row-sum matrix over an arbitrary group $G$. When $G$ is cyclic, these types of matrices have been widely used to build uniform 2-factorizations of small Cayley graphs (or, Cayley…
Factorization models express a statistical object of interest in terms of a collection of simpler objects. For example, a matrix or tensor can be expressed as a sum of rank-one components. However, in practice, it can be challenging to…
Matrix factorization is a well-studied task in machine learning for compactly representing large, noisy data. In our approach, instead of using the traditional concept of matrix rank, we define a new notion of link-rank based on a…
We want to construct a homological link invariant whose Euler characteristic is MOY polynomial as Khovanov and Rozansky constructed a categorification of HOMFLY polynomial. The present paper gives the first step to construct a…
The problem of decomposing a given covariance matrix as the sum of a positive semi-definite matrix of given rank and a positive semi-definite diagonal matrix, is considered. We present a projection-type algorithm to address this problem.…
For a regular normal element in an arbitrary ring, we study the category of its module factorizations. The cokernel functor relates module factorizations with Gorenstein projective components to Gorenstein projective modules over the…
We review three well known inconsistencies in the standard mathematical formulation of semiclassical gravity: the factorization problem, the information problem, and the closed universe problem. Building upon recent work, we explore how…
We study how coarse-graining procedure of an underlying UV-complete quantum gravity gives rise to a connected geometry. It has been shown, quantum entanglement plays a key role in the emergence of such a geometric structure, namely a smooth…
The topological string interpretation of homological knot invariants has led to several insights into the structure of the theory in the case of sl(N). We study possible extensions of the matrix factorization approach to knot homology for…
We introduce generalized pinning fields in conformal field theory that model a large class of critical impurities at large distance, enriching the familiar universality classes. We provide a rigorous definition of such defects as certain…
Matrix Factorization (MF) has found numerous applications in Machine Learning and Data Mining, including collaborative filtering recommendation systems, dimensionality reduction, data visualization, and community detection. Motivated by the…
We continue our study about the half-wormhole proposal. By generalizing the original proposal of half-wormhole we propose a new way to detect half-wormholes. The crucial idea is to decompose the observables into self-averaged sector and…
In this work, we study a type of commuting SYK model in which all terms in the Hamiltonian are commutative to each other. Because of the commutativity, this model has a large number of conserved charges and is integrable. After the ensemble…
The Boolean matrix factorization problem consists in approximating a matrix by the Boolean product of two smaller Boolean matrices. To obtain optimal solutions when the matrices to be factorized are small, we propose SAT and MaxSAT…
Given two otherwise decoupled $D$-dimensional CFTs which possess a common (finite) symmetry subcategory, one can consider entangled boundary states of their $(D+1)$-dimensional SymTFTs. This roughly corresponds to performing a gauging of…
Let $R$ be a commutative unital ring. A well-known factorization problem is whether any matrix in $\mathrm{SL}_n(R)$ is a product of elementary matrices with entries in $R$. To solve the problem, we use two approaches based on the notion of…
Factorization of matrices of Laurent polynomials plays an important role in mathematics and engineering such as wavelet frame construction and filter bank design. Wavelet frames (a.k.a. framelets) are useful in applications such as signal…
Matrix factorization methods are important tools in data mining and analysis. They can be used for many tasks, ranging from dimensionality reduction to visualization. In this paper we concentrate on the use of matrix factorizations for…