Related papers: An orthogonal approach to algebraic weak factorisa…
Introduced in the 1990s in the context of the algebraic approach to graph rewriting, gs-monoidal categories are symmetric monoidal categories where each object is equipped with the structure of a commutative comonoid. They arise for example…
Given an algebraic theory which can be described by a (possibly symmetric) operad $P$, we propose a definition of the \emph{weakening} (or \emph{categorification}) of the theory, in which equations that hold strictly for $P$-algebras hold…
When one studies the structure (e.g. graded ideals, graded subspaces, radicals, ...) or graded polynomial identities of graded algebras, the grading group itself does not play an important role, but can be replaced by any other group that…
After two papers on weak cubical categories and {\it collarable} cospans, respectively, we put things together and construct a {\it weak} cubical category of cubical {\it collared} cospans of topological spaces. We also build a second…
We present a mechanism which lifts a multiplicative lattice to a (weak) ideal system on some monoid.
We construct an algebraic weak factorization system $(L, R)$ on the cartesian cubical sets, in which the canonical path object factorization $A \to A^I \to A\times A$ induced by the 1-cube $I$ is an $L$-$R$ factorization for any $R$-object…
This paper introduces the notion of weakly globular double categories, a particular class of strict double categories, as a way to model weak 2-categories; it explores its use in defining a double category of fractions, and shows that the…
The aim of this paper is to introduce an algebraic structure on the set of all coalgebras with the same state space over the given type which allows us to present definitions of weak and delay bisimulation for coalgebras. Additionally, we…
We develop a new way of writing the Lame Hamiltonian in Lie-algebraic form. This yields, in a natural way, an explicit formula for both the Lame polynomials and the classical non-meromorphic Lame functions in terms of Chebyshev polynomials…
We describe a simple approach to factorize non-commutative (nc) polynomials, that is, elements in free associative algebras (over a commutative field), into atoms (irreducible elements) based on (a special form of) their minimal linear…
The relative cell complexes with respect to a generating set of cofibrations are an important class of morphisms in any model structure. In the particular case of the standard (algebraic) model structure on $\textbf{Top}$, we give a new…
Monads can be interpreted as encoding formal expressions, or formal operations in the sense of universal algebra. We give a construction which formalizes the idea of "evaluating an expression partially": for example, "2+3" can be obtained…
We propose a new formalism for specifying and reasoning about problems that involve heterogeneous "pieces of information" -- large collections of data, decision procedures of any kind and complexity and connections between them. The essence…
A theorem of Davis, Figiel, Johnson and Pe{\l}czy\'nski tells us that weakly-compact operators between Banach spaces factor through reflexive Banach spaces. The machinery underlying this result is that of the real interpolation method,…
We define the category 2-Cob combinatorially and use this definition to prove the existence of an orthogonal factorization system. In the second half of the paper, we define oriented 1-Cob similarly and define a functor from oriented 1-Cob…
We introduce the notion of ungraded matrix factorization as a mirror of non-orientable Lagrangian submanifolds. An ungraded matrix factorization of a polynomial $W$, with coefficients in a field of characteristic 2, is a square matrix $Q$…
An algebraic approach for factorizing nonlinear partial differential equations (PDEs) and systems of PDEs is provided. In the particular case of second order linear and nonlinear PDEs and systems of PDEs, necessary and sufficient conditions…
We show that first-order logic can be translated into a very simple and weak logic, and thus set theory can be formalized in this weak logic. This weak logical system is equivalent to the equational theory of Boolean algebras with three…
We extend the framework of abstract algebraic logic to weak logics, namely logical systems which are not necessarily closed under uniform substitution. We interpret weak logics by algebras expanded with an additional predicate and we…
Weighted monadic second-order logic is a weighted extension of monadic second-order logic that captures exactly the behaviour of weighted automata. Its semantics is parameterized with respect to a semiring on which the values that weighted…