English
Related papers

Related papers: Small object arguments, plus-construction, and lef…

200 papers

We prove a factorization formula for the point-to-point partition function associated with a model of directed polymers on the space-time lattice $\mathbb{Z}^{d+1}$, subject to an i.i.d. random potential and in the regime of weak disorder.…

Probability · Mathematics 2021-07-28 Tobias Hurth , Konstantin Khanin , Beatriz Navarro Lameda , Fedor Nazarov

Motivated by the desire for a new kind of approximation, we define a type of localization called pixelation. We present how pixelation manifests in representation theory and in the study of sites and sheaves. A path category is constructed…

Category Theory · Mathematics 2026-03-27 J. Daisie Rock

We define a commutative monoid structure on the poset of left-exact localizations of a higher topos, that we call the acyclic product. Our approach is anchored in a structural analogy between the poset of left-exact localizations of a topos…

Category Theory · Mathematics 2025-10-28 Mathieu Anel , Georg Biedermann , Eric Finster , André Joyal

This manuscript explores many convolution (restricted summation) type sequences via certain types of matrix based factorizations that can be used to express their generating functions. The last primary (non-appendix) section of the thesis…

Number Theory · Mathematics 2022-09-27 Maxie Dion Schmidt

Providing explanations about how machine learning algorithms work and/or make particular predictions is one of the main tools that can be used to improve their trusworthiness, fairness and robustness. Among the most intuitive type of…

Machine Learning · Computer Science 2024-04-12 Rubén Ruiz-Torrubiano

A concrete model of the free skew-monoidal category Fsk on a single generating object is obtained. The situation is clubbable in the sense of G.M. Kelly, so this allows a description of the free skew-monoidal category on any category. As…

Category Theory · Mathematics 2014-05-21 Stephen Lack , Ross Street

We investigate near-factorizations of nonabelian groups, concentrating on dihedral groups. We show that some known constructions of near-factorizations in dihedral groups yield equivalent near-factorizations. In fact, there are very few…

Group Theory · Mathematics 2025-01-29 Donald L. Kreher , Maura B. Paterson , Douglas R. Stinson

Learning to localize objects with minimal supervision is an important problem in computer vision, since large fully annotated datasets are extremely costly to obtain. In this paper, we propose a new method that achieves this goal with only…

Computer Vision and Pattern Recognition · Computer Science 2014-05-19 Hyun Oh Song , Ross Girshick , Stefanie Jegelka , Julien Mairal , Zaid Harchaoui , Trevor Darrell

Good colimits introduced by J. Lurie generalize transfinite composites and provide an important tool for understanding cofibrant generation in locally presentable categories. We will explore the relation of good colimits to transfinite…

Category Theory · Mathematics 2013-04-26 Michael Makkai , Jiří Rosický , Lukáš Vokřínek

We extend a result of Cisinski on the construction of cofibrantly generated model structures from (Grothendieck) toposes to locally presentable categories and from monomorphism to more general cofibrations. As in the original case, under…

Category Theory · Mathematics 2009-06-24 Marc Olschok

Let $\E$ be a finite dimensional Hilbert space. This note finds all factorizations of the right shift semigroup $\S^\E=(S_t^\E)_{t\ge 0}$ on $L^2(\R_+,\E)$ into the product of $n$ commuting contractive semigroups, i.e., characterizes all…

Functional Analysis · Mathematics 2026-02-03 Tirthankar Bhattacharyya , Shubham Rastogi , Kalyan B. Sinha , Vijaya Kumar U

We study sheaves in the context of a duality theory for lattice structure endowed with extra operations, and in the context of forcing in a topos. Using Sheaf duality theory of Comer for cylindric algebras, we give a representation theorem…

Logic · Mathematics 2018-11-06 Trek Sayed Ahmed

We present a technique for weakly supervised object localization (WSOL), building on the observation that WSOL algorithms usually work better on images with bigger objects. Instead of training the object detector on the entire training set…

Computer Vision and Pattern Recognition · Computer Science 2016-08-17 Miaojing Shi , Vittorio Ferrari

We prove a theorem which provides a method for constructing points on varieties defined by certain smooth functions. We require that the functions are definable in a definably complete expansion of a real closed field and are locally…

Logic · Mathematics 2014-02-26 G. O. Jones , A. J. Wilkie

In this paper, we prove that for a noetherian formal scheme X, its derived category of sheaves of modules with quasi-coherent torsion homologies D_qct(X) is generated by a single compact object. In an appendix we prove that the category of…

Algebraic Geometry · Mathematics 2017-04-27 Leovigildo Alonso , Ana Jeremias , Marta Perez , Maria J. Vale

The injective right comodules appearing in the minimal injective resolution of a finite-dimensional comodule need not to be of finite dimension or even quasi-finite. The obstruction here is that factor comodules of quasi-finite comodules…

Rings and Algebras · Mathematics 2007-05-23 J. Gomez-Torrecillas , C. Nastasescu , B. Torrecillas

We study t-structures generated by sets of objects which satisfy a condition weaker than the compactness. We also study weight structures cogenerated by sets of objects satisfying the dual condition. Under some appropriate hypothesis, it…

Category Theory · Mathematics 2020-02-05 George Ciprian Modoi

This paper provides a comprehensive overview of some of the foundational properties of categories enriched over quantaloids, along with several new results. We demonstrate that the category whose objects are quantaloid-enriched categories…

Category Theory · Mathematics 2025-10-14 Javier Gutiérrez García , Ulrich Höhle

For the minimization of state-based systems (i.e. the reduction of the number of states while retaining the system's semantics), there are two obvious aspects: removing unnecessary states of the system and merging redundant states in the…

Formal Languages and Automata Theory · Computer Science 2025-12-15 Thorsten Wißmann

This paper proposes a general machine learning framework called the localization method, which is fundamentally built on two core concepts: localization kernels and local means -- key components that underpin the self-attention mechanism.…

Machine Learning · Computer Science 2026-05-28 Congwei Song