English
Related papers

Related papers: The algebraic small object argument as a saturatio…

200 papers

We show that the restriction functor from oriented factor planar algebras to subfactor planar algebras admits a left adjoint, which we call the free oriented extension functor. We show that for any subfactor planar algebra realized as the…

Quantum Algebra · Mathematics 2018-10-09 Shamindra Kumar Ghosh , Corey Jones , B Madhav Reddy

We prove several new results on the structure of the subgroup generated by a small doubling subset of an ordered group, abelian or not. We obtain precise results generalizing Freiman's 3k-3 and 3k-2 theorems in the integers and several…

For self-similar sets, there are two important separation properties: the open set condition and the weak separation condition introduced by Zerner, which may be replaced by the formally stronger finite type property of Ngai and Wang. We…

Dynamical Systems · Mathematics 2024-04-09 Christoph Bandt , Michael F. Barnsley

This work creates two categories of "array-weighted sets" for the purposes of constructing universal matrix-normed spaces and algebras. These universal objects have the analogous universal property to the free vector space, lifting maps…

Functional Analysis · Mathematics 2017-06-06 Will Grilliette

In this mainly expository note, we state a criterion for when a left Kan extension of a lax monoidal functor along a strong monoidal functor can itself be equipped with a lax monoidal structure, in a way that results in a left Kan extension…

Category Theory · Mathematics 2018-09-28 Tobias Fritz , Paolo Perrone

Generators of the algebra of first class functions in a system with second class constraints are found. It is shown that first class functions form algebras with respect to the Dirac bracket and pointwise multiplication.The subspace of…

Mathematical Physics · Physics 2007-05-23 A. V. Bratchikov

Saturating sets are combinatorial objects in projective spaces over finite fields that have been intensively investigated in the last three decades. They are related to the so-called covering problem of codes in the Hamming metric. In this…

Combinatorics · Mathematics 2023-09-22 Daniele Bartoli , Martino Borello , Giuseppe Marino

In this paper we address the problem of generating all elements obtained by the saturation of an initial set by some operations. More precisely, we prove that we can generate the closure of a boolean relation (a set of boolean vectors) by…

Computational Complexity · Computer Science 2023-06-22 Arnaud Mary , Yann Strozecki

We develop the theory of subproduct systems over the monoid $\mathbb{N}\times \mathbb{N}$, and the non-self-adjoint operator algebras associated with them. These are double sequences of Hilbert spaces $\{X(m,n)\}_{m,n=0}^\infty$ equipped…

Operator Algebras · Mathematics 2012-03-27 Maxim Gurevich

We give a sufficient condition for an Ext-finite triangulated category to be saturated. Saturatedness means that every contravariant cohomological functor of finite type to vector spaces is representable. The condition consists in existence…

Algebraic Geometry · Mathematics 2007-05-23 Alexei Bondal , Michel Van den Bergh

In this paper we address the problem of generating all elements obtained by the saturation of an initial set by some operations. More precisely, we prove that we can generate the closure by polymorphisms of a boolean relation with a…

Computational Complexity · Computer Science 2015-09-22 Arnaud Mary , Yann Strozecki

A super-conformal map and a minimal surface are factored into a product of two maps by modeling the Euclidean four-space and the complex Euclidean plane on the set of all quaternions. One of these two maps is a holomorphic map or a…

Differential Geometry · Mathematics 2015-07-30 Katsuhiro Moriya

Towards better understanding of gate elimination, the only method known that can prove complexity lower bounds for explicit functions against unrestricted Boolean circuits, this work contributes: (1) formalizing circuit simplifications as a…

Computational Complexity · Computer Science 2026-02-23 Marco Carmosino , Ngu Dang , Tim Jackman

The set-theoretic large cardinal axiom known as I3 posits the existence of a non-trivial rank-to-rank embedding from an initial segment of the universe of sets into itself. Laver showed that the algebra generated by a single such embedding…

Logic · Mathematics 2025-08-05 Andrew D. Brooke-Taylor , Scott Cramer , Sheila K. Miller Edwards

Many homotopy-coherent algebraic structures can be described by Segal-type limit conditions determined by an "algebraic pattern", bywhich we mean an $\infty$-category equipped with a factorization system and a collection of "elementary"…

Algebraic Topology · Mathematics 2021-03-09 Hongyi Chu , Rune Haugseng

We introduce the notion of quantum duplicates of an (associative, unital) algebra, motivated by the problem of constructing toy-models for quantizations of certain configuration spaces in quantum mechanics. The proposed (algebraic) model…

Quantum Algebra · Mathematics 2014-02-26 Óscar Cortadellas , Javier López Peña , Gabriel Navarro

We establish a new connection between local and large-scale structure in compactly generated totally disconnected locally compact (t.d.l.c.) groups $G$, finding a sufficient condition for $G$ to have more than one end in terms of its…

Group Theory · Mathematics 2024-02-23 Pierre-Emmanuel Caprace , Timothée Marquis , Colin D. Reid

For several instances of metric largeness like enlargeability or having hyperspherical universal covers, we construct non-large vector subspaces in the rational homology of finitely generated groups. The functorial properties of this…

Geometric Topology · Mathematics 2014-02-26 Michael Brunnbauer , Bernhard Hanke

We show that in a locally lambda-presentable category, every lambda(m)-injectivity class (i.e., the class of all the objects injective with respect to some class of lambda-presentable morphisms) is a weakly reflective subcategory determined…

Category Theory · Mathematics 2007-05-23 Michel Hebert

Motivated by recent work on weak distributive laws and their applications to coalgebraic semantics, we investigate the algebraic nature of semialgebras for a monad. These are algebras for the underlying functor of the monad subject to the…

Logic in Computer Science · Computer Science 2021-12-30 Daniela Petrişan , Ralph Sarkis