Related papers: Weak Factorization System for Actions of Po-monoid…
Let M, N be monoids, and PSh(M), PSh(N) their respective categories of right actions on sets. In this paper, we systematically investigate correspondences between properties of geometric morphisms PSh(M) $\rightarrow$ PSh(N) and properties…
In this paper we introduce the notion of weak operator and the theory of Yetter-Drinfeld modules over a weak braided Hopf algebra with invertible antipode in a strict monoidal category. We prove that the class of such objects constitutes a…
This paper studies several aspects of symbolic ({\em i.e.}\ subshift) factors of $\mathcal{S}$-adic subshifts of finite alphabet rank. First, we address a problem raised in [DDPM20] about the topological rank of symbolic factors of…
Nonnegative matrix factorization (NMF) is a popular model in the field of pattern recognition. It aims to find a low rank approximation for nonnegative data M by a product of two nonnegative matrices W and H. In general, NMF is NP-hard to…
A semidomain is a subsemiring of an integral domain. Within this class, a unique factorization semidomain (UFS) is characterized by the property that every nonzero, nonunit element can be factored into a product of finitely many prime…
An (additive) commutative monoid is called atomic if every given non-invertible element can be written as a sum of atoms (i.e., irreducible elements), in which case, such a sum is called a factorization of the given element. The number of…
We study classes of proper restriction semigroups determined by properties of partial actions underlying them. These properties include strongness, antistrongness, being defined by a homomorphism, being an action etc. Of particular interest…
Let $\cX$ be a family of subsets of a finite set $E$. A matroid on $E$ is called an $\cX$-matroid if each set in $\cX$ is a circuit. We consider the problem of determining when there exists a unique maximal $\cX$-matroid in the weak order…
We introduce the concept of weak-localization for generalized frames and use this concept to define a class of weakly localized operators. This class contains many important operators, including: Short Time Fourier Transform multipliers,…
We define a simple kind of higher inductive type generalising dependent $W$-types, which we refer to as $W$-types with reductions. Just as dependent $W$-types can be characterised as initial algebras of certain endofunctors (referred to as…
Solomon showed that the Poincar\'e polynomial of a Coxeter group $W$ satisfies a product decomposition depending on the exponents of $W$. This polynomial coincides with the rank-generating function of the poset of regions of the underlying…
We prove a basic property of continuous multilinear mappings between topological vector spaces, from which we derive an easy proof of the fact that a multilinear mapping (and a polynomial) between topological vector spaces is weakly…
We study arithmetic properties of factorizations of elements into products of generators, in monoids given with explicit presentations. After relating and comparing this perspective to the more usual approach of factoring into products of…
Each restriction semigroup is proved to be embeddable in a factorisable restriction monoid, or, equivalently, in an almost factorisable restriction semigroup. It is also established that each restriction semigroup has a proper cover which…
Delta lenses are functors equipped with a suitable choice of lifts, generalising the notion of split opfibration. In recent work, delta lenses were characterised as the right class of an algebraic weak factorisation system. In this paper,…
The operator level proof of factorization theorem exhibited in [1] is extended to the semi-inclusive deep inelastic scattering process(SIDIS). Factorization theorem can be proved at operator level if there are not detected soft hadrons.
Factorization theorems underly our ability to make predictions for many processes involving the strong interaction. Although typically formulated at leading power, the study of factorization at subleading power is of interest both for…
We introduce a notion of antipode for monoidal (complete) decomposition spaces, inducing a notion of weak antipode for their incidence bialgebras. In the connected case, this recovers the usual notion of antipode in Hopf algebras. In the…
We study the (so-called bilinear) factorization problem answered by a weak wreath product (of monads and, more specifically, of algebras over a commutative ring) in the works by Street and by Caenepeel and De Groot. A bilinear factorization…
The incidence algebra of a partially ordered set (poset) supports in a natural way also a coalgebra structure, so that it becomes a m-weak bialgebra even a m-weak Hopf algebra with M\"obius function as antipode. Here m-weak means that…