Related papers: Enriched factorization systems
Group lifting structures are introduced to provide an algebraic framework for studying lifting factorizations of two-channel perfect reconstruction finite-impulse-response (FIR) filter banks. The lifting factorizations generated by a group…
A consistent factorization theorem is presented in the framework of effective field theories. Conventional factorization suffers from infrared divergences in the soft and collinear parts. We present a factorization theorem in which the…
We develop a theory of weighted colimits in the framework of weakly bienriched $\infty$-categories, an extension of Lurie's notion of enriched $\infty$-categories. We prove an existence result for weighted colimits, study weighted colimits…
We propose a generalization of continuous lattices and domains through the concept of enriched closure space, defined as a closure space equipped with a preclosure operator satisfying some compatibility conditions. In this framework we are…
We extend Lurie's definition of enriched $\infty$-categories to notions of left enriched, right enriched and bienriched $\infty$-categories, which generalize the concepts of closed left tensored, right tensored and bitensored…
We relativise double categories of relations to stable orthogonal factorisation systems. Furthermore, we present the characterisation of the relative double categories of relations in two ways. The first utilises a generalised comprehension…
Factorization of numbers with the help of Gauss sums relies on an intimate relationship between the maxima of these functions and the factors. Indeed, when we restrict ourselves to integer arguments of the Gauss sum we profit from a…
A detailed proof of hard scattering factorization is given with the inclusion of heavy quark masses. Although the proof is explicitly given for deep-inelastic scattering, the methods apply more generally The power-suppressed corrections to…
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects we call m-schemes. We extend the known conditional deterministic subexponential time polynomial factoring…
This rough note describes some attempts to define a notion of enriched topology (and the associated theory of enriched stacks) on a category enriched over a symmetric monoidal model category, and poses some related questions.
Mackey functors provide the coefficient systems for equivariant cohomology theories. More generally, enriched presheaf categories provide a classification and organization for many stable model categories of interest. Changing enrichments…
We consider the problem of deterministically factoring a univariate polynomial over a finite field under the assumption of the Extended Riemann Hypothesis (ERH). This work builds upon the line of approach first explored by Gao in $2001$.…
The strong factorization conjecture states that a proper birational map between smooth algebraic varieties over a field of characteristic zero can be factored as a sequence of smooth blowups followed by a sequence of smooth blowdowns. We…
This is a first stab at a mathematical framework in which one can study quantum field theories on spacetimes with quite general geometries. We will study these theories via their factorization algebras. The aim is to identify a minimalist…
We use the periodicity properties of generalized Gauss sums to factor numbers. Moreover, we derive rules for finding the factors and illustrate this factorization scheme for various examples. This algorithm relies solely on interference and…
Rough sets are approximations of concrete sets. The theory of rough sets has been used widely for data-mining. While it is well-known that adjunctions are underlying in rough approximations, such adjunctions are not enough for…
A subset $S$ of an integral domain $R$ is called a semidomain provided that the pairs $(S,+)$ and $(S, \cdot)$ are semigroups with identities. The study of factorizations in integral domains was initiated by Anderson, Anderson, and…
We develop first steps in the study of factorizations of elements in ultraproducts of commutative cancellative monoids into irreducible elements. A complete characterization of the (multi-)sets of lengths in such objects is given. As…
R. Doney identifies a striking factorization of the arc-sine law in terms of the suprema of two independent stable processes of the same index by an elegant random walks approximation. In this paper, we provide an alternative proof and a…
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…