Related papers: Weak Factorization System for Actions of Po-monoid…
Let $S$ be an infinite discrete semigroup. The operation on $S$ extends uniquely to the Stone-\v{C}ech compactification $\beta S$ making $\beta S$ a compact right topological semigroup with $S$ contained in its topological center. As such,…
We introduce the strong recursive skeletonization factorization (RS-S), a new approximate matrix factorization based on recursive skeletonization for solving discretizations of linear integral equations associated with elliptic partial…
Using methods from soft-collinear and heavy-quark effective theory, a systematic factorization analysis is performed for the $\bar B\to X_s\gamma$ photon spectrum in the endpoint region $m_b-2E_\gamma={\cal O}(\Lambda_{\rm QCD})$. It is…
We extend the facial weak order from finite Coxeter groups to central hyperplane arrangements. The facial weak order extends the poset of regions of a hyperplane arrangement to all its faces. We provide four non-trivially equivalent…
In this paper the concept of compatible weak factorization systems in general categories is introduced as a counterpart of compatible complete cotorsion pairs in abelian categories. We describe a method to construct model structures on…
Given an exact category $\mathcal{C}$, it is well known that the connected component reflector $\pi_0\colon\mathsf{Gpd}(\mathcal{C})\to\mathcal{C}$ from the category $\mathsf{Gpd}(\mathcal{C})$ of internal groupoids in $\mathcal{C}$ to the…
The number of embeddings of a partially ordered set $S$ in a partially ordered set $T$ is the number of subposets of $T$ isomorphic to $S$. If both, $S$ and $T$, have only one unique maximal element, we define good embeddings as those in…
A binary relation defined on a poset is a weakening relation if the partial order acts as a both-sided compositional identity. This is motivated by the weakening rule in sequent calculi and closely related to models of relevance logic. For…
Predicting unobserved entries of a partially observed matrix has found wide applicability in several areas, such as recommender systems, computational biology, and computer vision. Many scalable methods with rigorous theoretical guarantees…
We introduce and study a general notion of polynomial functor from a small monoidal symmetric category whose unit is an initial object and give a classification result of polynomial functors of degree smaller of equal to n modulo those of…
In this article, we propose to initiate the general study of involution systems. An {\em involution system}, that is, a group $W$ generated by a set of involutions $S$, is naturally endowed with a {\em weak order} arising from orienting the…
In this paper, we propose a new low-rank matrix factorization model dubbed bounded simplex-structured matrix factorization (BSSMF). Given an input matrix $X$ and a factorization rank $r$, BSSMF looks for a matrix $W$ with $r$ columns and a…
For a finite group $G$, $G$-transfer systems are combinatorial objects which encode the homotopy category of $G$-$N_\infty$ operads, whose algebras in $G$-spectra are $E_\infty$ $G$-spectra with a specified collection of multiplicative…
Gradient descent for matrix factorization exhibits an implicit bias toward approximately low-rank solutions. While existing theories often assume the boundedness of iterates, empirically the bias persists even with unbounded sequences. This…
The non-empty finite subsets of a multiplicatively written monoid form a monoid under setwise multiplication. The same holds for finite subsets containing the identity element. Partly due to their unusual arithmetic properties, these…
In [BaSc2] the authors introduced a much weaker homotopical structure than a model category, called a "weak cofibration category". We further showed that a small weak cofibration category induces in a natural way a model category structure…
We define strict and lax orthogonal factorization systems on double categories. These consist of an orthogonal factorization system on arrows and one on double cells that are compatible with each other. Our definitions are motivated by…
A partial ordering P is said to have the weak Freese-Nation property (WFN) if there is a mapping f:P ---> [P]^{<= aleph_0} such that, for any a, b in P, if a <= b then there exists c in f(a) cap f(b) such that a <= c <= b. In this note, we…
This paper is an attempt to measure the difference between the family of iterated function systems attractors and a broader family, the set of attractors for weak iterated function systems. We discuss Borel complexity of the set wIFS$^d$ of…
We focus on two factorization systems for opfibrations in the 2-category Fib(B) of fibrations over a fixed base category B. The first one is the internal version of the so called comprehensive factorization, where the right orthogonal class…