Related papers: High-level methods for homotopy construction in as…
Coherence theorems for covariant structures carried by a category have traditionally relied on the underlying term rewriting system of the structure being terminating and confluent. While this holds in a variety of cases, it is not a…
Many natural combinatorial quantities can be expressed by counting the number of homomorphisms to a fixed relational structure. For example, the number of 3-colorings of an undirected graph $G$ is equal to the number of homomorphisms from…
We provide a criterion for the existence of right approximations in cocomplete additive categories; it is a straightforward generalisation of a result due to El Bashir. This criterion is used to construct adjoint functors in homotopy…
The purpose of this dissertation is to set up a theory of generalized operads and multicategories, and to use it as a language in which to propose a definition of weak n-category. Included is a full explanation of why the proposed…
An n-category is some sort of algebraic structure consisting of objects, morphisms between objects, 2-morphisms between morphisms, and so on up to n-morphisms, together with various ways of composing them. We survey various concepts of…
We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…
One of the prime motivation for topology was Homotopy theory, which captures the general idea of a continuous transformation between two entities, which may be spaces or maps. In later decades, an algebraic formulation of topology was…
The main theme of this paper is to study $\tau$-tilting subcategories in an abelian category $\mathscr{A}$ with enough projective objects. We introduce the notion of $\tau$-cotorsion torsion triples and show a bijection between the…
Many definitions of weak and strict $\infty$-categories have been proposed. In this paper we present a definition for $\infty$-categories with strict associators, but which is otherwise fully weak. Our approach is based on the existing type…
We now have a wide range of proof assistants available for compositional reasoning in monoidal or higher categories which are free on some generating signature. However, none of these allow us to represent categorical operations such as…
Many applications modeled by polynomial systems have positive dimensional solution components (e.g., the path synthesis problems for four-bar mechanisms) that are challenging to compute numerically by homotopy continuation methods. A…
This paper presents a novel set of algorithms for heap abstraction, identifying logically related regions of the heap. The targeted regions include objects that are part of the same component structure (recursive data structure). The result…
We endow the category of bialgebras over a pair of operads in distribution with a cofibrantly generated model category structure. We work in the category of chain complexes over a field of characteristic zero. We split our construction in…
Assembly Theory, as developed by Cronin and co-workers, assigns to an object an assembly index: the minimal number of binary join operations required to build at least one copy of the object from a specified set of basic building blocks,…
To every minimal model of a complete local isolated cDV singularity Donovan--Wemyss associate a finite dimensional symmetric algebra known as the contraction algebra. We construct the first known standard derived equivalences between these…
We explain how to see finite combinatorics of preorders implicit in the {text} of basic topological definitions or arguments in (Bourbaki, General topology, Ch.I), and define a concise combinatorial notation such that complete definitions…
We prove an adjoint functor theorem in the setting of categories enriched in a monoidal model category $\mathcal V$ admitting certain limits. When $\mathcal V$ is equipped with the trivial model structure this recaptures the enriched…
We study the homotopy theory of a certain type of diagram categories whose vertices are in variable categories with a functorial path, leading to a good calculation of the homotopy category in terms of cofibrant objects. The theory is…
A model category is called combinatorial if it is cofibrantly generated and its underlying category is locally presentable. As shown in recent years, homotopy categories of combinatorial model categories share useful properties, such as…
We build on recent work of Yeats, Courtiel, and others involving connected chord diagrams. We first derive from a Hopf-algebraic foundation a class of tree-like functional equations and prove that they are solved by weighted generating…